./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --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 af189c8870b49f611aa022222cf968f0c789441d4d4f9926444b1aa8c8dc68d1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:02:04,319 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:02:04,422 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-31 22:02:04,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:02:04,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:02:04,474 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:02:04,477 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:02:04,477 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:02:04,478 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:02:04,480 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:02:04,480 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:02:04,481 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:02:04,482 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:02:04,483 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:02:04,485 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:02:04,485 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:02:04,486 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:02:04,486 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:02:04,486 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:02:04,487 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:02:04,487 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-31 22:02:04,491 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-31 22:02:04,492 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-31 22:02:04,492 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:02:04,492 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:02:04,492 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:02:04,493 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:02:04,493 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:02:04,493 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:02:04,493 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:02:04,494 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:02:04,494 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:02:04,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:02:04,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:02:04,497 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:02:04,497 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:02:04,498 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:02:04,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:02:04,498 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:02:04,498 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:02:04,499 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:02:04,499 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:02:04,499 INFO L153 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> af189c8870b49f611aa022222cf968f0c789441d4d4f9926444b1aa8c8dc68d1 [2024-10-31 22:02:04,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:02:04,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:02:04,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:02:04,847 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:02:04,848 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:02:04,849 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i Unable to find full path for "g++" [2024-10-31 22:02:07,055 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:02:07,329 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:02:07,329 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2024-10-31 22:02:07,353 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/data/42821c800/a1a4f2c03d4140c19b0451f1851626d2/FLAG55853c307 [2024-10-31 22:02:07,371 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/data/42821c800/a1a4f2c03d4140c19b0451f1851626d2 [2024-10-31 22:02:07,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:02:07,376 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:02:07,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:02:07,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:02:07,387 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:02:07,388 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:02:07" (1/1) ... [2024-10-31 22:02:07,389 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f5507a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:07, skipping insertion in model container [2024-10-31 22:02:07,389 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:02:07" (1/1) ... [2024-10-31 22:02:07,470 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:02:07,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:02:07,985 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:02:08,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:02:08,093 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:02:08,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:08 WrapperNode [2024-10-31 22:02:08,094 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:02:08,095 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:02:08,096 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:02:08,096 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:02:08,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:08" (1/1) ... [2024-10-31 22:02:08,119 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:08" (1/1) ... [2024-10-31 22:02:08,149 INFO L138 Inliner]: procedures = 174, calls = 36, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 109 [2024-10-31 22:02:08,149 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:02:08,150 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:02:08,150 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:02:08,151 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:02:08,164 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:08" (1/1) ... [2024-10-31 22:02:08,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:08" (1/1) ... [2024-10-31 22:02:08,167 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:08" (1/1) ... [2024-10-31 22:02:08,196 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 22:02:08,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:08" (1/1) ... [2024-10-31 22:02:08,199 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:08" (1/1) ... [2024-10-31 22:02:08,206 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:08" (1/1) ... [2024-10-31 22:02:08,208 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:08" (1/1) ... [2024-10-31 22:02:08,209 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:08" (1/1) ... [2024-10-31 22:02:08,211 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:08" (1/1) ... [2024-10-31 22:02:08,213 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:02:08,214 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:02:08,215 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:02:08,215 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:02:08,216 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:08" (1/1) ... [2024-10-31 22:02:08,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:02:08,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:02:08,307 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:02:08,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:02:08,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-31 22:02:08,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:02:08,374 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-31 22:02:08,374 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-31 22:02:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-31 22:02:08,376 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-31 22:02:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:02:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-31 22:02:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:02:08,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:02:08,378 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 22:02:08,589 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:02:08,592 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:02:09,094 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 22:02:09,094 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:02:09,397 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:02:09,398 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-31 22:02:09,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:02:09 BoogieIcfgContainer [2024-10-31 22:02:09,401 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:02:09,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:02:09,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:02:09,413 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:02:09,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:02:07" (1/3) ... [2024-10-31 22:02:09,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264e1b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:02:09, skipping insertion in model container [2024-10-31 22:02:09,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:08" (2/3) ... [2024-10-31 22:02:09,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264e1b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:02:09, skipping insertion in model container [2024-10-31 22:02:09,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:02:09" (3/3) ... [2024-10-31 22:02:09,420 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2024-10-31 22:02:09,463 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:02:09,464 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-31 22:02:09,464 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 22:02:09,527 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-31 22:02:09,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 36 transitions, 80 flow [2024-10-31 22:02:09,604 INFO L124 PetriNetUnfolderBase]: 2/34 cut-off events. [2024-10-31 22:02:09,604 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:02:09,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 34 events. 2/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2024-10-31 22:02:09,608 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 36 transitions, 80 flow [2024-10-31 22:02:09,612 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 34 transitions, 74 flow [2024-10-31 22:02:09,622 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:02:09,630 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@113ea137, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:02:09,630 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-31 22:02:09,635 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:02:09,635 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-10-31 22:02:09,635 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:02:09,636 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:02:09,637 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-31 22:02:09,637 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-31 22:02:09,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:09,643 INFO L85 PathProgramCache]: Analyzing trace with hash 10791732, now seen corresponding path program 1 times [2024-10-31 22:02:09,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:09,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685094541] [2024-10-31 22:02:09,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:09,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:10,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:10,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:10,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685094541] [2024-10-31 22:02:10,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685094541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:10,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:10,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 22:02:10,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521483414] [2024-10-31 22:02:10,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:10,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:02:10,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:10,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:02:10,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:02:10,523 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 36 [2024-10-31 22:02:10,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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) [2024-10-31 22:02:10,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:02:10,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 36 [2024-10-31 22:02:10,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:02:10,942 INFO L124 PetriNetUnfolderBase]: 183/391 cut-off events. [2024-10-31 22:02:10,942 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-31 22:02:10,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 391 events. 183/391 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1937 event pairs, 69 based on Foata normal form. 32/418 useless extension candidates. Maximal degree in co-relation 715. Up to 265 conditions per place. [2024-10-31 22:02:10,951 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 25 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2024-10-31 22:02:10,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 151 flow [2024-10-31 22:02:10,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:02:10,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:02:10,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-10-31 22:02:10,967 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7314814814814815 [2024-10-31 22:02:10,969 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 74 flow. Second operand 3 states and 79 transitions. [2024-10-31 22:02:10,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 151 flow [2024-10-31 22:02:10,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:02:10,976 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 66 flow [2024-10-31 22:02:10,979 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2024-10-31 22:02:10,983 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2024-10-31 22:02:10,984 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 66 flow [2024-10-31 22:02:10,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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) [2024-10-31 22:02:10,985 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:02:10,986 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:10,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:02:10,986 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-31 22:02:10,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:10,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1859235142, now seen corresponding path program 1 times [2024-10-31 22:02:10,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:10,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456351396] [2024-10-31 22:02:10,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:10,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:11,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:11,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:11,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456351396] [2024-10-31 22:02:11,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456351396] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:11,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:11,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 22:02:11,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834840257] [2024-10-31 22:02:11,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:11,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:02:11,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:11,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:02:11,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:02:11,067 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 36 [2024-10-31 22:02:11,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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) [2024-10-31 22:02:11,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:02:11,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 36 [2024-10-31 22:02:11,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:02:11,224 INFO L124 PetriNetUnfolderBase]: 159/375 cut-off events. [2024-10-31 22:02:11,224 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-10-31 22:02:11,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 375 events. 159/375 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1986 event pairs, 159 based on Foata normal form. 16/376 useless extension candidates. Maximal degree in co-relation 689. Up to 280 conditions per place. [2024-10-31 22:02:11,230 INFO L140 encePairwiseOnDemand]: 34/36 looper letters, 14 selfloop transitions, 1 changer transitions 1/28 dead transitions. [2024-10-31 22:02:11,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 28 transitions, 96 flow [2024-10-31 22:02:11,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:02:11,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:02:11,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2024-10-31 22:02:11,233 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5462962962962963 [2024-10-31 22:02:11,234 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 66 flow. Second operand 3 states and 59 transitions. [2024-10-31 22:02:11,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 28 transitions, 96 flow [2024-10-31 22:02:11,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 28 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:02:11,236 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 60 flow [2024-10-31 22:02:11,237 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2024-10-31 22:02:11,238 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, -4 predicate places. [2024-10-31 22:02:11,238 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 60 flow [2024-10-31 22:02:11,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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) [2024-10-31 22:02:11,239 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:02:11,239 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:11,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:02:11,240 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-31 22:02:11,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:11,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1859236513, now seen corresponding path program 1 times [2024-10-31 22:02:11,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:11,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954792306] [2024-10-31 22:02:11,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:11,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:11,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:11,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:11,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954792306] [2024-10-31 22:02:11,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954792306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:11,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:11,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:02:11,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130419872] [2024-10-31 22:02:11,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:11,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:02:11,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:11,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:02:11,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:02:11,620 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-10-31 22:02:11,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 60 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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) [2024-10-31 22:02:11,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:02:11,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-10-31 22:02:11,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:02:12,182 INFO L124 PetriNetUnfolderBase]: 385/752 cut-off events. [2024-10-31 22:02:12,183 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:02:12,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1431 conditions, 752 events. 385/752 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4090 event pairs, 130 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 1425. Up to 415 conditions per place. [2024-10-31 22:02:12,191 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 23 selfloop transitions, 3 changer transitions 36/70 dead transitions. [2024-10-31 22:02:12,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 70 transitions, 272 flow [2024-10-31 22:02:12,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:02:12,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-31 22:02:12,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-10-31 22:02:12,195 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-10-31 22:02:12,195 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 60 flow. Second operand 8 states and 152 transitions. [2024-10-31 22:02:12,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 70 transitions, 272 flow [2024-10-31 22:02:12,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 70 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:02:12,200 INFO L231 Difference]: Finished difference. Result has 45 places, 28 transitions, 92 flow [2024-10-31 22:02:12,202 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=92, PETRI_PLACES=45, PETRI_TRANSITIONS=28} [2024-10-31 22:02:12,203 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 6 predicate places. [2024-10-31 22:02:12,203 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 92 flow [2024-10-31 22:02:12,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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) [2024-10-31 22:02:12,205 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:02:12,205 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:12,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:02:12,206 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-31 22:02:12,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:12,207 INFO L85 PathProgramCache]: Analyzing trace with hash 254540367, now seen corresponding path program 1 times [2024-10-31 22:02:12,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:12,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251842763] [2024-10-31 22:02:12,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:12,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:12,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:12,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:12,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251842763] [2024-10-31 22:02:12,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251842763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:12,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:12,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:02:12,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999105935] [2024-10-31 22:02:12,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:12,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:02:12,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:12,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:02:12,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:02:12,521 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-10-31 22:02:12,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 28 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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) [2024-10-31 22:02:12,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:02:12,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-10-31 22:02:12,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:02:12,886 INFO L124 PetriNetUnfolderBase]: 252/525 cut-off events. [2024-10-31 22:02:12,887 INFO L125 PetriNetUnfolderBase]: For 249/249 co-relation queries the response was YES. [2024-10-31 22:02:12,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1229 conditions, 525 events. 252/525 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2657 event pairs, 60 based on Foata normal form. 15/532 useless extension candidates. Maximal degree in co-relation 1217. Up to 330 conditions per place. [2024-10-31 22:02:12,891 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 21 selfloop transitions, 3 changer transitions 19/53 dead transitions. [2024-10-31 22:02:12,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 53 transitions, 250 flow [2024-10-31 22:02:12,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:02:12,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-31 22:02:12,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-10-31 22:02:12,895 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-10-31 22:02:12,895 INFO L175 Difference]: Start difference. First operand has 45 places, 28 transitions, 92 flow. Second operand 7 states and 128 transitions. [2024-10-31 22:02:12,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 53 transitions, 250 flow [2024-10-31 22:02:12,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 53 transitions, 233 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-10-31 22:02:12,901 INFO L231 Difference]: Finished difference. Result has 47 places, 28 transitions, 102 flow [2024-10-31 22:02:12,902 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=102, PETRI_PLACES=47, PETRI_TRANSITIONS=28} [2024-10-31 22:02:12,905 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 8 predicate places. [2024-10-31 22:02:12,905 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 28 transitions, 102 flow [2024-10-31 22:02:12,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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) [2024-10-31 22:02:12,905 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:02:12,906 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:12,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:02:12,907 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-31 22:02:12,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:12,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1390791704, now seen corresponding path program 1 times [2024-10-31 22:02:12,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:12,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454309192] [2024-10-31 22:02:12,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:12,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:13,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:13,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:13,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454309192] [2024-10-31 22:02:13,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454309192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:13,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:13,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:02:13,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424225] [2024-10-31 22:02:13,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:13,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:02:13,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:13,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:02:13,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:02:13,098 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-10-31 22:02:13,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 28 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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) [2024-10-31 22:02:13,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:02:13,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-10-31 22:02:13,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:02:13,317 INFO L124 PetriNetUnfolderBase]: 216/470 cut-off events. [2024-10-31 22:02:13,317 INFO L125 PetriNetUnfolderBase]: For 209/211 co-relation queries the response was YES. [2024-10-31 22:02:13,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1073 conditions, 470 events. 216/470 cut-off events. For 209/211 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2167 event pairs, 42 based on Foata normal form. 29/487 useless extension candidates. Maximal degree in co-relation 1057. Up to 206 conditions per place. [2024-10-31 22:02:13,322 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 32 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2024-10-31 22:02:13,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 46 transitions, 212 flow [2024-10-31 22:02:13,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:02:13,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 22:02:13,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2024-10-31 22:02:13,324 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5972222222222222 [2024-10-31 22:02:13,324 INFO L175 Difference]: Start difference. First operand has 47 places, 28 transitions, 102 flow. Second operand 4 states and 86 transitions. [2024-10-31 22:02:13,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 46 transitions, 212 flow [2024-10-31 22:02:13,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 46 transitions, 196 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-10-31 22:02:13,329 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 116 flow [2024-10-31 22:02:13,329 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2024-10-31 22:02:13,330 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2024-10-31 22:02:13,330 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 116 flow [2024-10-31 22:02:13,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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) [2024-10-31 22:02:13,331 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:02:13,331 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:13,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:02:13,332 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-31 22:02:13,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:13,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1477578464, now seen corresponding path program 1 times [2024-10-31 22:02:13,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:13,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019757382] [2024-10-31 22:02:13,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:13,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:13,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:13,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:13,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019757382] [2024-10-31 22:02:13,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019757382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:13,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:13,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:02:13,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314802136] [2024-10-31 22:02:13,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:13,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:02:13,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:13,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:02:13,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:02:13,744 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-10-31 22:02:13,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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) [2024-10-31 22:02:13,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:02:13,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-10-31 22:02:13,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:02:13,931 INFO L124 PetriNetUnfolderBase]: 134/294 cut-off events. [2024-10-31 22:02:13,931 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2024-10-31 22:02:13,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 732 conditions, 294 events. 134/294 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1125 event pairs, 43 based on Foata normal form. 18/300 useless extension candidates. Maximal degree in co-relation 718. Up to 117 conditions per place. [2024-10-31 22:02:13,933 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 28 selfloop transitions, 6 changer transitions 0/44 dead transitions. [2024-10-31 22:02:13,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 215 flow [2024-10-31 22:02:13,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:02:13,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-31 22:02:13,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2024-10-31 22:02:13,935 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-10-31 22:02:13,935 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 116 flow. Second operand 5 states and 96 transitions. [2024-10-31 22:02:13,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 215 flow [2024-10-31 22:02:13,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 197 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-10-31 22:02:13,938 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 128 flow [2024-10-31 22:02:13,938 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2024-10-31 22:02:13,939 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 5 predicate places. [2024-10-31 22:02:13,939 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 128 flow [2024-10-31 22:02:13,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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) [2024-10-31 22:02:13,940 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:02:13,940 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:13,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:02:13,940 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-31 22:02:13,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:13,941 INFO L85 PathProgramCache]: Analyzing trace with hash -983045099, now seen corresponding path program 1 times [2024-10-31 22:02:13,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:13,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300640980] [2024-10-31 22:02:13,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:13,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:15,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:15,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:15,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300640980] [2024-10-31 22:02:15,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300640980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:15,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:15,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:02:15,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443326951] [2024-10-31 22:02:15,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:15,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:02:15,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:15,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:02:15,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:02:15,040 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2024-10-31 22:02:15,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 128 flow. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 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) [2024-10-31 22:02:15,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:02:15,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2024-10-31 22:02:15,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:02:15,413 INFO L124 PetriNetUnfolderBase]: 152/389 cut-off events. [2024-10-31 22:02:15,413 INFO L125 PetriNetUnfolderBase]: For 345/385 co-relation queries the response was YES. [2024-10-31 22:02:15,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 983 conditions, 389 events. 152/389 cut-off events. For 345/385 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2007 event pairs, 60 based on Foata normal form. 10/364 useless extension candidates. Maximal degree in co-relation 969. Up to 132 conditions per place. [2024-10-31 22:02:15,416 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 23 selfloop transitions, 6 changer transitions 17/62 dead transitions. [2024-10-31 22:02:15,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 62 transitions, 300 flow [2024-10-31 22:02:15,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:02:15,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-31 22:02:15,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-10-31 22:02:15,417 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5243055555555556 [2024-10-31 22:02:15,418 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 128 flow. Second operand 8 states and 151 transitions. [2024-10-31 22:02:15,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 62 transitions, 300 flow [2024-10-31 22:02:15,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 62 transitions, 291 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-10-31 22:02:15,421 INFO L231 Difference]: Finished difference. Result has 54 places, 37 transitions, 164 flow [2024-10-31 22:02:15,421 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=164, PETRI_PLACES=54, PETRI_TRANSITIONS=37} [2024-10-31 22:02:15,421 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 15 predicate places. [2024-10-31 22:02:15,422 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 37 transitions, 164 flow [2024-10-31 22:02:15,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 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) [2024-10-31 22:02:15,422 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:02:15,422 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:15,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:02:15,422 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-31 22:02:15,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:15,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1376126269, now seen corresponding path program 2 times [2024-10-31 22:02:15,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:15,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239015961] [2024-10-31 22:02:15,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:15,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:02:15,510 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:02:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:02:15,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:02:15,651 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:02:15,653 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-10-31 22:02:15,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-10-31 22:02:15,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-10-31 22:02:15,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-10-31 22:02:15,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-10-31 22:02:15,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-10-31 22:02:15,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:02:15,659 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:15,750 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-31 22:02:15,750 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:02:15,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:02:15 BasicIcfg [2024-10-31 22:02:15,757 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:02:15,757 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:02:15,757 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:02:15,758 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:02:15,761 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:02:09" (3/4) ... [2024-10-31 22:02:15,765 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:02:15,767 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:02:15,769 INFO L158 Benchmark]: Toolchain (without parser) took 8391.70ms. Allocated memory was 169.9MB in the beginning and 270.5MB in the end (delta: 100.7MB). Free memory was 126.8MB in the beginning and 119.2MB in the end (delta: 7.6MB). Peak memory consumption was 111.3MB. Max. memory is 16.1GB. [2024-10-31 22:02:15,770 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 123.7MB. Free memory is still 68.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:02:15,770 INFO L158 Benchmark]: CACSL2BoogieTranslator took 716.44ms. Allocated memory is still 169.9MB. Free memory was 126.8MB in the beginning and 101.0MB in the end (delta: 25.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-31 22:02:15,771 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.34ms. Allocated memory is still 169.9MB. Free memory was 101.0MB in the beginning and 98.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:02:15,771 INFO L158 Benchmark]: Boogie Preprocessor took 63.49ms. Allocated memory is still 169.9MB. Free memory was 98.5MB in the beginning and 95.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:02:15,774 INFO L158 Benchmark]: RCFGBuilder took 1187.11ms. Allocated memory is still 169.9MB. Free memory was 95.4MB in the beginning and 92.7MB in the end (delta: 2.7MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2024-10-31 22:02:15,774 INFO L158 Benchmark]: TraceAbstraction took 6352.01ms. Allocated memory was 169.9MB in the beginning and 270.5MB in the end (delta: 100.7MB). Free memory was 91.7MB in the beginning and 120.2MB in the end (delta: -28.5MB). Peak memory consumption was 76.2MB. Max. memory is 16.1GB. [2024-10-31 22:02:15,774 INFO L158 Benchmark]: Witness Printer took 9.91ms. Allocated memory is still 270.5MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:02:15,776 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 123.7MB. Free memory is still 68.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 716.44ms. Allocated memory is still 169.9MB. Free memory was 126.8MB in the beginning and 101.0MB in the end (delta: 25.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.34ms. Allocated memory is still 169.9MB. Free memory was 101.0MB in the beginning and 98.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.49ms. Allocated memory is still 169.9MB. Free memory was 98.5MB in the beginning and 95.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1187.11ms. Allocated memory is still 169.9MB. Free memory was 95.4MB in the beginning and 92.7MB in the end (delta: 2.7MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6352.01ms. Allocated memory was 169.9MB in the beginning and 270.5MB in the end (delta: 100.7MB). Free memory was 91.7MB in the beginning and 120.2MB in the end (delta: -28.5MB). Peak memory consumption was 76.2MB. Max. memory is 16.1GB. * Witness Printer took 9.91ms. Allocated memory is still 270.5MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L721] 0 _Bool y$flush_delayed; [L722] 0 int y$mem_tmp; [L723] 0 _Bool y$r_buff0_thd0; [L724] 0 _Bool y$r_buff0_thd1; [L725] 0 _Bool y$r_buff0_thd2; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$read_delayed; [L730] 0 int *y$read_delayed_var; [L731] 0 int y$w_buff0; [L732] 0 _Bool y$w_buff0_used; [L733] 0 int y$w_buff1; [L734] 0 _Bool y$w_buff1_used; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L812] 0 pthread_t t305; [L813] FCALL, FORK 0 pthread_create(&t305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t305=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L814] 0 pthread_t t306; [L815] FCALL, FORK 0 pthread_create(&t306, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t305=-2, t306=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L740] 1 y$w_buff1 = y$w_buff0 [L741] 1 y$w_buff0 = 1 [L742] 1 y$w_buff1_used = y$w_buff0_used [L743] 1 y$w_buff0_used = (_Bool)1 [L744] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L744] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L745] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L746] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L747] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L751] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L768] 2 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L771] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y [L778] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EBX = y [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305=-2, t306=-1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305=-2, t306=-1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L828] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305=-2, t306=-1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L830] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L17] 0 __assert_fail ("0", "mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 810]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 815]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 53 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 175 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 156 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 554 IncrementalHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 17 mSDtfsCounter, 554 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=7, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 446 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 [2024-10-31 22:02:15,817 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --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 af189c8870b49f611aa022222cf968f0c789441d4d4f9926444b1aa8c8dc68d1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:02:18,843 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:02:18,989 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-31 22:02:18,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:02:19,000 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:02:19,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:02:19,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:02:19,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:02:19,049 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:02:19,051 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:02:19,052 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:02:19,053 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:02:19,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:02:19,054 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:02:19,055 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:02:19,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:02:19,060 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:02:19,061 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:02:19,061 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:02:19,061 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:02:19,062 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-31 22:02:19,064 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-31 22:02:19,064 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-31 22:02:19,065 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:02:19,065 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:02:19,065 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 22:02:19,066 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:02:19,066 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 22:02:19,066 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:02:19,067 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:02:19,067 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:02:19,068 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:02:19,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:02:19,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:02:19,069 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:02:19,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:02:19,069 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:02:19,070 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:02:19,070 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 22:02:19,070 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 22:02:19,070 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:02:19,073 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:02:19,073 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:02:19,073 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:02:19,074 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 22:02:19,074 INFO L153 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> af189c8870b49f611aa022222cf968f0c789441d4d4f9926444b1aa8c8dc68d1 [2024-10-31 22:02:19,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:02:19,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:02:19,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:02:19,547 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:02:19,549 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:02:19,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i Unable to find full path for "g++" [2024-10-31 22:02:21,903 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:02:22,262 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:02:22,263 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2024-10-31 22:02:22,283 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/data/30663353c/608abbbabaa442ba946fa00eb304c3db/FLAGd50f8293e [2024-10-31 22:02:22,307 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/data/30663353c/608abbbabaa442ba946fa00eb304c3db [2024-10-31 22:02:22,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:02:22,315 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:02:22,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:02:22,318 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:02:22,326 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:02:22,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:02:22" (1/1) ... [2024-10-31 22:02:22,329 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32d750d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:22, skipping insertion in model container [2024-10-31 22:02:22,329 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:02:22" (1/1) ... [2024-10-31 22:02:22,413 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:02:23,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:02:23,038 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:02:23,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:02:23,183 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:02:23,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:23 WrapperNode [2024-10-31 22:02:23,184 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:02:23,185 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:02:23,185 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:02:23,185 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:02:23,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:23" (1/1) ... [2024-10-31 22:02:23,210 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:23" (1/1) ... [2024-10-31 22:02:23,239 INFO L138 Inliner]: procedures = 175, calls = 36, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 110 [2024-10-31 22:02:23,240 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:02:23,241 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:02:23,241 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:02:23,241 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:02:23,252 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:23" (1/1) ... [2024-10-31 22:02:23,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:23" (1/1) ... [2024-10-31 22:02:23,258 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:23" (1/1) ... [2024-10-31 22:02:23,289 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 22:02:23,293 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:23" (1/1) ... [2024-10-31 22:02:23,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:23" (1/1) ... [2024-10-31 22:02:23,300 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:23" (1/1) ... [2024-10-31 22:02:23,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:23" (1/1) ... [2024-10-31 22:02:23,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:23" (1/1) ... [2024-10-31 22:02:23,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:23" (1/1) ... [2024-10-31 22:02:23,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:02:23,323 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:02:23,323 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:02:23,323 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:02:23,324 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:23" (1/1) ... [2024-10-31 22:02:23,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:02:23,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:02:23,359 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:02:23,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:02:23,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-31 22:02:23,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:02:23,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-31 22:02:23,394 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-31 22:02:23,394 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-31 22:02:23,394 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-31 22:02:23,394 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-31 22:02:23,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-31 22:02:23,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:02:23,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:02:23,396 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 22:02:23,551 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:02:23,553 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:02:23,908 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 22:02:23,908 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:02:24,167 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:02:24,168 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-31 22:02:24,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:02:24 BoogieIcfgContainer [2024-10-31 22:02:24,169 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:02:24,171 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:02:24,171 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:02:24,174 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:02:24,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:02:22" (1/3) ... [2024-10-31 22:02:24,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0836b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:02:24, skipping insertion in model container [2024-10-31 22:02:24,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:23" (2/3) ... [2024-10-31 22:02:24,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0836b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:02:24, skipping insertion in model container [2024-10-31 22:02:24,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:02:24" (3/3) ... [2024-10-31 22:02:24,180 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2024-10-31 22:02:24,201 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:02:24,201 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-31 22:02:24,201 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 22:02:24,288 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-31 22:02:24,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 36 transitions, 80 flow [2024-10-31 22:02:24,380 INFO L124 PetriNetUnfolderBase]: 2/34 cut-off events. [2024-10-31 22:02:24,383 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:02:24,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 34 events. 2/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2024-10-31 22:02:24,388 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 36 transitions, 80 flow [2024-10-31 22:02:24,394 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 34 transitions, 74 flow [2024-10-31 22:02:24,411 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:02:24,421 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@7a3acd26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:02:24,422 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-31 22:02:24,430 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:02:24,430 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-10-31 22:02:24,431 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:02:24,435 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:02:24,436 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-31 22:02:24,439 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-31 22:02:24,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:24,447 INFO L85 PathProgramCache]: Analyzing trace with hash 10851378, now seen corresponding path program 1 times [2024-10-31 22:02:24,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:02:24,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1470884317] [2024-10-31 22:02:24,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:24,467 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 [2024-10-31 22:02:24,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:02:24,471 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/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) [2024-10-31 22:02:24,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/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 [2024-10-31 22:02:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:24,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-31 22:02:24,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:02:24,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:24,694 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:02:24,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:02:24,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1470884317] [2024-10-31 22:02:24,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1470884317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:24,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:24,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 22:02:24,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627889894] [2024-10-31 22:02:24,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:24,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:02:24,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:02:24,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:02:24,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:02:24,809 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 36 [2024-10-31 22:02:24,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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) [2024-10-31 22:02:24,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:02:24,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 36 [2024-10-31 22:02:24,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:02:25,198 INFO L124 PetriNetUnfolderBase]: 183/391 cut-off events. [2024-10-31 22:02:25,199 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-31 22:02:25,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 391 events. 183/391 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1940 event pairs, 69 based on Foata normal form. 32/418 useless extension candidates. Maximal degree in co-relation 715. Up to 265 conditions per place. [2024-10-31 22:02:25,206 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 25 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2024-10-31 22:02:25,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 151 flow [2024-10-31 22:02:25,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:02:25,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:02:25,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-10-31 22:02:25,222 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7314814814814815 [2024-10-31 22:02:25,225 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 74 flow. Second operand 3 states and 79 transitions. [2024-10-31 22:02:25,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 151 flow [2024-10-31 22:02:25,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:02:25,233 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 66 flow [2024-10-31 22:02:25,235 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2024-10-31 22:02:25,240 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2024-10-31 22:02:25,241 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 66 flow [2024-10-31 22:02:25,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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) [2024-10-31 22:02:25,243 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:02:25,243 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:25,249 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/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)] Forceful destruction successful, exit code 0 [2024-10-31 22:02:25,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/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 [2024-10-31 22:02:25,445 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-31 22:02:25,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:25,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1402641592, now seen corresponding path program 1 times [2024-10-31 22:02:25,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:02:25,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561590152] [2024-10-31 22:02:25,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:25,453 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 [2024-10-31 22:02:25,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:02:25,459 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/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) [2024-10-31 22:02:25,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/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 [2024-10-31 22:02:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:25,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-31 22:02:25,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:02:25,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:25,712 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:02:25,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:02:25,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561590152] [2024-10-31 22:02:25,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561590152] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:25,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:25,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:02:25,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129424513] [2024-10-31 22:02:25,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:25,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:02:25,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:02:25,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:02:25,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:02:25,725 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-10-31 22:02:25,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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) [2024-10-31 22:02:25,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:02:25,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-10-31 22:02:25,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:02:25,967 INFO L124 PetriNetUnfolderBase]: 220/493 cut-off events. [2024-10-31 22:02:25,967 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-10-31 22:02:25,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 493 events. 220/493 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2460 event pairs, 38 based on Foata normal form. 25/508 useless extension candidates. Maximal degree in co-relation 930. Up to 229 conditions per place. [2024-10-31 22:02:25,973 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 32 selfloop transitions, 4 changer transitions 1/47 dead transitions. [2024-10-31 22:02:25,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 182 flow [2024-10-31 22:02:25,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:02:25,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 22:02:25,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2024-10-31 22:02:25,976 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2024-10-31 22:02:25,976 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 66 flow. Second operand 4 states and 87 transitions. [2024-10-31 22:02:25,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 182 flow [2024-10-31 22:02:25,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:02:25,979 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 88 flow [2024-10-31 22:02:25,979 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=88, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2024-10-31 22:02:25,980 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 0 predicate places. [2024-10-31 22:02:25,980 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 88 flow [2024-10-31 22:02:25,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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) [2024-10-31 22:02:25,981 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:02:25,983 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:25,987 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/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 [2024-10-31 22:02:26,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/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 [2024-10-31 22:02:26,184 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-31 22:02:26,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:26,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1760388117, now seen corresponding path program 1 times [2024-10-31 22:02:26,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:02:26,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1658329511] [2024-10-31 22:02:26,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:26,186 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 [2024-10-31 22:02:26,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:02:26,188 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/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) [2024-10-31 22:02:26,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/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 [2024-10-31 22:02:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:26,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-31 22:02:26,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:02:26,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:26,355 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:02:26,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:02:26,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1658329511] [2024-10-31 22:02:26,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1658329511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:26,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:26,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:02:26,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330337697] [2024-10-31 22:02:26,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:26,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:02:26,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:02:26,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:02:26,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:02:26,374 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-10-31 22:02:26,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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) [2024-10-31 22:02:26,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:02:26,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-10-31 22:02:26,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:02:26,613 INFO L124 PetriNetUnfolderBase]: 106/238 cut-off events. [2024-10-31 22:02:26,613 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-10-31 22:02:26,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 238 events. 106/238 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 822 event pairs, 26 based on Foata normal form. 16/247 useless extension candidates. Maximal degree in co-relation 531. Up to 86 conditions per place. [2024-10-31 22:02:26,616 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 27 selfloop transitions, 6 changer transitions 1/44 dead transitions. [2024-10-31 22:02:26,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 44 transitions, 187 flow [2024-10-31 22:02:26,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:02:26,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-31 22:02:26,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2024-10-31 22:02:26,618 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-10-31 22:02:26,618 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 88 flow. Second operand 5 states and 96 transitions. [2024-10-31 22:02:26,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 44 transitions, 187 flow [2024-10-31 22:02:26,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 44 transitions, 178 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-31 22:02:26,621 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 104 flow [2024-10-31 22:02:26,622 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=104, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2024-10-31 22:02:26,623 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2024-10-31 22:02:26,623 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 104 flow [2024-10-31 22:02:26,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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) [2024-10-31 22:02:26,624 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:02:26,624 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:26,630 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/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)] Ended with exit code 0 [2024-10-31 22:02:26,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/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 [2024-10-31 22:02:26,825 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-31 22:02:26,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:26,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1190767814, now seen corresponding path program 1 times [2024-10-31 22:02:26,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:02:26,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248460144] [2024-10-31 22:02:26,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:26,827 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 [2024-10-31 22:02:26,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:02:26,831 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/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) [2024-10-31 22:02:26,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/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 [2024-10-31 22:02:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:26,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-31 22:02:26,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:02:27,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:27,056 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:02:27,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:02:27,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248460144] [2024-10-31 22:02:27,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1248460144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:27,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:27,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 22:02:27,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065868147] [2024-10-31 22:02:27,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:27,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:02:27,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:02:27,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:02:27,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:02:27,065 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 36 [2024-10-31 22:02:27,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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) [2024-10-31 22:02:27,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:02:27,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 36 [2024-10-31 22:02:27,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:02:27,151 INFO L124 PetriNetUnfolderBase]: 62/168 cut-off events. [2024-10-31 22:02:27,152 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-10-31 22:02:27,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 168 events. 62/168 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 568 event pairs, 60 based on Foata normal form. 4/163 useless extension candidates. Maximal degree in co-relation 350. Up to 123 conditions per place. [2024-10-31 22:02:27,154 INFO L140 encePairwiseOnDemand]: 34/36 looper letters, 14 selfloop transitions, 1 changer transitions 1/30 dead transitions. [2024-10-31 22:02:27,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 134 flow [2024-10-31 22:02:27,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:02:27,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:02:27,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2024-10-31 22:02:27,156 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5462962962962963 [2024-10-31 22:02:27,156 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 104 flow. Second operand 3 states and 59 transitions. [2024-10-31 22:02:27,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 134 flow [2024-10-31 22:02:27,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 30 transitions, 106 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-10-31 22:02:27,160 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 74 flow [2024-10-31 22:02:27,160 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2024-10-31 22:02:27,163 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2024-10-31 22:02:27,163 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 74 flow [2024-10-31 22:02:27,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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) [2024-10-31 22:02:27,163 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:02:27,164 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:27,168 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/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)] Ended with exit code 0 [2024-10-31 22:02:27,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/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 [2024-10-31 22:02:27,367 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-31 22:02:27,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:27,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1971633409, now seen corresponding path program 1 times [2024-10-31 22:02:27,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:02:27,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569496973] [2024-10-31 22:02:27,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:27,369 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 [2024-10-31 22:02:27,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:02:27,372 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/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) [2024-10-31 22:02:27,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/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 [2024-10-31 22:02:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:27,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-31 22:02:27,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:02:27,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:27,814 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:02:27,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:02:27,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569496973] [2024-10-31 22:02:27,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1569496973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:27,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:27,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:02:27,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695171823] [2024-10-31 22:02:27,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:27,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:02:27,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:02:27,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:02:27,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:02:27,830 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 36 [2024-10-31 22:02:27,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 74 flow. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 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) [2024-10-31 22:02:27,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:02:27,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 36 [2024-10-31 22:02:27,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:02:28,207 INFO L124 PetriNetUnfolderBase]: 91/231 cut-off events. [2024-10-31 22:02:28,209 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:02:28,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 231 events. 91/231 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 857 event pairs, 17 based on Foata normal form. 4/226 useless extension candidates. Maximal degree in co-relation 443. Up to 51 conditions per place. [2024-10-31 22:02:28,211 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 22 selfloop transitions, 4 changer transitions 17/56 dead transitions. [2024-10-31 22:02:28,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 218 flow [2024-10-31 22:02:28,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 22:02:28,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-31 22:02:28,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-10-31 22:02:28,216 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5246913580246914 [2024-10-31 22:02:28,217 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 74 flow. Second operand 9 states and 170 transitions. [2024-10-31 22:02:28,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 218 flow [2024-10-31 22:02:28,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 56 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:02:28,221 INFO L231 Difference]: Finished difference. Result has 48 places, 29 transitions, 91 flow [2024-10-31 22:02:28,222 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=91, PETRI_PLACES=48, PETRI_TRANSITIONS=29} [2024-10-31 22:02:28,223 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2024-10-31 22:02:28,225 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 29 transitions, 91 flow [2024-10-31 22:02:28,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 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) [2024-10-31 22:02:28,225 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:02:28,226 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:28,232 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/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 [2024-10-31 22:02:28,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/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 [2024-10-31 22:02:28,427 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-10-31 22:02:28,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:28,428 INFO L85 PathProgramCache]: Analyzing trace with hash 306412161, now seen corresponding path program 2 times [2024-10-31 22:02:28,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:02:28,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229582263] [2024-10-31 22:02:28,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-31 22:02:28,434 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 [2024-10-31 22:02:28,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:02:28,437 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/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) [2024-10-31 22:02:28,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/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 [2024-10-31 22:02:28,561 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-31 22:02:28,561 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-31 22:02:28,561 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:02:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:02:28,698 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-31 22:02:28,698 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:02:28,700 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-10-31 22:02:28,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-10-31 22:02:28,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-10-31 22:02:28,703 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-10-31 22:02:28,703 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-10-31 22:02:28,703 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-10-31 22:02:28,709 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/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)] Ended with exit code 0 [2024-10-31 22:02:28,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/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 [2024-10-31 22:02:28,911 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2024-10-31 22:02:29,008 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-31 22:02:29,008 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:02:29,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:02:29 BasicIcfg [2024-10-31 22:02:29,019 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:02:29,020 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:02:29,020 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:02:29,021 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:02:29,021 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:02:24" (3/4) ... [2024-10-31 22:02:29,023 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:02:29,024 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:02:29,026 INFO L158 Benchmark]: Toolchain (without parser) took 6713.83ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 65.8MB in the beginning and 71.6MB in the end (delta: -5.7MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. [2024-10-31 22:02:29,027 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 67.1MB. Free memory is still 43.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:02:29,028 INFO L158 Benchmark]: CACSL2BoogieTranslator took 866.57ms. Allocated memory is still 90.2MB. Free memory was 65.6MB in the beginning and 60.3MB in the end (delta: 5.3MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2024-10-31 22:02:29,029 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.21ms. Allocated memory is still 90.2MB. Free memory was 60.3MB in the beginning and 58.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:02:29,030 INFO L158 Benchmark]: Boogie Preprocessor took 81.52ms. Allocated memory is still 90.2MB. Free memory was 58.0MB in the beginning and 54.7MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 22:02:29,030 INFO L158 Benchmark]: RCFGBuilder took 846.06ms. Allocated memory is still 90.2MB. Free memory was 54.7MB in the beginning and 44.5MB in the end (delta: 10.3MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2024-10-31 22:02:29,031 INFO L158 Benchmark]: TraceAbstraction took 4848.97ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 43.5MB in the beginning and 71.6MB in the end (delta: -28.1MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2024-10-31 22:02:29,031 INFO L158 Benchmark]: Witness Printer took 4.66ms. Allocated memory is still 132.1MB. Free memory is still 71.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:02:29,034 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39ms. Allocated memory is still 67.1MB. Free memory is still 43.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 866.57ms. Allocated memory is still 90.2MB. Free memory was 65.6MB in the beginning and 60.3MB in the end (delta: 5.3MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.21ms. Allocated memory is still 90.2MB. Free memory was 60.3MB in the beginning and 58.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.52ms. Allocated memory is still 90.2MB. Free memory was 58.0MB in the beginning and 54.7MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 846.06ms. Allocated memory is still 90.2MB. Free memory was 54.7MB in the beginning and 44.5MB in the end (delta: 10.3MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4848.97ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 43.5MB in the beginning and 71.6MB in the end (delta: -28.1MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * Witness Printer took 4.66ms. Allocated memory is still 132.1MB. Free memory is still 71.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L721] 0 _Bool y$flush_delayed; [L722] 0 int y$mem_tmp; [L723] 0 _Bool y$r_buff0_thd0; [L724] 0 _Bool y$r_buff0_thd1; [L725] 0 _Bool y$r_buff0_thd2; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$read_delayed; [L730] 0 int *y$read_delayed_var; [L731] 0 int y$w_buff0; [L732] 0 _Bool y$w_buff0_used; [L733] 0 int y$w_buff1; [L734] 0 _Bool y$w_buff1_used; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L812] 0 pthread_t t305; [L813] FCALL, FORK 0 pthread_create(&t305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t305=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L814] 0 pthread_t t306; [L815] FCALL, FORK 0 pthread_create(&t306, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t305=0, t306=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L740] 1 y$w_buff1 = y$w_buff0 [L741] 1 y$w_buff0 = 1 [L742] 1 y$w_buff1_used = y$w_buff0_used [L743] 1 y$w_buff0_used = (_Bool)1 [L744] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L744] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L745] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L746] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L747] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L751] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L768] 2 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L771] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y [L778] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EBX = y [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305=0, t306=1, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305=0, t306=1, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L828] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305=0, t306=1, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L830] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L17] 0 __assert_fail ("0", "mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 810]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 815]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 53 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.6s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 119 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 108 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 383 IncrementalHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 4 mSDtfsCounter, 383 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=3, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 302 SizeOfPredicates, 5 NumberOfNonLiveVariables, 425 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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 [2024-10-31 22:02:29,112 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fb9ffcf-fb53-4dc9-8962-1fc1c6c9d120/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample