./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_14-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3dbbec33 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/locks/test_locks_14-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c --- Real Ultimate output --- This is Ultimate 0.2.2-?-3dbbec3 [2023-02-14 14:01:31,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 14:01:31,772 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 14:01:31,806 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 14:01:31,807 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 14:01:31,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 14:01:31,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 14:01:31,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 14:01:31,813 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 14:01:31,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 14:01:31,817 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 14:01:31,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 14:01:31,819 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 14:01:31,821 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 14:01:31,822 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 14:01:31,823 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 14:01:31,823 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 14:01:31,824 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 14:01:31,825 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 14:01:31,829 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 14:01:31,829 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 14:01:31,830 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 14:01:31,831 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 14:01:31,831 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 14:01:31,837 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 14:01:31,837 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 14:01:31,838 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 14:01:31,839 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 14:01:31,839 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 14:01:31,839 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 14:01:31,840 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 14:01:31,840 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 14:01:31,841 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 14:01:31,843 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 14:01:31,843 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 14:01:31,843 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 14:01:31,844 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 14:01:31,844 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 14:01:31,844 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 14:01:31,845 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 14:01:31,846 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 14:01:31,846 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-14 14:01:31,869 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 14:01:31,869 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 14:01:31,869 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 14:01:31,869 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 14:01:31,870 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 14:01:31,870 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 14:01:31,871 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 14:01:31,871 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 14:01:31,871 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 14:01:31,871 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 14:01:31,872 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 14:01:31,872 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 14:01:31,872 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 14:01:31,872 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 14:01:31,872 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 14:01:31,872 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 14:01:31,873 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 14:01:31,873 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 14:01:31,873 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 14:01:31,873 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 14:01:31,873 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 14:01:31,873 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 14:01:31,873 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 14:01:31,873 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 14:01:31,874 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 14:01:31,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 14:01:31,874 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 14:01:31,874 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 14:01:31,875 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 14:01:31,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 14:01:31,875 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 14:01:31,875 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 14:01:31,875 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 14:01:31,875 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 14:01:31,875 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c [2023-02-14 14:01:32,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 14:01:32,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 14:01:32,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 14:01:32,110 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 14:01:32,111 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 14:01:32,111 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_14-2.c [2023-02-14 14:01:33,050 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 14:01:33,194 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 14:01:33,194 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-2.c [2023-02-14 14:01:33,199 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ebf65cc0/2424a2daaf164a9c9fbf1e28bc14c29d/FLAGd59b28cd7 [2023-02-14 14:01:33,208 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ebf65cc0/2424a2daaf164a9c9fbf1e28bc14c29d [2023-02-14 14:01:33,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 14:01:33,211 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 14:01:33,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 14:01:33,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 14:01:33,214 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 14:01:33,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 02:01:33" (1/1) ... [2023-02-14 14:01:33,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25fd1933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:01:33, skipping insertion in model container [2023-02-14 14:01:33,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 02:01:33" (1/1) ... [2023-02-14 14:01:33,220 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 14:01:33,232 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 14:01:33,325 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-2.c[5305,5318] [2023-02-14 14:01:33,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 14:01:33,335 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 14:01:33,353 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-2.c[5305,5318] [2023-02-14 14:01:33,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 14:01:33,366 INFO L208 MainTranslator]: Completed translation [2023-02-14 14:01:33,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:01:33 WrapperNode [2023-02-14 14:01:33,367 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 14:01:33,367 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 14:01:33,368 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 14:01:33,368 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 14:01:33,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:01:33" (1/1) ... [2023-02-14 14:01:33,376 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:01:33" (1/1) ... [2023-02-14 14:01:33,389 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 184 [2023-02-14 14:01:33,390 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 14:01:33,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 14:01:33,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 14:01:33,391 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 14:01:33,397 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:01:33" (1/1) ... [2023-02-14 14:01:33,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:01:33" (1/1) ... [2023-02-14 14:01:33,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:01:33" (1/1) ... [2023-02-14 14:01:33,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:01:33" (1/1) ... [2023-02-14 14:01:33,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:01:33" (1/1) ... [2023-02-14 14:01:33,403 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:01:33" (1/1) ... [2023-02-14 14:01:33,404 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:01:33" (1/1) ... [2023-02-14 14:01:33,405 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:01:33" (1/1) ... [2023-02-14 14:01:33,407 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 14:01:33,407 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 14:01:33,407 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 14:01:33,408 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 14:01:33,408 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:01:33" (1/1) ... [2023-02-14 14:01:33,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 14:01:33,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:01:33,431 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-14 14:01:33,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-14 14:01:33,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 14:01:33,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 14:01:33,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 14:01:33,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 14:01:33,511 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 14:01:33,513 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 14:01:33,711 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 14:01:33,716 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 14:01:33,716 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-14 14:01:33,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:01:33 BoogieIcfgContainer [2023-02-14 14:01:33,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 14:01:33,719 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 14:01:33,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 14:01:33,721 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 14:01:33,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 02:01:33" (1/3) ... [2023-02-14 14:01:33,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1595aa21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 02:01:33, skipping insertion in model container [2023-02-14 14:01:33,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:01:33" (2/3) ... [2023-02-14 14:01:33,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1595aa21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 02:01:33, skipping insertion in model container [2023-02-14 14:01:33,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:01:33" (3/3) ... [2023-02-14 14:01:33,723 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_14-2.c [2023-02-14 14:01:33,736 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 14:01:33,736 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-02-14 14:01:33,764 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 14:01:33,769 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@53a9d4f2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 14:01:33,769 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-02-14 14:01:33,772 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 50 states have (on average 1.94) internal successors, (97), 52 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:33,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-14 14:01:33,776 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 14:01:33,776 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-14 14:01:33,777 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-14 14:01:33,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:01:33,780 INFO L85 PathProgramCache]: Analyzing trace with hash 28943010, now seen corresponding path program 1 times [2023-02-14 14:01:33,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:01:33,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867732519] [2023-02-14 14:01:33,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:01:33,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:01:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:01:33,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:01:33,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:01:33,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867732519] [2023-02-14 14:01:33,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867732519] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:01:33,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:01:33,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 14:01:33,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903410933] [2023-02-14 14:01:33,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:01:33,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-14 14:01:33,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:01:33,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-14 14:01:33,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 14:01:33,915 INFO L87 Difference]: Start difference. First operand has 53 states, 50 states have (on average 1.94) internal successors, (97), 52 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:33,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:01:33,959 INFO L93 Difference]: Finished difference Result 53 states and 94 transitions. [2023-02-14 14:01:33,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-14 14:01:33,961 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-14 14:01:33,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 14:01:33,972 INFO L225 Difference]: With dead ends: 53 [2023-02-14 14:01:33,973 INFO L226 Difference]: Without dead ends: 51 [2023-02-14 14:01:33,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 14:01:33,977 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 14:01:33,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 14:01:34,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-14 14:01:34,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-02-14 14:01:34,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:34,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 92 transitions. [2023-02-14 14:01:34,021 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 92 transitions. Word has length 5 [2023-02-14 14:01:34,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 14:01:34,022 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 92 transitions. [2023-02-14 14:01:34,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:34,022 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 92 transitions. [2023-02-14 14:01:34,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 14:01:34,023 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 14:01:34,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 14:01:34,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 14:01:34,024 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-14 14:01:34,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:01:34,025 INFO L85 PathProgramCache]: Analyzing trace with hash 889700139, now seen corresponding path program 1 times [2023-02-14 14:01:34,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:01:34,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168565268] [2023-02-14 14:01:34,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:01:34,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:01:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:01:34,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:01:34,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:01:34,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168565268] [2023-02-14 14:01:34,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168565268] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:01:34,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:01:34,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 14:01:34,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217934954] [2023-02-14 14:01:34,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:01:34,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 14:01:34,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:01:34,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 14:01:34,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 14:01:34,126 INFO L87 Difference]: Start difference. First operand 51 states and 92 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:34,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:01:34,142 INFO L93 Difference]: Finished difference Result 50 states and 91 transitions. [2023-02-14 14:01:34,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 14:01:34,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-14 14:01:34,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 14:01:34,144 INFO L225 Difference]: With dead ends: 50 [2023-02-14 14:01:34,144 INFO L226 Difference]: Without dead ends: 48 [2023-02-14 14:01:34,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 14:01:34,145 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 86 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 14:01:34,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 91 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 14:01:34,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-02-14 14:01:34,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-02-14 14:01:34,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:34,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 89 transitions. [2023-02-14 14:01:34,150 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 89 transitions. Word has length 6 [2023-02-14 14:01:34,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 14:01:34,150 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 89 transitions. [2023-02-14 14:01:34,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:34,150 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 89 transitions. [2023-02-14 14:01:34,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 14:01:34,151 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 14:01:34,151 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:01:34,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 14:01:34,152 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-14 14:01:34,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:01:34,152 INFO L85 PathProgramCache]: Analyzing trace with hash 792943379, now seen corresponding path program 1 times [2023-02-14 14:01:34,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:01:34,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064268] [2023-02-14 14:01:34,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:01:34,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:01:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:01:34,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:01:34,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:01:34,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064268] [2023-02-14 14:01:34,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064268] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:01:34,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:01:34,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 14:01:34,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841028440] [2023-02-14 14:01:34,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:01:34,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 14:01:34,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:01:34,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 14:01:34,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 14:01:34,227 INFO L87 Difference]: Start difference. First operand 48 states and 89 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:34,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:01:34,246 INFO L93 Difference]: Finished difference Result 93 states and 173 transitions. [2023-02-14 14:01:34,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 14:01:34,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-14 14:01:34,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 14:01:34,248 INFO L225 Difference]: With dead ends: 93 [2023-02-14 14:01:34,248 INFO L226 Difference]: Without dead ends: 93 [2023-02-14 14:01:34,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 14:01:34,249 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 68 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 14:01:34,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 174 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 14:01:34,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-14 14:01:34,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 63. [2023-02-14 14:01:34,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:34,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 118 transitions. [2023-02-14 14:01:34,256 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 118 transitions. Word has length 21 [2023-02-14 14:01:34,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 14:01:34,257 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 118 transitions. [2023-02-14 14:01:34,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:34,257 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 118 transitions. [2023-02-14 14:01:34,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 14:01:34,258 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 14:01:34,258 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:01:34,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-14 14:01:34,258 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-14 14:01:34,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:01:34,259 INFO L85 PathProgramCache]: Analyzing trace with hash 792950571, now seen corresponding path program 1 times [2023-02-14 14:01:34,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:01:34,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979067964] [2023-02-14 14:01:34,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:01:34,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:01:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:01:34,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:01:34,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:01:34,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979067964] [2023-02-14 14:01:34,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979067964] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:01:34,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:01:34,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 14:01:34,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352621873] [2023-02-14 14:01:34,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:01:34,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 14:01:34,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:01:34,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 14:01:34,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 14:01:34,296 INFO L87 Difference]: Start difference. First operand 63 states and 118 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:34,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:01:34,311 INFO L93 Difference]: Finished difference Result 94 states and 173 transitions. [2023-02-14 14:01:34,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 14:01:34,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-14 14:01:34,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 14:01:34,313 INFO L225 Difference]: With dead ends: 94 [2023-02-14 14:01:34,313 INFO L226 Difference]: Without dead ends: 94 [2023-02-14 14:01:34,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 14:01:34,314 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 71 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 14:01:34,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 224 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 14:01:34,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-14 14:01:34,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2023-02-14 14:01:34,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:34,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 172 transitions. [2023-02-14 14:01:34,321 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 172 transitions. Word has length 21 [2023-02-14 14:01:34,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 14:01:34,322 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 172 transitions. [2023-02-14 14:01:34,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:34,322 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 172 transitions. [2023-02-14 14:01:34,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 14:01:34,323 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 14:01:34,323 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:01:34,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-14 14:01:34,323 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-14 14:01:34,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:01:34,324 INFO L85 PathProgramCache]: Analyzing trace with hash -795404523, now seen corresponding path program 1 times [2023-02-14 14:01:34,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:01:34,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226497435] [2023-02-14 14:01:34,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:01:34,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:01:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:01:34,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:01:34,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:01:34,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226497435] [2023-02-14 14:01:34,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226497435] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:01:34,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:01:34,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 14:01:34,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939733100] [2023-02-14 14:01:34,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:01:34,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 14:01:34,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:01:34,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 14:01:34,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 14:01:34,356 INFO L87 Difference]: Start difference. First operand 92 states and 172 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:34,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:01:34,367 INFO L93 Difference]: Finished difference Result 96 states and 173 transitions. [2023-02-14 14:01:34,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 14:01:34,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-14 14:01:34,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 14:01:34,368 INFO L225 Difference]: With dead ends: 96 [2023-02-14 14:01:34,368 INFO L226 Difference]: Without dead ends: 96 [2023-02-14 14:01:34,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 14:01:34,369 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 69 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 14:01:34,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 198 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 14:01:34,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-14 14:01:34,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2023-02-14 14:01:34,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:34,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 172 transitions. [2023-02-14 14:01:34,375 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 172 transitions. Word has length 21 [2023-02-14 14:01:34,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 14:01:34,375 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 172 transitions. [2023-02-14 14:01:34,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:34,376 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 172 transitions. [2023-02-14 14:01:34,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 14:01:34,376 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 14:01:34,376 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:01:34,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-14 14:01:34,377 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-14 14:01:34,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:01:34,377 INFO L85 PathProgramCache]: Analyzing trace with hash -795397331, now seen corresponding path program 1 times [2023-02-14 14:01:34,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:01:34,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196118313] [2023-02-14 14:01:34,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:01:34,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:01:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:01:34,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:01:34,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 14:01:34,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196118313] [2023-02-14 14:01:34,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196118313] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:01:34,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:01:34,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 14:01:34,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287832303] [2023-02-14 14:01:34,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:01:34,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 14:01:34,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 14:01:34,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 14:01:34,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 14:01:34,405 INFO L87 Difference]: Start difference. First operand 94 states and 172 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:34,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:01:34,421 INFO L93 Difference]: Finished difference Result 127 states and 228 transitions. [2023-02-14 14:01:34,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 14:01:34,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-14 14:01:34,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 14:01:34,423 INFO L225 Difference]: With dead ends: 127 [2023-02-14 14:01:34,423 INFO L226 Difference]: Without dead ends: 127 [2023-02-14 14:01:34,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 14:01:34,424 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 70 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 14:01:34,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 125 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 14:01:34,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-14 14:01:34,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2023-02-14 14:01:34,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.8306451612903225) internal successors, (227), 124 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:34,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 227 transitions. [2023-02-14 14:01:34,437 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 227 transitions. Word has length 21 [2023-02-14 14:01:34,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 14:01:34,437 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 227 transitions. [2023-02-14 14:01:34,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:34,437 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 227 transitions. [2023-02-14 14:01:34,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 14:01:34,438 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 14:01:34,438 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:01:34,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-14 14:01:34,438 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-14 14:01:34,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:01:34,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1816465685, now seen corresponding path program 1 times [2023-02-14 14:01:34,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 14:01:34,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704577953] [2023-02-14 14:01:34,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:01:34,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 14:01:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:01:34,449 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:01:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:01:34,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 14:01:34,476 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-14 14:01:34,477 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2023-02-14 14:01:34,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2023-02-14 14:01:34,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-14 14:01:34,480 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:01:34,482 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-14 14:01:34,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 02:01:34 BoogieIcfgContainer [2023-02-14 14:01:34,535 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-14 14:01:34,535 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-14 14:01:34,536 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-14 14:01:34,536 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-14 14:01:34,536 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:01:33" (3/4) ... [2023-02-14 14:01:34,539 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-14 14:01:34,540 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-14 14:01:34,541 INFO L158 Benchmark]: Toolchain (without parser) took 1329.16ms. Allocated memory was 155.2MB in the beginning and 274.7MB in the end (delta: 119.5MB). Free memory was 109.2MB in the beginning and 190.8MB in the end (delta: -81.6MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. [2023-02-14 14:01:34,542 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 155.2MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 14:01:34,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 155.26ms. Allocated memory is still 155.2MB. Free memory was 109.2MB in the beginning and 97.5MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-14 14:01:34,547 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.41ms. Allocated memory is still 155.2MB. Free memory was 97.5MB in the beginning and 96.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 14:01:34,547 INFO L158 Benchmark]: Boogie Preprocessor took 16.42ms. Allocated memory is still 155.2MB. Free memory was 96.1MB in the beginning and 94.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 14:01:34,550 INFO L158 Benchmark]: RCFGBuilder took 310.16ms. Allocated memory is still 155.2MB. Free memory was 94.6MB in the beginning and 77.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-14 14:01:34,550 INFO L158 Benchmark]: TraceAbstraction took 816.19ms. Allocated memory was 155.2MB in the beginning and 274.7MB in the end (delta: 119.5MB). Free memory was 77.2MB in the beginning and 190.8MB in the end (delta: -113.7MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2023-02-14 14:01:34,551 INFO L158 Benchmark]: Witness Printer took 4.32ms. Allocated memory is still 274.7MB. Free memory is still 190.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 14:01:34,553 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 155.2MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 155.26ms. Allocated memory is still 155.2MB. Free memory was 109.2MB in the beginning and 97.5MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.41ms. Allocated memory is still 155.2MB. Free memory was 97.5MB in the beginning and 96.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.42ms. Allocated memory is still 155.2MB. Free memory was 96.1MB in the beginning and 94.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 310.16ms. Allocated memory is still 155.2MB. Free memory was 94.6MB in the beginning and 77.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 816.19ms. Allocated memory was 155.2MB in the beginning and 274.7MB in the end (delta: 119.5MB). Free memory was 77.2MB in the beginning and 190.8MB in the end (delta: -113.7MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * Witness Printer took 4.32ms. Allocated memory is still 274.7MB. Free memory is still 190.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 219]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 219. Possible FailurePath: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L51] int cond; VAL [p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L88] COND FALSE !(p1 != 0) VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L92] COND FALSE !(p2 != 0) VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L96] COND FALSE !(p3 != 0) VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L100] COND TRUE p4 != 0 [L101] lk4 = 1 VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L104] COND TRUE p5 != 0 [L105] lk5 = 1 VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L108] COND TRUE p6 != 0 [L109] lk6 = 1 VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L112] COND TRUE p7 != 0 [L113] lk7 = 1 VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L116] COND TRUE p8 != 0 [L117] lk8 = 1 VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L120] COND TRUE p9 != 0 [L121] lk9 = 1 VAL [cond=-1, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L124] COND TRUE p10 != 0 [L125] lk10 = 1 VAL [cond=-1, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L128] COND FALSE !(p11 != 0) VAL [cond=-1, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L132] COND TRUE p12 != 0 [L133] lk12 = 1 VAL [cond=-1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L136] COND TRUE p13 != 0 [L137] lk13 = 1 VAL [cond=-1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L140] COND TRUE p14 != 0 [L141] lk14 = 1 VAL [cond=-1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L146] COND FALSE !(p1 != 0) VAL [cond=-1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L151] COND FALSE !(p2 != 0) VAL [cond=-1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L219] reach_error() VAL [cond=-1, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=1, p11=0, p12=1, p13=1, p14=1, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] - UnprovableResult [Line: 6]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 53 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 364 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 364 mSDsluCounter, 906 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 282 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 624 mSDtfsCounter, 22 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=6, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 36 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 239 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-02-14 14:01:34,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/locks/test_locks_14-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c --- Real Ultimate output --- This is Ultimate 0.2.2-?-3dbbec3 [2023-02-14 14:01:36,409 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 14:01:36,411 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 14:01:36,443 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 14:01:36,447 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 14:01:36,450 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 14:01:36,453 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 14:01:36,457 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 14:01:36,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 14:01:36,459 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 14:01:36,460 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 14:01:36,460 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 14:01:36,461 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 14:01:36,461 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 14:01:36,462 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 14:01:36,463 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 14:01:36,463 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 14:01:36,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 14:01:36,482 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 14:01:36,483 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 14:01:36,484 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 14:01:36,485 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 14:01:36,486 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 14:01:36,487 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 14:01:36,489 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 14:01:36,489 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 14:01:36,489 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 14:01:36,493 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 14:01:36,494 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 14:01:36,494 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 14:01:36,495 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 14:01:36,495 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 14:01:36,496 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 14:01:36,497 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 14:01:36,498 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 14:01:36,499 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 14:01:36,500 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 14:01:36,500 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 14:01:36,501 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 14:01:36,501 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 14:01:36,502 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 14:01:36,502 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-14 14:01:36,528 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 14:01:36,528 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 14:01:36,529 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 14:01:36,529 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 14:01:36,530 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 14:01:36,530 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 14:01:36,531 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 14:01:36,531 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 14:01:36,531 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 14:01:36,531 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 14:01:36,532 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 14:01:36,532 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 14:01:36,532 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 14:01:36,533 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 14:01:36,533 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 14:01:36,533 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 14:01:36,533 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 14:01:36,533 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 14:01:36,533 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 14:01:36,533 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 14:01:36,534 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-14 14:01:36,534 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-14 14:01:36,534 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 14:01:36,534 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 14:01:36,534 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 14:01:36,535 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 14:01:36,535 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 14:01:36,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 14:01:36,535 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 14:01:36,535 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 14:01:36,535 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-14 14:01:36,535 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-14 14:01:36,536 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 14:01:36,536 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 14:01:36,536 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 14:01:36,536 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-14 14:01:36,536 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 14:01:36,537 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c [2023-02-14 14:01:36,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 14:01:36,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 14:01:36,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 14:01:36,817 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 14:01:36,817 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 14:01:36,818 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_14-2.c [2023-02-14 14:01:37,873 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 14:01:38,054 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 14:01:38,055 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-2.c [2023-02-14 14:01:38,060 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fa56a0bf/00f4f707a8724405b7613fbced825eae/FLAG8104aaa11 [2023-02-14 14:01:38,074 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fa56a0bf/00f4f707a8724405b7613fbced825eae [2023-02-14 14:01:38,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 14:01:38,077 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 14:01:38,078 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 14:01:38,078 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 14:01:38,081 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 14:01:38,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 02:01:38" (1/1) ... [2023-02-14 14:01:38,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e555c95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:01:38, skipping insertion in model container [2023-02-14 14:01:38,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 02:01:38" (1/1) ... [2023-02-14 14:01:38,086 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 14:01:38,111 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 14:01:38,226 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-2.c[5305,5318] [2023-02-14 14:01:38,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 14:01:38,244 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 14:01:38,278 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-2.c[5305,5318] [2023-02-14 14:01:38,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 14:01:38,294 INFO L208 MainTranslator]: Completed translation [2023-02-14 14:01:38,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:01:38 WrapperNode [2023-02-14 14:01:38,295 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 14:01:38,296 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 14:01:38,296 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 14:01:38,296 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 14:01:38,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:01:38" (1/1) ... [2023-02-14 14:01:38,326 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:01:38" (1/1) ... [2023-02-14 14:01:38,346 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 169 [2023-02-14 14:01:38,347 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 14:01:38,348 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 14:01:38,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 14:01:38,349 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 14:01:38,355 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:01:38" (1/1) ... [2023-02-14 14:01:38,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:01:38" (1/1) ... [2023-02-14 14:01:38,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:01:38" (1/1) ... [2023-02-14 14:01:38,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:01:38" (1/1) ... [2023-02-14 14:01:38,376 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:01:38" (1/1) ... [2023-02-14 14:01:38,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:01:38" (1/1) ... [2023-02-14 14:01:38,384 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:01:38" (1/1) ... [2023-02-14 14:01:38,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:01:38" (1/1) ... [2023-02-14 14:01:38,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 14:01:38,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 14:01:38,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 14:01:38,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 14:01:38,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:01:38" (1/1) ... [2023-02-14 14:01:38,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 14:01:38,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 14:01:38,426 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-14 14:01:38,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-14 14:01:38,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 14:01:38,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 14:01:38,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 14:01:38,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-14 14:01:38,543 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 14:01:38,546 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 14:01:38,807 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 14:01:38,812 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 14:01:38,812 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-14 14:01:38,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:01:38 BoogieIcfgContainer [2023-02-14 14:01:38,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 14:01:38,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 14:01:38,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 14:01:38,817 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 14:01:38,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 02:01:38" (1/3) ... [2023-02-14 14:01:38,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e517480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 02:01:38, skipping insertion in model container [2023-02-14 14:01:38,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:01:38" (2/3) ... [2023-02-14 14:01:38,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e517480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 02:01:38, skipping insertion in model container [2023-02-14 14:01:38,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:01:38" (3/3) ... [2023-02-14 14:01:38,834 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_14-2.c [2023-02-14 14:01:38,846 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 14:01:38,851 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-02-14 14:01:38,891 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 14:01:38,897 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@48d549ad, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 14:01:38,899 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-02-14 14:01:38,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 50 states have (on average 1.94) internal successors, (97), 52 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:38,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-14 14:01:38,908 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 14:01:38,908 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-14 14:01:38,909 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-14 14:01:38,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:01:38,914 INFO L85 PathProgramCache]: Analyzing trace with hash 28943010, now seen corresponding path program 1 times [2023-02-14 14:01:38,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 14:01:38,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113600227] [2023-02-14 14:01:38,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:01:38,923 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 14:01:38,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 14:01:38,939 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 14:01:38,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-14 14:01:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:01:38,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-14 14:01:39,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:01:39,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:01:39,011 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 14:01:39,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 14:01:39,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113600227] [2023-02-14 14:01:39,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113600227] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:01:39,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:01:39,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 14:01:39,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349397643] [2023-02-14 14:01:39,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:01:39,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-14 14:01:39,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 14:01:39,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-14 14:01:39,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 14:01:39,036 INFO L87 Difference]: Start difference. First operand has 53 states, 50 states have (on average 1.94) internal successors, (97), 52 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:39,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:01:39,053 INFO L93 Difference]: Finished difference Result 53 states and 94 transitions. [2023-02-14 14:01:39,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-14 14:01:39,061 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-14 14:01:39,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 14:01:39,066 INFO L225 Difference]: With dead ends: 53 [2023-02-14 14:01:39,066 INFO L226 Difference]: Without dead ends: 51 [2023-02-14 14:01:39,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 14:01:39,070 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 14:01:39,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 14:01:39,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-14 14:01:39,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-02-14 14:01:39,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:39,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 92 transitions. [2023-02-14 14:01:39,090 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 92 transitions. Word has length 5 [2023-02-14 14:01:39,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 14:01:39,091 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 92 transitions. [2023-02-14 14:01:39,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:39,091 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 92 transitions. [2023-02-14 14:01:39,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 14:01:39,091 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 14:01:39,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 14:01:39,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-14 14:01:39,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 14:01:39,299 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-14 14:01:39,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:01:39,299 INFO L85 PathProgramCache]: Analyzing trace with hash 889700139, now seen corresponding path program 1 times [2023-02-14 14:01:39,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 14:01:39,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [110600225] [2023-02-14 14:01:39,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:01:39,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 14:01:39,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 14:01:39,302 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 14:01:39,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-14 14:01:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:01:39,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 14:01:39,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:01:39,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:01:39,381 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 14:01:39,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 14:01:39,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [110600225] [2023-02-14 14:01:39,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [110600225] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:01:39,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:01:39,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 14:01:39,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021869555] [2023-02-14 14:01:39,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:01:39,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 14:01:39,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 14:01:39,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 14:01:39,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 14:01:39,384 INFO L87 Difference]: Start difference. First operand 51 states and 92 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:39,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:01:39,396 INFO L93 Difference]: Finished difference Result 50 states and 91 transitions. [2023-02-14 14:01:39,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 14:01:39,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-14 14:01:39,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 14:01:39,398 INFO L225 Difference]: With dead ends: 50 [2023-02-14 14:01:39,398 INFO L226 Difference]: Without dead ends: 48 [2023-02-14 14:01:39,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 14:01:39,399 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 86 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 14:01:39,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 91 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 14:01:39,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-02-14 14:01:39,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-02-14 14:01:39,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 47 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:39,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 89 transitions. [2023-02-14 14:01:39,405 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 89 transitions. Word has length 6 [2023-02-14 14:01:39,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 14:01:39,405 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 89 transitions. [2023-02-14 14:01:39,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:39,406 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 89 transitions. [2023-02-14 14:01:39,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 14:01:39,406 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 14:01:39,407 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:01:39,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-14 14:01:39,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 14:01:39,613 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-14 14:01:39,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:01:39,616 INFO L85 PathProgramCache]: Analyzing trace with hash 792943379, now seen corresponding path program 1 times [2023-02-14 14:01:39,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 14:01:39,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [529109763] [2023-02-14 14:01:39,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:01:39,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 14:01:39,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 14:01:39,618 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 14:01:39,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-14 14:01:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:01:39,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 14:01:39,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:01:39,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:01:39,704 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 14:01:39,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 14:01:39,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [529109763] [2023-02-14 14:01:39,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [529109763] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:01:39,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:01:39,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 14:01:39,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204675007] [2023-02-14 14:01:39,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:01:39,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 14:01:39,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 14:01:39,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 14:01:39,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 14:01:39,706 INFO L87 Difference]: Start difference. First operand 48 states and 89 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:39,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:01:39,730 INFO L93 Difference]: Finished difference Result 93 states and 173 transitions. [2023-02-14 14:01:39,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 14:01:39,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-14 14:01:39,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 14:01:39,732 INFO L225 Difference]: With dead ends: 93 [2023-02-14 14:01:39,733 INFO L226 Difference]: Without dead ends: 93 [2023-02-14 14:01:39,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 14:01:39,735 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 68 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 14:01:39,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 174 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 14:01:39,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-14 14:01:39,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 63. [2023-02-14 14:01:39,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:39,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 118 transitions. [2023-02-14 14:01:39,746 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 118 transitions. Word has length 21 [2023-02-14 14:01:39,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 14:01:39,746 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 118 transitions. [2023-02-14 14:01:39,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:39,747 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 118 transitions. [2023-02-14 14:01:39,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 14:01:39,747 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 14:01:39,747 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:01:39,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-14 14:01:39,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 14:01:39,954 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-14 14:01:39,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:01:39,963 INFO L85 PathProgramCache]: Analyzing trace with hash 792950571, now seen corresponding path program 1 times [2023-02-14 14:01:39,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 14:01:39,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895387859] [2023-02-14 14:01:39,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:01:39,964 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 14:01:39,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 14:01:39,967 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 14:01:39,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-14 14:01:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:01:40,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 14:01:40,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:01:40,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:01:40,045 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 14:01:40,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 14:01:40,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895387859] [2023-02-14 14:01:40,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [895387859] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:01:40,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:01:40,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 14:01:40,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559517765] [2023-02-14 14:01:40,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:01:40,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 14:01:40,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 14:01:40,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 14:01:40,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 14:01:40,048 INFO L87 Difference]: Start difference. First operand 63 states and 118 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:40,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:01:40,071 INFO L93 Difference]: Finished difference Result 94 states and 173 transitions. [2023-02-14 14:01:40,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 14:01:40,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-14 14:01:40,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 14:01:40,072 INFO L225 Difference]: With dead ends: 94 [2023-02-14 14:01:40,072 INFO L226 Difference]: Without dead ends: 94 [2023-02-14 14:01:40,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 14:01:40,075 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 71 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 14:01:40,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 224 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 14:01:40,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-14 14:01:40,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2023-02-14 14:01:40,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.89010989010989) internal successors, (172), 91 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:40,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 172 transitions. [2023-02-14 14:01:40,087 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 172 transitions. Word has length 21 [2023-02-14 14:01:40,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 14:01:40,087 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 172 transitions. [2023-02-14 14:01:40,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:40,088 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 172 transitions. [2023-02-14 14:01:40,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 14:01:40,088 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 14:01:40,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:01:40,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-14 14:01:40,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 14:01:40,295 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-14 14:01:40,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:01:40,295 INFO L85 PathProgramCache]: Analyzing trace with hash -795404523, now seen corresponding path program 1 times [2023-02-14 14:01:40,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 14:01:40,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1217119939] [2023-02-14 14:01:40,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:01:40,297 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 14:01:40,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 14:01:40,302 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 14:01:40,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-14 14:01:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:01:40,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 14:01:40,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:01:40,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:01:40,367 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 14:01:40,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 14:01:40,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1217119939] [2023-02-14 14:01:40,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1217119939] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:01:40,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:01:40,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 14:01:40,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537913444] [2023-02-14 14:01:40,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:01:40,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 14:01:40,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 14:01:40,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 14:01:40,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 14:01:40,370 INFO L87 Difference]: Start difference. First operand 92 states and 172 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:40,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:01:40,380 INFO L93 Difference]: Finished difference Result 96 states and 173 transitions. [2023-02-14 14:01:40,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 14:01:40,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-14 14:01:40,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 14:01:40,381 INFO L225 Difference]: With dead ends: 96 [2023-02-14 14:01:40,382 INFO L226 Difference]: Without dead ends: 96 [2023-02-14 14:01:40,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 14:01:40,383 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 69 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 14:01:40,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 198 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 14:01:40,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-14 14:01:40,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2023-02-14 14:01:40,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:40,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 172 transitions. [2023-02-14 14:01:40,389 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 172 transitions. Word has length 21 [2023-02-14 14:01:40,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 14:01:40,389 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 172 transitions. [2023-02-14 14:01:40,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:40,389 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 172 transitions. [2023-02-14 14:01:40,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 14:01:40,390 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 14:01:40,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:01:40,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-14 14:01:40,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 14:01:40,597 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-14 14:01:40,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:01:40,598 INFO L85 PathProgramCache]: Analyzing trace with hash -795397331, now seen corresponding path program 1 times [2023-02-14 14:01:40,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 14:01:40,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567459488] [2023-02-14 14:01:40,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:01:40,598 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 14:01:40,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 14:01:40,599 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 14:01:40,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-14 14:01:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 14:01:40,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 14:01:40,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 14:01:40,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 14:01:40,663 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 14:01:40,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 14:01:40,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567459488] [2023-02-14 14:01:40,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567459488] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 14:01:40,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 14:01:40,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 14:01:40,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127491757] [2023-02-14 14:01:40,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 14:01:40,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 14:01:40,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 14:01:40,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 14:01:40,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 14:01:40,670 INFO L87 Difference]: Start difference. First operand 94 states and 172 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:40,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 14:01:40,682 INFO L93 Difference]: Finished difference Result 127 states and 228 transitions. [2023-02-14 14:01:40,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 14:01:40,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-14 14:01:40,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 14:01:40,684 INFO L225 Difference]: With dead ends: 127 [2023-02-14 14:01:40,684 INFO L226 Difference]: Without dead ends: 127 [2023-02-14 14:01:40,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 14:01:40,687 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 70 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 14:01:40,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 125 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 14:01:40,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-14 14:01:40,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2023-02-14 14:01:40,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.8306451612903225) internal successors, (227), 124 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:40,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 227 transitions. [2023-02-14 14:01:40,699 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 227 transitions. Word has length 21 [2023-02-14 14:01:40,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 14:01:40,701 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 227 transitions. [2023-02-14 14:01:40,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 14:01:40,701 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 227 transitions. [2023-02-14 14:01:40,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 14:01:40,701 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 14:01:40,702 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:01:40,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-14 14:01:40,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 14:01:40,913 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2023-02-14 14:01:40,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 14:01:40,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1816465685, now seen corresponding path program 1 times [2023-02-14 14:01:40,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 14:01:40,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [825517248] [2023-02-14 14:01:40,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 14:01:40,914 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 14:01:40,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 14:01:40,916 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 14:01:40,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-14 14:01:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:01:40,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 14:01:40,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 14:01:40,973 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-14 14:01:40,973 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-14 14:01:40,974 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2023-02-14 14:01:40,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2023-02-14 14:01:40,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-14 14:01:41,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 14:01:41,184 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-02-14 14:01:41,191 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-14 14:01:41,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 02:01:41 BoogieIcfgContainer [2023-02-14 14:01:41,223 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-14 14:01:41,223 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-14 14:01:41,224 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-14 14:01:41,224 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-14 14:01:41,224 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:01:38" (3/4) ... [2023-02-14 14:01:41,226 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-14 14:01:41,226 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-14 14:01:41,226 INFO L158 Benchmark]: Toolchain (without parser) took 3148.97ms. Allocated memory is still 83.9MB. Free memory was 61.6MB in the beginning and 59.6MB in the end (delta: 2.0MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2023-02-14 14:01:41,227 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 65.0MB. Free memory was 42.2MB in the beginning and 42.2MB in the end (delta: 41.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 14:01:41,227 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.92ms. Allocated memory is still 83.9MB. Free memory was 61.4MB in the beginning and 49.5MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-14 14:01:41,227 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.40ms. Allocated memory is still 83.9MB. Free memory was 49.5MB in the beginning and 47.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 14:01:41,227 INFO L158 Benchmark]: Boogie Preprocessor took 39.65ms. Allocated memory is still 83.9MB. Free memory was 47.8MB in the beginning and 46.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 14:01:41,228 INFO L158 Benchmark]: RCFGBuilder took 425.55ms. Allocated memory is still 83.9MB. Free memory was 46.2MB in the beginning and 50.5MB in the end (delta: -4.3MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2023-02-14 14:01:41,228 INFO L158 Benchmark]: TraceAbstraction took 2408.13ms. Allocated memory is still 83.9MB. Free memory was 49.8MB in the beginning and 59.6MB in the end (delta: -9.8MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2023-02-14 14:01:41,228 INFO L158 Benchmark]: Witness Printer took 2.54ms. Allocated memory is still 83.9MB. Free memory is still 59.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 14:01:41,230 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.52ms. Allocated memory is still 65.0MB. Free memory was 42.2MB in the beginning and 42.2MB in the end (delta: 41.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.92ms. Allocated memory is still 83.9MB. Free memory was 61.4MB in the beginning and 49.5MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.40ms. Allocated memory is still 83.9MB. Free memory was 49.5MB in the beginning and 47.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.65ms. Allocated memory is still 83.9MB. Free memory was 47.8MB in the beginning and 46.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 425.55ms. Allocated memory is still 83.9MB. Free memory was 46.2MB in the beginning and 50.5MB in the end (delta: -4.3MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * TraceAbstraction took 2408.13ms. Allocated memory is still 83.9MB. Free memory was 49.8MB in the beginning and 59.6MB in the end (delta: -9.8MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * Witness Printer took 2.54ms. Allocated memory is still 83.9MB. Free memory is still 59.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 219]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 219. Possible FailurePath: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L51] int cond; [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0] [L88] COND FALSE !(p1 != 0) VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0] [L92] COND FALSE !(p2 != 0) VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0] [L96] COND FALSE !(p3 != 0) VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0] [L100] COND TRUE p4 != 0 [L101] lk4 = 1 VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0, p4=2] [L104] COND TRUE p5 != 0 [L105] lk5 = 1 VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0, p4=2, p5=2] [L108] COND TRUE p6 != 0 [L109] lk6 = 1 VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2] [L112] COND TRUE p7 != 0 [L113] lk7 = 1 VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=0, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2] [L116] COND TRUE p8 != 0 [L117] lk8 = 1 VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2] [L120] COND TRUE p9 != 0 [L121] lk9 = 1 VAL [cond=-2147483648, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L124] COND TRUE p10 != 0 [L125] lk10 = 1 VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L128] COND FALSE !(p11 != 0) VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L132] COND TRUE p12 != 0 [L133] lk12 = 1 VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=0, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p12=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L136] COND TRUE p13 != 0 [L137] lk13 = 1 VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p12=2, p13=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L140] COND TRUE p14 != 0 [L141] lk14 = 1 VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p12=2, p13=2, p14=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L146] COND FALSE !(p1 != 0) VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p12=2, p13=2, p14=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L151] COND FALSE !(p2 != 0) VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p12=2, p13=2, p14=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L219] reach_error() VAL [cond=-2147483648, lk1=0, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p10=2, p11=0, p12=2, p13=2, p14=2, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] - UnprovableResult [Line: 6]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 53 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 364 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 364 mSDsluCounter, 906 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 282 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 624 mSDtfsCounter, 22 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=6, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 36 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 239 SizeOfPredicates, 0 NumberOfNonLiveVariables, 275 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-02-14 14:01:41,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample