./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd --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 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:43:04,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:43:04,273 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 14:43:04,278 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:43:04,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:43:04,310 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:43:04,311 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:43:04,311 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:43:04,311 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:43:04,312 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:43:04,313 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:43:04,313 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:43:04,314 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:43:04,314 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:43:04,315 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:43:04,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:43:04,315 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:43:04,315 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:43:04,315 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:43:04,315 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:43:04,315 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 14:43:04,315 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 14:43:04,315 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 14:43:04,316 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:43:04,316 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:43:04,316 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:43:04,316 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 14:43:04,316 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:43:04,316 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:43:04,316 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:43:04,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:43:04,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:43:04,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:43:04,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:43:04,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:43:04,317 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:43:04,317 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:43:04,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:43:04,317 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:43:04,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:43:04,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:43:04,318 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:43:04,318 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd 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 -> 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 [2024-11-13 14:43:04,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:43:04,623 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:43:04,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:43:04,627 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:43:04,628 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:43:04,630 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i Unable to find full path for "g++" [2024-11-13 14:43:06,556 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:43:06,838 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:43:06,839 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-11-13 14:43:06,853 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/data/8ba6ecc29/ecad0d2e7cca4340817773ae5ee942b9/FLAGda335dac9 [2024-11-13 14:43:06,869 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/data/8ba6ecc29/ecad0d2e7cca4340817773ae5ee942b9 [2024-11-13 14:43:06,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:43:06,872 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:43:06,874 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:43:06,874 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:43:06,878 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:43:06,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:43:06" (1/1) ... [2024-11-13 14:43:06,880 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@238a1e5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:06, skipping insertion in model container [2024-11-13 14:43:06,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:43:06" (1/1) ... [2024-11-13 14:43:06,922 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:43:07,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:43:07,289 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:43:07,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:43:07,435 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:43:07,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:07 WrapperNode [2024-11-13 14:43:07,436 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:43:07,438 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:43:07,438 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:43:07,438 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:43:07,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:07" (1/1) ... [2024-11-13 14:43:07,467 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:07" (1/1) ... [2024-11-13 14:43:07,507 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 128 [2024-11-13 14:43:07,512 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:43:07,512 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:43:07,512 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:43:07,512 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:43:07,526 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:07" (1/1) ... [2024-11-13 14:43:07,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:07" (1/1) ... [2024-11-13 14:43:07,531 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:07" (1/1) ... [2024-11-13 14:43:07,556 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-11-13 14:43:07,557 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:07" (1/1) ... [2024-11-13 14:43:07,557 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:07" (1/1) ... [2024-11-13 14:43:07,571 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:07" (1/1) ... [2024-11-13 14:43:07,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:07" (1/1) ... [2024-11-13 14:43:07,578 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:07" (1/1) ... [2024-11-13 14:43:07,579 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:07" (1/1) ... [2024-11-13 14:43:07,586 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:43:07,590 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:43:07,590 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:43:07,590 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:43:07,591 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:07" (1/1) ... [2024-11-13 14:43:07,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:43:07,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:43:07,633 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:43:07,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:43:07,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 14:43:07,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:43:07,669 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-13 14:43:07,670 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-13 14:43:07,670 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-13 14:43:07,670 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-13 14:43:07,670 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-13 14:43:07,670 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-13 14:43:07,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:43:07,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 14:43:07,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:43:07,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:43:07,672 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 14:43:07,861 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:43:07,863 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:43:08,277 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 14:43:08,277 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:43:08,562 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:43:08,562 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 14:43:08,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:43:08 BoogieIcfgContainer [2024-11-13 14:43:08,563 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:43:08,565 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:43:08,565 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:43:08,570 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:43:08,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:43:06" (1/3) ... [2024-11-13 14:43:08,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76235176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:43:08, skipping insertion in model container [2024-11-13 14:43:08,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:07" (2/3) ... [2024-11-13 14:43:08,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76235176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:43:08, skipping insertion in model container [2024-11-13 14:43:08,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:43:08" (3/3) ... [2024-11-13 14:43:08,573 INFO L112 eAbstractionObserver]: Analyzing ICFG mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-11-13 14:43:08,589 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:43:08,593 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i that has 4 procedures, 46 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-13 14:43:08,593 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 14:43:08,673 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 14:43:08,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 106 flow [2024-11-13 14:43:08,754 INFO L124 PetriNetUnfolderBase]: 2/44 cut-off events. [2024-11-13 14:43:08,758 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:43:08,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 2/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2024-11-13 14:43:08,764 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 47 transitions, 106 flow [2024-11-13 14:43:08,768 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 44 transitions, 97 flow [2024-11-13 14:43:08,776 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:43:08,789 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;@385c6ece, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:43:08,789 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-13 14:43:08,797 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 14:43:08,798 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-13 14:43:08,798 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:43:08,798 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:43:08,798 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-13 14:43:08,799 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:43:08,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:08,808 INFO L85 PathProgramCache]: Analyzing trace with hash 12370397, now seen corresponding path program 1 times [2024-11-13 14:43:08,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:43:08,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581182030] [2024-11-13 14:43:08,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:08,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:43:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:09,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:43:09,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:43:09,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581182030] [2024-11-13 14:43:09,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581182030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:43:09,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:43:09,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 14:43:09,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054137378] [2024-11-13 14:43:09,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:43:09,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:43:09,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:43:09,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:43:09,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:43:09,452 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-11-13 14:43:09,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-11-13 14:43:09,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:43:09,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-11-13 14:43:09,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:43:10,230 INFO L124 PetriNetUnfolderBase]: 825/1738 cut-off events. [2024-11-13 14:43:10,230 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-13 14:43:10,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3019 conditions, 1738 events. 825/1738 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12413 event pairs, 129 based on Foata normal form. 96/1816 useless extension candidates. Maximal degree in co-relation 3008. Up to 1009 conditions per place. [2024-11-13 14:43:10,256 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 33 selfloop transitions, 2 changer transitions 2/56 dead transitions. [2024-11-13 14:43:10,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 56 transitions, 201 flow [2024-11-13 14:43:10,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:43:10,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:43:10,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-11-13 14:43:10,273 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7659574468085106 [2024-11-13 14:43:10,275 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 97 flow. Second operand 3 states and 108 transitions. [2024-11-13 14:43:10,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 56 transitions, 201 flow [2024-11-13 14:43:10,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 56 transitions, 196 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-13 14:43:10,287 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 88 flow [2024-11-13 14:43:10,290 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-11-13 14:43:10,295 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2024-11-13 14:43:10,296 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 88 flow [2024-11-13 14:43:10,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-11-13 14:43:10,297 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:43:10,297 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:43:10,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:43:10,298 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:43:10,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:10,299 INFO L85 PathProgramCache]: Analyzing trace with hash -796805383, now seen corresponding path program 1 times [2024-11-13 14:43:10,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:43:10,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195688514] [2024-11-13 14:43:10,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:10,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:43:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:10,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:43:10,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:43:10,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195688514] [2024-11-13 14:43:10,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195688514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:43:10,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:43:10,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 14:43:10,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263063474] [2024-11-13 14:43:10,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:43:10,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:43:10,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:43:10,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:43:10,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:43:10,423 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-11-13 14:43:10,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-11-13 14:43:10,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:43:10,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-11-13 14:43:10,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:43:10,765 INFO L124 PetriNetUnfolderBase]: 721/1387 cut-off events. [2024-11-13 14:43:10,766 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2024-11-13 14:43:10,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2607 conditions, 1387 events. 721/1387 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9149 event pairs, 721 based on Foata normal form. 48/1378 useless extension candidates. Maximal degree in co-relation 2597. Up to 1090 conditions per place. [2024-11-13 14:43:10,777 INFO L140 encePairwiseOnDemand]: 45/47 looper letters, 18 selfloop transitions, 1 changer transitions 1/38 dead transitions. [2024-11-13 14:43:10,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 126 flow [2024-11-13 14:43:10,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:43:10,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:43:10,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-11-13 14:43:10,781 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2024-11-13 14:43:10,781 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 88 flow. Second operand 3 states and 84 transitions. [2024-11-13 14:43:10,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 126 flow [2024-11-13 14:43:10,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 38 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:43:10,784 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 82 flow [2024-11-13 14:43:10,786 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-11-13 14:43:10,787 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2024-11-13 14:43:10,787 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 82 flow [2024-11-13 14:43:10,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-11-13 14:43:10,788 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:43:10,788 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:43:10,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:43:10,788 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:43:10,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:10,789 INFO L85 PathProgramCache]: Analyzing trace with hash -796803957, now seen corresponding path program 1 times [2024-11-13 14:43:10,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:43:10,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784085761] [2024-11-13 14:43:10,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:10,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:43:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:11,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:43:11,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:43:11,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784085761] [2024-11-13 14:43:11,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784085761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:43:11,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:43:11,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:43:11,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468209915] [2024-11-13 14:43:11,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:43:11,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:43:11,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:43:11,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:43:11,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:43:11,260 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-11-13 14:43:11,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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-11-13 14:43:11,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:43:11,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-11-13 14:43:11,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:43:12,081 INFO L124 PetriNetUnfolderBase]: 1879/3205 cut-off events. [2024-11-13 14:43:12,081 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:43:12,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6035 conditions, 3205 events. 1879/3205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 21651 event pairs, 557 based on Foata normal form. 0/3116 useless extension candidates. Maximal degree in co-relation 6029. Up to 1766 conditions per place. [2024-11-13 14:43:12,101 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 29 selfloop transitions, 3 changer transitions 46/92 dead transitions. [2024-11-13 14:43:12,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 92 transitions, 350 flow [2024-11-13 14:43:12,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:43:12,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-13 14:43:12,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 224 transitions. [2024-11-13 14:43:12,107 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2024-11-13 14:43:12,107 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 82 flow. Second operand 8 states and 224 transitions. [2024-11-13 14:43:12,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 92 transitions, 350 flow [2024-11-13 14:43:12,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 92 transitions, 349 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 14:43:12,111 INFO L231 Difference]: Finished difference. Result has 57 places, 38 transitions, 114 flow [2024-11-13 14:43:12,111 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=114, PETRI_PLACES=57, PETRI_TRANSITIONS=38} [2024-11-13 14:43:12,114 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2024-11-13 14:43:12,114 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 38 transitions, 114 flow [2024-11-13 14:43:12,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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-11-13 14:43:12,114 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:43:12,114 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:43:12,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:43:12,115 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:43:12,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:12,116 INFO L85 PathProgramCache]: Analyzing trace with hash 564387754, now seen corresponding path program 1 times [2024-11-13 14:43:12,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:43:12,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461425766] [2024-11-13 14:43:12,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:12,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:43:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:12,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:43:12,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:43:12,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461425766] [2024-11-13 14:43:12,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461425766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:43:12,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:43:12,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:43:12,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876031052] [2024-11-13 14:43:12,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:43:12,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:43:12,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:43:12,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:43:12,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:43:12,427 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2024-11-13 14:43:12,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 38 transitions, 114 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 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-11-13 14:43:12,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:43:12,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2024-11-13 14:43:12,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:43:13,975 INFO L124 PetriNetUnfolderBase]: 3887/6308 cut-off events. [2024-11-13 14:43:13,977 INFO L125 PetriNetUnfolderBase]: For 3063/3063 co-relation queries the response was YES. [2024-11-13 14:43:14,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14618 conditions, 6308 events. 3887/6308 cut-off events. For 3063/3063 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 41910 event pairs, 631 based on Foata normal form. 210/6496 useless extension candidates. Maximal degree in co-relation 14606. Up to 2367 conditions per place. [2024-11-13 14:43:14,022 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 47 selfloop transitions, 6 changer transitions 67/131 dead transitions. [2024-11-13 14:43:14,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 131 transitions, 606 flow [2024-11-13 14:43:14,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 14:43:14,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-13 14:43:14,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 271 transitions. [2024-11-13 14:43:14,025 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5765957446808511 [2024-11-13 14:43:14,025 INFO L175 Difference]: Start difference. First operand has 57 places, 38 transitions, 114 flow. Second operand 10 states and 271 transitions. [2024-11-13 14:43:14,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 131 transitions, 606 flow [2024-11-13 14:43:14,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 131 transitions, 583 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-11-13 14:43:14,103 INFO L231 Difference]: Finished difference. Result has 66 places, 42 transitions, 183 flow [2024-11-13 14:43:14,104 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=183, PETRI_PLACES=66, PETRI_TRANSITIONS=42} [2024-11-13 14:43:14,104 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2024-11-13 14:43:14,104 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 42 transitions, 183 flow [2024-11-13 14:43:14,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 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-11-13 14:43:14,105 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:43:14,105 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:43:14,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 14:43:14,105 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:43:14,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:14,107 INFO L85 PathProgramCache]: Analyzing trace with hash 641308894, now seen corresponding path program 1 times [2024-11-13 14:43:14,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:43:14,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082839867] [2024-11-13 14:43:14,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:14,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:43:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:43:14,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:43:14,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082839867] [2024-11-13 14:43:14,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082839867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:43:14,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:43:14,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:43:14,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996834208] [2024-11-13 14:43:14,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:43:14,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:43:14,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:43:14,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:43:14,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:43:14,390 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-11-13 14:43:14,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 42 transitions, 183 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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-11-13 14:43:14,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:43:14,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-11-13 14:43:14,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:43:15,461 INFO L124 PetriNetUnfolderBase]: 2431/4342 cut-off events. [2024-11-13 14:43:15,462 INFO L125 PetriNetUnfolderBase]: For 8434/8789 co-relation queries the response was YES. [2024-11-13 14:43:15,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12414 conditions, 4342 events. 2431/4342 cut-off events. For 8434/8789 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 31120 event pairs, 743 based on Foata normal form. 169/4361 useless extension candidates. Maximal degree in co-relation 12394. Up to 2117 conditions per place. [2024-11-13 14:43:15,505 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 33 selfloop transitions, 3 changer transitions 37/92 dead transitions. [2024-11-13 14:43:15,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 92 transitions, 525 flow [2024-11-13 14:43:15,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:43:15,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 14:43:15,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 199 transitions. [2024-11-13 14:43:15,508 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6048632218844985 [2024-11-13 14:43:15,508 INFO L175 Difference]: Start difference. First operand has 66 places, 42 transitions, 183 flow. Second operand 7 states and 199 transitions. [2024-11-13 14:43:15,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 92 transitions, 525 flow [2024-11-13 14:43:15,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 92 transitions, 501 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-11-13 14:43:15,551 INFO L231 Difference]: Finished difference. Result has 66 places, 42 transitions, 186 flow [2024-11-13 14:43:15,552 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=186, PETRI_PLACES=66, PETRI_TRANSITIONS=42} [2024-11-13 14:43:15,554 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2024-11-13 14:43:15,555 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 42 transitions, 186 flow [2024-11-13 14:43:15,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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-11-13 14:43:15,555 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:43:15,555 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] [2024-11-13 14:43:15,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 14:43:15,556 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:43:15,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:15,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1432332543, now seen corresponding path program 1 times [2024-11-13 14:43:15,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:43:15,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87044268] [2024-11-13 14:43:15,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:15,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:43:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:15,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:43:15,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:43:15,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87044268] [2024-11-13 14:43:15,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87044268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:43:15,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:43:15,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:43:15,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187508411] [2024-11-13 14:43:15,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:43:15,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:43:15,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:43:15,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:43:15,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:43:15,841 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-11-13 14:43:15,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 42 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-11-13 14:43:15,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:43:15,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-11-13 14:43:15,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:43:16,921 INFO L124 PetriNetUnfolderBase]: 3816/6178 cut-off events. [2024-11-13 14:43:16,921 INFO L125 PetriNetUnfolderBase]: For 6622/6942 co-relation queries the response was YES. [2024-11-13 14:43:16,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15484 conditions, 6178 events. 3816/6178 cut-off events. For 6622/6942 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 39782 event pairs, 732 based on Foata normal form. 277/6198 useless extension candidates. Maximal degree in co-relation 15462. Up to 3206 conditions per place. [2024-11-13 14:43:16,982 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 46 selfloop transitions, 5 changer transitions 0/69 dead transitions. [2024-11-13 14:43:16,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 69 transitions, 366 flow [2024-11-13 14:43:16,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:43:16,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 14:43:16,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2024-11-13 14:43:16,984 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.648936170212766 [2024-11-13 14:43:16,984 INFO L175 Difference]: Start difference. First operand has 66 places, 42 transitions, 186 flow. Second operand 4 states and 122 transitions. [2024-11-13 14:43:16,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 69 transitions, 366 flow [2024-11-13 14:43:17,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 69 transitions, 352 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-11-13 14:43:17,011 INFO L231 Difference]: Finished difference. Result has 61 places, 46 transitions, 210 flow [2024-11-13 14:43:17,012 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=210, PETRI_PLACES=61, PETRI_TRANSITIONS=46} [2024-11-13 14:43:17,014 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2024-11-13 14:43:17,015 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 46 transitions, 210 flow [2024-11-13 14:43:17,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-11-13 14:43:17,016 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:43:17,016 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, 1] [2024-11-13 14:43:17,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 14:43:17,016 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:43:17,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:17,016 INFO L85 PathProgramCache]: Analyzing trace with hash 533856218, now seen corresponding path program 1 times [2024-11-13 14:43:17,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:43:17,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197445389] [2024-11-13 14:43:17,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:17,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:43:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:17,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:43:17,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:43:17,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197445389] [2024-11-13 14:43:17,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197445389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:43:17,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:43:17,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:43:17,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94070777] [2024-11-13 14:43:17,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:43:17,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:43:17,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:43:17,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:43:17,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:43:17,313 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-11-13 14:43:17,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 46 transitions, 210 flow. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 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-11-13 14:43:17,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:43:17,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-11-13 14:43:17,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:43:18,048 INFO L124 PetriNetUnfolderBase]: 2706/4422 cut-off events. [2024-11-13 14:43:18,048 INFO L125 PetriNetUnfolderBase]: For 3866/4082 co-relation queries the response was YES. [2024-11-13 14:43:18,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11874 conditions, 4422 events. 2706/4422 cut-off events. For 3866/4082 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 26811 event pairs, 455 based on Foata normal form. 218/4432 useless extension candidates. Maximal degree in co-relation 11854. Up to 1313 conditions per place. [2024-11-13 14:43:18,074 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 59 selfloop transitions, 8 changer transitions 0/85 dead transitions. [2024-11-13 14:43:18,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 85 transitions, 473 flow [2024-11-13 14:43:18,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:43:18,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 14:43:18,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions. [2024-11-13 14:43:18,075 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6595744680851063 [2024-11-13 14:43:18,075 INFO L175 Difference]: Start difference. First operand has 61 places, 46 transitions, 210 flow. Second operand 5 states and 155 transitions. [2024-11-13 14:43:18,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 85 transitions, 473 flow [2024-11-13 14:43:18,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 85 transitions, 470 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 14:43:18,081 INFO L231 Difference]: Finished difference. Result has 66 places, 50 transitions, 262 flow [2024-11-13 14:43:18,081 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=262, PETRI_PLACES=66, PETRI_TRANSITIONS=50} [2024-11-13 14:43:18,082 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2024-11-13 14:43:18,082 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 50 transitions, 262 flow [2024-11-13 14:43:18,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 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-11-13 14:43:18,082 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:43:18,082 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, 1, 1, 1, 1] [2024-11-13 14:43:18,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 14:43:18,082 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:43:18,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:18,085 INFO L85 PathProgramCache]: Analyzing trace with hash 717608492, now seen corresponding path program 1 times [2024-11-13 14:43:18,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:43:18,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668190264] [2024-11-13 14:43:18,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:18,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:43:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:19,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:43:19,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:43:19,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668190264] [2024-11-13 14:43:19,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668190264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:43:19,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:43:19,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 14:43:19,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360657629] [2024-11-13 14:43:19,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:43:19,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:43:19,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:43:19,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:43:19,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:43:19,068 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-11-13 14:43:19,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 50 transitions, 262 flow. Second operand has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 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-11-13 14:43:19,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:43:19,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-11-13 14:43:19,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:43:20,183 INFO L124 PetriNetUnfolderBase]: 2675/5306 cut-off events. [2024-11-13 14:43:20,184 INFO L125 PetriNetUnfolderBase]: For 6750/8001 co-relation queries the response was YES. [2024-11-13 14:43:20,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14971 conditions, 5306 events. 2675/5306 cut-off events. For 6750/8001 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 42591 event pairs, 940 based on Foata normal form. 122/5004 useless extension candidates. Maximal degree in co-relation 14948. Up to 2187 conditions per place. [2024-11-13 14:43:20,334 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 51 selfloop transitions, 14 changer transitions 17/111 dead transitions. [2024-11-13 14:43:20,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 111 transitions, 652 flow [2024-11-13 14:43:20,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:43:20,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-13 14:43:20,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 240 transitions. [2024-11-13 14:43:20,336 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6382978723404256 [2024-11-13 14:43:20,336 INFO L175 Difference]: Start difference. First operand has 66 places, 50 transitions, 262 flow. Second operand 8 states and 240 transitions. [2024-11-13 14:43:20,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 111 transitions, 652 flow [2024-11-13 14:43:20,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 111 transitions, 640 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-13 14:43:20,345 INFO L231 Difference]: Finished difference. Result has 75 places, 65 transitions, 359 flow [2024-11-13 14:43:20,346 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=359, PETRI_PLACES=75, PETRI_TRANSITIONS=65} [2024-11-13 14:43:20,348 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2024-11-13 14:43:20,348 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 65 transitions, 359 flow [2024-11-13 14:43:20,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 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-11-13 14:43:20,348 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:43:20,348 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, 1, 1, 1, 1] [2024-11-13 14:43:20,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 14:43:20,351 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:43:20,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:20,352 INFO L85 PathProgramCache]: Analyzing trace with hash -851424660, now seen corresponding path program 2 times [2024-11-13 14:43:20,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:43:20,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252910731] [2024-11-13 14:43:20,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:20,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:43:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:20,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:43:20,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:43:20,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252910731] [2024-11-13 14:43:20,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252910731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:43:20,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:43:20,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:43:20,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818071491] [2024-11-13 14:43:20,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:43:20,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:43:20,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:43:20,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:43:20,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:43:20,705 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-11-13 14:43:20,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 359 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 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-11-13 14:43:20,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:43:20,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-11-13 14:43:20,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:43:21,822 INFO L124 PetriNetUnfolderBase]: 3906/6315 cut-off events. [2024-11-13 14:43:21,824 INFO L125 PetriNetUnfolderBase]: For 11507/12164 co-relation queries the response was YES. [2024-11-13 14:43:21,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20519 conditions, 6315 events. 3906/6315 cut-off events. For 11507/12164 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 41469 event pairs, 418 based on Foata normal form. 213/6238 useless extension candidates. Maximal degree in co-relation 20493. Up to 2370 conditions per place. [2024-11-13 14:43:21,867 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 70 selfloop transitions, 11 changer transitions 16/115 dead transitions. [2024-11-13 14:43:21,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 115 transitions, 781 flow [2024-11-13 14:43:21,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:43:21,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 14:43:21,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2024-11-13 14:43:21,868 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6028368794326241 [2024-11-13 14:43:21,868 INFO L175 Difference]: Start difference. First operand has 75 places, 65 transitions, 359 flow. Second operand 6 states and 170 transitions. [2024-11-13 14:43:21,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 115 transitions, 781 flow [2024-11-13 14:43:21,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 115 transitions, 731 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-11-13 14:43:21,883 INFO L231 Difference]: Finished difference. Result has 73 places, 59 transitions, 329 flow [2024-11-13 14:43:21,884 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=329, PETRI_PLACES=73, PETRI_TRANSITIONS=59} [2024-11-13 14:43:21,884 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places. [2024-11-13 14:43:21,884 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 59 transitions, 329 flow [2024-11-13 14:43:21,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 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-11-13 14:43:21,884 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:43:21,885 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:43:21,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 14:43:21,885 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:43:21,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:21,885 INFO L85 PathProgramCache]: Analyzing trace with hash 490316748, now seen corresponding path program 1 times [2024-11-13 14:43:21,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:43:21,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200087328] [2024-11-13 14:43:21,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:21,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:43:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:22,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:43:22,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:43:22,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200087328] [2024-11-13 14:43:22,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200087328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:43:22,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:43:22,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:43:22,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404842365] [2024-11-13 14:43:22,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:43:22,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:43:22,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:43:22,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:43:22,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:43:22,439 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-11-13 14:43:22,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 59 transitions, 329 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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-11-13 14:43:22,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:43:22,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-11-13 14:43:22,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:43:23,416 INFO L124 PetriNetUnfolderBase]: 2450/4793 cut-off events. [2024-11-13 14:43:23,416 INFO L125 PetriNetUnfolderBase]: For 10900/12285 co-relation queries the response was YES. [2024-11-13 14:43:23,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15116 conditions, 4793 events. 2450/4793 cut-off events. For 10900/12285 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 38227 event pairs, 556 based on Foata normal form. 101/4365 useless extension candidates. Maximal degree in co-relation 15093. Up to 1647 conditions per place. [2024-11-13 14:43:23,443 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 32 selfloop transitions, 1 changer transitions 42/101 dead transitions. [2024-11-13 14:43:23,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 101 transitions, 668 flow [2024-11-13 14:43:23,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:43:23,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 14:43:23,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2024-11-13 14:43:23,446 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5709219858156028 [2024-11-13 14:43:23,446 INFO L175 Difference]: Start difference. First operand has 73 places, 59 transitions, 329 flow. Second operand 6 states and 161 transitions. [2024-11-13 14:43:23,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 101 transitions, 668 flow [2024-11-13 14:43:23,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 101 transitions, 606 flow, removed 25 selfloop flow, removed 5 redundant places. [2024-11-13 14:43:23,485 INFO L231 Difference]: Finished difference. Result has 75 places, 54 transitions, 273 flow [2024-11-13 14:43:23,486 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=273, PETRI_PLACES=75, PETRI_TRANSITIONS=54} [2024-11-13 14:43:23,486 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2024-11-13 14:43:23,487 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 54 transitions, 273 flow [2024-11-13 14:43:23,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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-11-13 14:43:23,487 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:43:23,487 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:43:23,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 14:43:23,487 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:43:23,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:23,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1397910484, now seen corresponding path program 2 times [2024-11-13 14:43:23,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:43:23,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137292664] [2024-11-13 14:43:23,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:23,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:43:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:43:23,615 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:43:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:43:23,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:43:23,797 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 14:43:23,798 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-13 14:43:23,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-13 14:43:23,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-13 14:43:23,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-13 14:43:23,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-13 14:43:23,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-13 14:43:23,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-13 14:43:23,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 14:43:23,801 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:43:23,909 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 14:43:23,910 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:43:23,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:43:23 BasicIcfg [2024-11-13 14:43:23,920 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:43:23,921 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:43:23,921 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:43:23,921 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:43:23,922 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:43:08" (3/4) ... [2024-11-13 14:43:23,924 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 14:43:23,925 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:43:23,926 INFO L158 Benchmark]: Toolchain (without parser) took 17053.72ms. Allocated memory was 117.4MB in the beginning and 1.0GB in the end (delta: 931.1MB). Free memory was 91.3MB in the beginning and 818.1MB in the end (delta: -726.8MB). Peak memory consumption was 209.5MB. Max. memory is 16.1GB. [2024-11-13 14:43:23,927 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 117.4MB. Free memory is still 73.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:43:23,927 INFO L158 Benchmark]: CACSL2BoogieTranslator took 563.83ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 67.6MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 14:43:23,927 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.84ms. Allocated memory is still 117.4MB. Free memory was 67.6MB in the beginning and 65.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:43:23,928 INFO L158 Benchmark]: Boogie Preprocessor took 77.10ms. Allocated memory is still 117.4MB. Free memory was 65.4MB in the beginning and 62.3MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:43:23,928 INFO L158 Benchmark]: RCFGBuilder took 972.91ms. Allocated memory is still 117.4MB. Free memory was 62.3MB in the beginning and 64.5MB in the end (delta: -2.3MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2024-11-13 14:43:23,928 INFO L158 Benchmark]: TraceAbstraction took 15355.69ms. Allocated memory was 117.4MB in the beginning and 1.0GB in the end (delta: 931.1MB). Free memory was 64.0MB in the beginning and 818.2MB in the end (delta: -754.2MB). Peak memory consumption was 170.6MB. Max. memory is 16.1GB. [2024-11-13 14:43:23,928 INFO L158 Benchmark]: Witness Printer took 4.30ms. Allocated memory is still 1.0GB. Free memory was 818.2MB in the beginning and 818.1MB in the end (delta: 141.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:43:23,930 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.48ms. Allocated memory is still 117.4MB. Free memory is still 73.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 563.83ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 67.6MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.84ms. Allocated memory is still 117.4MB. Free memory was 67.6MB in the beginning and 65.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 77.10ms. Allocated memory is still 117.4MB. Free memory was 65.4MB in the beginning and 62.3MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 972.91ms. Allocated memory is still 117.4MB. Free memory was 62.3MB in the beginning and 64.5MB in the end (delta: -2.3MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * TraceAbstraction took 15355.69ms. Allocated memory was 117.4MB in the beginning and 1.0GB in the end (delta: 931.1MB). Free memory was 64.0MB in the beginning and 818.2MB in the end (delta: -754.2MB). Peak memory consumption was 170.6MB. Max. memory is 16.1GB. * Witness Printer took 4.30ms. Allocated memory is still 1.0GB. Free memory was 818.2MB in the beginning and 818.1MB in the end (delta: 141.0kB). Peak memory consumption was 8.4MB. 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t633; [L849] FCALL, FORK 0 pthread_create(&t633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t633=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L764] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L767] 1 __unbuffered_p0_EBX = y VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L850] 0 pthread_t t634; [L851] FCALL, FORK 0 pthread_create(&t634, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t633=-1, t634=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L852] 0 pthread_t t635; [L853] FCALL, FORK 0 pthread_create(&t635, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t633=-1, t634=0, t635=1, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L787] 2 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L804] 3 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L807] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L826] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633=-1, t634=0, t635=1, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633=-1, t634=0, t635=1, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L866] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633=-1, t634=0, t635=1, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L868] 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}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L17] 0 __assert_fail ("0", "mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] - 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: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 853]: 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: 851]: 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 7 procedures, 74 locations, 7 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: 15.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 469 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 442 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 65 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1271 IncrementalHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 37 mSDtfsCounter, 1271 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=359occurred in iteration=8, InterpolantAutomatonStates: 60, 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.6s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 685 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-11-13 14:43:23,964 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd --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 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:43:26,798 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:43:26,940 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-13 14:43:26,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:43:26,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:43:26,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:43:26,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:43:26,987 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:43:26,987 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:43:26,987 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:43:26,988 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:43:26,988 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:43:26,988 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:43:26,988 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:43:26,988 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:43:26,989 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:43:26,990 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:43:26,990 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:43:26,990 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:43:26,990 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:43:26,990 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 14:43:26,991 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 14:43:26,991 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 14:43:26,991 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:43:26,991 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:43:26,991 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 14:43:26,991 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:43:26,991 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 14:43:26,991 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 14:43:26,991 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:43:26,991 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:43:26,991 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:43:26,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:43:26,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:43:26,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:43:26,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:43:26,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:43:26,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:43:26,992 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 14:43:26,992 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 14:43:26,992 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:43:26,992 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:43:26,992 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:43:26,993 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:43:26,994 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd 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 -> 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 [2024-11-13 14:43:27,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:43:27,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:43:27,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:43:27,347 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:43:27,347 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:43:27,348 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i Unable to find full path for "g++" [2024-11-13 14:43:29,290 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:43:29,733 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:43:29,738 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-11-13 14:43:29,760 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/data/b0854b347/5cdbf564bef44300a64ca448a5a69a5c/FLAG925f2f9ab [2024-11-13 14:43:29,789 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/data/b0854b347/5cdbf564bef44300a64ca448a5a69a5c [2024-11-13 14:43:29,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:43:29,794 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:43:29,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:43:29,796 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:43:29,801 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:43:29,802 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:43:29" (1/1) ... [2024-11-13 14:43:29,803 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@789ad7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:29, skipping insertion in model container [2024-11-13 14:43:29,803 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:43:29" (1/1) ... [2024-11-13 14:43:29,845 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:43:30,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:43:30,346 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:43:30,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:43:30,472 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:43:30,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:30 WrapperNode [2024-11-13 14:43:30,473 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:43:30,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:43:30,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:43:30,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:43:30,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:30" (1/1) ... [2024-11-13 14:43:30,503 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:30" (1/1) ... [2024-11-13 14:43:30,535 INFO L138 Inliner]: procedures = 176, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 129 [2024-11-13 14:43:30,535 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:43:30,536 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:43:30,536 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:43:30,536 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:43:30,549 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:30" (1/1) ... [2024-11-13 14:43:30,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:30" (1/1) ... [2024-11-13 14:43:30,553 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:30" (1/1) ... [2024-11-13 14:43:30,569 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-11-13 14:43:30,570 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:30" (1/1) ... [2024-11-13 14:43:30,570 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:30" (1/1) ... [2024-11-13 14:43:30,580 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:30" (1/1) ... [2024-11-13 14:43:30,582 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:30" (1/1) ... [2024-11-13 14:43:30,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:30" (1/1) ... [2024-11-13 14:43:30,586 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:30" (1/1) ... [2024-11-13 14:43:30,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:43:30,595 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:43:30,595 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:43:30,595 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:43:30,600 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:30" (1/1) ... [2024-11-13 14:43:30,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:43:30,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:43:30,639 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:43:30,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:43:30,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 14:43:30,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:43:30,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 14:43:30,674 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-13 14:43:30,674 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-13 14:43:30,674 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-13 14:43:30,675 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-13 14:43:30,675 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-13 14:43:30,675 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-13 14:43:30,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 14:43:30,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:43:30,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:43:30,681 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 14:43:30,895 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:43:30,897 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:43:31,357 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 14:43:31,357 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:43:31,715 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:43:31,716 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 14:43:31,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:43:31 BoogieIcfgContainer [2024-11-13 14:43:31,717 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:43:31,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:43:31,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:43:31,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:43:31,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:43:29" (1/3) ... [2024-11-13 14:43:31,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd20d11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:43:31, skipping insertion in model container [2024-11-13 14:43:31,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:30" (2/3) ... [2024-11-13 14:43:31,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd20d11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:43:31, skipping insertion in model container [2024-11-13 14:43:31,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:43:31" (3/3) ... [2024-11-13 14:43:31,731 INFO L112 eAbstractionObserver]: Analyzing ICFG mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-11-13 14:43:31,749 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:43:31,752 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i that has 4 procedures, 46 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-13 14:43:31,752 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 14:43:31,837 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 14:43:31,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 106 flow [2024-11-13 14:43:31,933 INFO L124 PetriNetUnfolderBase]: 2/44 cut-off events. [2024-11-13 14:43:31,937 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:43:31,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 2/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2024-11-13 14:43:31,943 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 47 transitions, 106 flow [2024-11-13 14:43:31,947 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 44 transitions, 97 flow [2024-11-13 14:43:31,959 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:43:31,973 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;@55ff44f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:43:31,973 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-13 14:43:31,978 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 14:43:31,978 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-13 14:43:31,978 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:43:31,978 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:43:31,979 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-13 14:43:31,980 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:43:31,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:31,985 INFO L85 PathProgramCache]: Analyzing trace with hash 12431965, now seen corresponding path program 1 times [2024-11-13 14:43:31,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:43:31,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [971456238] [2024-11-13 14:43:31,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:31,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:31,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:43:32,000 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:43:32,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:43:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:32,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:43:32,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:43:32,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:43:32,185 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:43:32,185 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:43:32,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971456238] [2024-11-13 14:43:32,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971456238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:43:32,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:43:32,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 14:43:32,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416874700] [2024-11-13 14:43:32,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:43:32,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:43:32,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:43:32,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:43:32,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:43:32,240 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-11-13 14:43:32,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-11-13 14:43:32,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:43:32,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-11-13 14:43:32,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:43:32,913 INFO L124 PetriNetUnfolderBase]: 825/1738 cut-off events. [2024-11-13 14:43:32,913 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-13 14:43:32,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3019 conditions, 1738 events. 825/1738 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12413 event pairs, 129 based on Foata normal form. 96/1816 useless extension candidates. Maximal degree in co-relation 3008. Up to 1009 conditions per place. [2024-11-13 14:43:32,939 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 33 selfloop transitions, 2 changer transitions 2/56 dead transitions. [2024-11-13 14:43:32,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 56 transitions, 201 flow [2024-11-13 14:43:32,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:43:32,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:43:32,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-11-13 14:43:32,957 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7659574468085106 [2024-11-13 14:43:32,959 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 97 flow. Second operand 3 states and 108 transitions. [2024-11-13 14:43:32,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 56 transitions, 201 flow [2024-11-13 14:43:32,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 56 transitions, 196 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-13 14:43:32,972 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 88 flow [2024-11-13 14:43:32,976 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-11-13 14:43:32,981 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2024-11-13 14:43:32,982 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 88 flow [2024-11-13 14:43:32,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-11-13 14:43:32,982 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:43:32,982 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:43:33,004 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 14:43:33,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:33,183 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:43:33,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:33,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1403503301, now seen corresponding path program 1 times [2024-11-13 14:43:33,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:43:33,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1537174859] [2024-11-13 14:43:33,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:33,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:33,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:43:33,189 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:43:33,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 14:43:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:33,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 14:43:33,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:43:33,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:43:33,363 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:43:33,363 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:43:33,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537174859] [2024-11-13 14:43:33,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537174859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:43:33,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:43:33,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 14:43:33,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345320644] [2024-11-13 14:43:33,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:43:33,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:43:33,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:43:33,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:43:33,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:43:33,366 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-11-13 14:43:33,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-11-13 14:43:33,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:43:33,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-11-13 14:43:33,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:43:33,734 INFO L124 PetriNetUnfolderBase]: 721/1387 cut-off events. [2024-11-13 14:43:33,734 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2024-11-13 14:43:33,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2607 conditions, 1387 events. 721/1387 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9113 event pairs, 721 based on Foata normal form. 48/1378 useless extension candidates. Maximal degree in co-relation 2597. Up to 1090 conditions per place. [2024-11-13 14:43:33,744 INFO L140 encePairwiseOnDemand]: 45/47 looper letters, 18 selfloop transitions, 1 changer transitions 1/38 dead transitions. [2024-11-13 14:43:33,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 126 flow [2024-11-13 14:43:33,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:43:33,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:43:33,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-11-13 14:43:33,748 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2024-11-13 14:43:33,748 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 88 flow. Second operand 3 states and 84 transitions. [2024-11-13 14:43:33,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 126 flow [2024-11-13 14:43:33,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 38 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:43:33,750 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 82 flow [2024-11-13 14:43:33,753 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-11-13 14:43:33,754 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2024-11-13 14:43:33,754 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 82 flow [2024-11-13 14:43:33,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-11-13 14:43:33,754 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:43:33,754 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:43:33,776 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 14:43:33,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:33,955 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:43:33,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:33,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1403501875, now seen corresponding path program 1 times [2024-11-13 14:43:33,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:43:33,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [723316385] [2024-11-13 14:43:33,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:33,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:33,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:43:33,964 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:43:33,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 14:43:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:34,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 14:43:34,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:43:34,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:43:34,153 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:43:34,154 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:43:34,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723316385] [2024-11-13 14:43:34,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723316385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:43:34,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:43:34,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:43:34,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086809265] [2024-11-13 14:43:34,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:43:34,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:43:34,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:43:34,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:43:34,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:43:34,166 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-11-13 14:43:34,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-11-13 14:43:34,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:43:34,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-11-13 14:43:34,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:43:34,756 INFO L124 PetriNetUnfolderBase]: 1499/2619 cut-off events. [2024-11-13 14:43:34,756 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:43:34,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4935 conditions, 2619 events. 1499/2619 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 16675 event pairs, 188 based on Foata normal form. 100/2678 useless extension candidates. Maximal degree in co-relation 4929. Up to 1316 conditions per place. [2024-11-13 14:43:34,778 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 42 selfloop transitions, 5 changer transitions 1/62 dead transitions. [2024-11-13 14:43:34,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 232 flow [2024-11-13 14:43:34,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:43:34,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 14:43:34,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2024-11-13 14:43:34,780 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.648936170212766 [2024-11-13 14:43:34,780 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 82 flow. Second operand 4 states and 122 transitions. [2024-11-13 14:43:34,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 232 flow [2024-11-13 14:43:34,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 62 transitions, 231 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 14:43:34,782 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 115 flow [2024-11-13 14:43:34,784 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2024-11-13 14:43:34,785 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2024-11-13 14:43:34,785 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 115 flow [2024-11-13 14:43:34,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-11-13 14:43:34,786 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:43:34,786 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] [2024-11-13 14:43:34,805 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-13 14:43:34,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:34,987 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:43:34,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:34,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1719680309, now seen corresponding path program 1 times [2024-11-13 14:43:34,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:43:34,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1172905526] [2024-11-13 14:43:34,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:34,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:34,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:43:34,991 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:43:34,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 14:43:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:35,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:43:35,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:43:35,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:43:35,171 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:43:35,171 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:43:35,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172905526] [2024-11-13 14:43:35,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172905526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:43:35,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:43:35,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:43:35,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696559251] [2024-11-13 14:43:35,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:43:35,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:43:35,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:43:35,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:43:35,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:43:35,193 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-11-13 14:43:35,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 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-11-13 14:43:35,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:43:35,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-11-13 14:43:35,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:43:35,625 INFO L124 PetriNetUnfolderBase]: 962/1686 cut-off events. [2024-11-13 14:43:35,625 INFO L125 PetriNetUnfolderBase]: For 423/423 co-relation queries the response was YES. [2024-11-13 14:43:35,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3792 conditions, 1686 events. 962/1686 cut-off events. For 423/423 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 9420 event pairs, 100 based on Foata normal form. 82/1734 useless extension candidates. Maximal degree in co-relation 3783. Up to 581 conditions per place. [2024-11-13 14:43:35,635 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 53 selfloop transitions, 8 changer transitions 1/76 dead transitions. [2024-11-13 14:43:35,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 76 transitions, 332 flow [2024-11-13 14:43:35,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:43:35,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 14:43:35,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2024-11-13 14:43:35,638 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6553191489361702 [2024-11-13 14:43:35,638 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 115 flow. Second operand 5 states and 154 transitions. [2024-11-13 14:43:35,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 76 transitions, 332 flow [2024-11-13 14:43:35,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 76 transitions, 322 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-13 14:43:35,641 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 155 flow [2024-11-13 14:43:35,641 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2024-11-13 14:43:35,642 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2024-11-13 14:43:35,642 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 155 flow [2024-11-13 14:43:35,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 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-11-13 14:43:35,643 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:43:35,643 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, 1, 1] [2024-11-13 14:43:35,664 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 14:43:35,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:35,844 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:43:35,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:35,844 INFO L85 PathProgramCache]: Analyzing trace with hash 991847940, now seen corresponding path program 1 times [2024-11-13 14:43:35,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:43:35,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1373003045] [2024-11-13 14:43:35,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:35,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:35,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:43:35,847 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:43:35,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 14:43:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:35,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:43:35,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:43:36,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-11-13 14:43:36,060 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:43:36,060 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:43:36,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373003045] [2024-11-13 14:43:36,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373003045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:43:36,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:43:36,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:43:36,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647441037] [2024-11-13 14:43:36,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:43:36,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:43:36,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:43:36,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:43:36,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:43:36,071 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-11-13 14:43:36,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 155 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 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-11-13 14:43:36,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:43:36,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-11-13 14:43:36,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:43:36,471 INFO L124 PetriNetUnfolderBase]: 569/963 cut-off events. [2024-11-13 14:43:36,474 INFO L125 PetriNetUnfolderBase]: For 756/756 co-relation queries the response was YES. [2024-11-13 14:43:36,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2478 conditions, 963 events. 569/963 cut-off events. For 756/756 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4434 event pairs, 83 based on Foata normal form. 40/969 useless extension candidates. Maximal degree in co-relation 2467. Up to 308 conditions per place. [2024-11-13 14:43:36,480 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 46 selfloop transitions, 11 changer transitions 1/72 dead transitions. [2024-11-13 14:43:36,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 72 transitions, 339 flow [2024-11-13 14:43:36,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:43:36,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 14:43:36,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2024-11-13 14:43:36,482 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2024-11-13 14:43:36,482 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 155 flow. Second operand 6 states and 168 transitions. [2024-11-13 14:43:36,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 72 transitions, 339 flow [2024-11-13 14:43:36,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 72 transitions, 314 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-13 14:43:36,494 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 169 flow [2024-11-13 14:43:36,494 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2024-11-13 14:43:36,495 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2024-11-13 14:43:36,496 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 169 flow [2024-11-13 14:43:36,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 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-11-13 14:43:36,497 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:43:36,497 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:43:36,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 14:43:36,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:36,698 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:43:36,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:36,698 INFO L85 PathProgramCache]: Analyzing trace with hash 878073836, now seen corresponding path program 1 times [2024-11-13 14:43:36,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:43:36,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2092211120] [2024-11-13 14:43:36,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:36,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:36,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:43:36,702 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:43:36,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 14:43:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:36,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-13 14:43:36,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:43:37,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:43:37,485 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:43:37,486 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:43:37,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092211120] [2024-11-13 14:43:37,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092211120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:43:37,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:43:37,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 14:43:37,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746682970] [2024-11-13 14:43:37,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:43:37,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 14:43:37,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:43:37,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 14:43:37,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:43:37,526 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-11-13 14:43:37,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 43 transitions, 169 flow. Second operand has 10 states, 10 states have (on average 21.8) internal successors, (218), 10 states have internal predecessors, (218), 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-11-13 14:43:37,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:43:37,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-11-13 14:43:37,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:43:38,149 INFO L124 PetriNetUnfolderBase]: 464/909 cut-off events. [2024-11-13 14:43:38,150 INFO L125 PetriNetUnfolderBase]: For 513/537 co-relation queries the response was YES. [2024-11-13 14:43:38,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2193 conditions, 909 events. 464/909 cut-off events. For 513/537 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4466 event pairs, 78 based on Foata normal form. 8/887 useless extension candidates. Maximal degree in co-relation 2181. Up to 245 conditions per place. [2024-11-13 14:43:38,155 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 33 selfloop transitions, 4 changer transitions 28/87 dead transitions. [2024-11-13 14:43:38,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 87 transitions, 407 flow [2024-11-13 14:43:38,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 14:43:38,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-13 14:43:38,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 266 transitions. [2024-11-13 14:43:38,157 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5659574468085107 [2024-11-13 14:43:38,157 INFO L175 Difference]: Start difference. First operand has 57 places, 43 transitions, 169 flow. Second operand 10 states and 266 transitions. [2024-11-13 14:43:38,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 87 transitions, 407 flow [2024-11-13 14:43:38,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 87 transitions, 340 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-11-13 14:43:38,166 INFO L231 Difference]: Finished difference. Result has 63 places, 43 transitions, 133 flow [2024-11-13 14:43:38,166 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=133, PETRI_PLACES=63, PETRI_TRANSITIONS=43} [2024-11-13 14:43:38,169 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places. [2024-11-13 14:43:38,169 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 43 transitions, 133 flow [2024-11-13 14:43:38,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.8) internal successors, (218), 10 states have internal predecessors, (218), 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-11-13 14:43:38,170 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:43:38,170 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:43:38,190 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 14:43:38,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:38,370 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:43:38,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:38,371 INFO L85 PathProgramCache]: Analyzing trace with hash 184121894, now seen corresponding path program 2 times [2024-11-13 14:43:38,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:43:38,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [605736680] [2024-11-13 14:43:38,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:43:38,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:38,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:43:38,373 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:43:38,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 14:43:38,483 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 14:43:38,483 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:43:38,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:43:38,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:43:38,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:43:38,572 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:43:38,572 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:43:38,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605736680] [2024-11-13 14:43:38,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605736680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:43:38,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:43:38,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:43:38,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507217262] [2024-11-13 14:43:38,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:43:38,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:43:38,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:43:38,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:43:38,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:43:38,592 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-11-13 14:43:38,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 43 transitions, 133 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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-11-13 14:43:38,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:43:38,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-11-13 14:43:38,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:43:38,939 INFO L124 PetriNetUnfolderBase]: 728/1350 cut-off events. [2024-11-13 14:43:38,940 INFO L125 PetriNetUnfolderBase]: For 380/380 co-relation queries the response was YES. [2024-11-13 14:43:38,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2955 conditions, 1350 events. 728/1350 cut-off events. For 380/380 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7383 event pairs, 249 based on Foata normal form. 8/1309 useless extension candidates. Maximal degree in co-relation 2942. Up to 547 conditions per place. [2024-11-13 14:43:38,946 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 27 selfloop transitions, 2 changer transitions 20/69 dead transitions. [2024-11-13 14:43:38,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 69 transitions, 302 flow [2024-11-13 14:43:38,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:43:38,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 14:43:38,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2024-11-13 14:43:38,947 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5602836879432624 [2024-11-13 14:43:38,947 INFO L175 Difference]: Start difference. First operand has 63 places, 43 transitions, 133 flow. Second operand 6 states and 158 transitions. [2024-11-13 14:43:38,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 69 transitions, 302 flow [2024-11-13 14:43:38,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 69 transitions, 274 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-11-13 14:43:38,950 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 131 flow [2024-11-13 14:43:38,950 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=131, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2024-11-13 14:43:38,951 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2024-11-13 14:43:38,951 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 131 flow [2024-11-13 14:43:38,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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-11-13 14:43:38,951 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:43:38,951 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:43:38,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-13 14:43:39,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:39,156 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:43:39,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:39,156 INFO L85 PathProgramCache]: Analyzing trace with hash -451853934, now seen corresponding path program 3 times [2024-11-13 14:43:39,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:43:39,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1822713295] [2024-11-13 14:43:39,157 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 14:43:39,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:39,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:43:39,159 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:43:39,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 14:43:39,266 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-13 14:43:39,266 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-13 14:43:39,267 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:43:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:43:39,362 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-13 14:43:39,362 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 14:43:39,363 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-13 14:43:39,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-13 14:43:39,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-13 14:43:39,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-13 14:43:39,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-13 14:43:39,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-13 14:43:39,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-13 14:43:39,386 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 14:43:39,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:39,566 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2024-11-13 14:43:39,684 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 14:43:39,684 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:43:39,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:43:39 BasicIcfg [2024-11-13 14:43:39,693 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:43:39,693 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:43:39,694 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:43:39,694 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:43:39,696 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:43:31" (3/4) ... [2024-11-13 14:43:39,700 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 14:43:39,701 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:43:39,702 INFO L158 Benchmark]: Toolchain (without parser) took 9908.16ms. Allocated memory was 83.9MB in the beginning and 167.8MB in the end (delta: 83.9MB). Free memory was 58.9MB in the beginning and 56.6MB in the end (delta: 2.3MB). Peak memory consumption was 85.7MB. Max. memory is 16.1GB. [2024-11-13 14:43:39,703 INFO L158 Benchmark]: CDTParser took 2.79ms. Allocated memory is still 83.9MB. Free memory is still 64.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:43:39,703 INFO L158 Benchmark]: CACSL2BoogieTranslator took 678.28ms. Allocated memory is still 83.9MB. Free memory was 58.9MB in the beginning and 35.4MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 14:43:39,703 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.82ms. Allocated memory is still 83.9MB. Free memory was 35.4MB in the beginning and 33.0MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:43:39,704 INFO L158 Benchmark]: Boogie Preprocessor took 58.08ms. Allocated memory is still 83.9MB. Free memory was 33.0MB in the beginning and 30.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:43:39,704 INFO L158 Benchmark]: RCFGBuilder took 1122.33ms. Allocated memory is still 83.9MB. Free memory was 30.0MB in the beginning and 32.4MB in the end (delta: -2.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-13 14:43:39,704 INFO L158 Benchmark]: TraceAbstraction took 7972.60ms. Allocated memory was 83.9MB in the beginning and 167.8MB in the end (delta: 83.9MB). Free memory was 31.9MB in the beginning and 56.7MB in the end (delta: -24.7MB). Peak memory consumption was 54.2MB. Max. memory is 16.1GB. [2024-11-13 14:43:39,705 INFO L158 Benchmark]: Witness Printer took 7.63ms. Allocated memory is still 167.8MB. Free memory was 56.7MB in the beginning and 56.6MB in the end (delta: 15.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:43:39,707 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.79ms. Allocated memory is still 83.9MB. Free memory is still 64.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 678.28ms. Allocated memory is still 83.9MB. Free memory was 58.9MB in the beginning and 35.4MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.82ms. Allocated memory is still 83.9MB. Free memory was 35.4MB in the beginning and 33.0MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.08ms. Allocated memory is still 83.9MB. Free memory was 33.0MB in the beginning and 30.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1122.33ms. Allocated memory is still 83.9MB. Free memory was 30.0MB in the beginning and 32.4MB in the end (delta: -2.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7972.60ms. Allocated memory was 83.9MB in the beginning and 167.8MB in the end (delta: 83.9MB). Free memory was 31.9MB in the beginning and 56.7MB in the end (delta: -24.7MB). Peak memory consumption was 54.2MB. Max. memory is 16.1GB. * Witness Printer took 7.63ms. Allocated memory is still 167.8MB. Free memory was 56.7MB in the beginning and 56.6MB in the end (delta: 15.4kB). 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t633; [L849] FCALL, FORK 0 pthread_create(&t633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t633=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L764] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L767] 1 __unbuffered_p0_EBX = y VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L850] 0 pthread_t t634; [L851] FCALL, FORK 0 pthread_create(&t634, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t633=-2, t634=-1, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L852] 0 pthread_t t635; [L853] FCALL, FORK 0 pthread_create(&t635, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t633=-2, t634=-1, t635=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L787] 2 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L804] 3 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L807] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L826] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633=-2, t634=-1, t635=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633=-2, t634=-1, t635=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L866] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633=-2, t634=-1, t635=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L868] 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}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L17] 0 __assert_fail ("0", "mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] - 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: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 853]: 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: 851]: 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 7 procedures, 74 locations, 7 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: 7.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 304 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 294 mSDsluCounter, 89 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 893 IncrementalHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 1 mSDtfsCounter, 893 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=5, InterpolantAutomatonStates: 37, 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.2s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 139 ConstructedInterpolants, 0 QuantifiedInterpolants, 597 SizeOfPredicates, 14 NumberOfNonLiveVariables, 696 ConjunctsInSsa, 43 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-11-13 14:43:39,738 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee778356-6a2c-4d3f-8d94-68e7047f2e0a/bin/uautomizer-verify-qhAvR1uOyd/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