./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix036_pso.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix036_pso.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB --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 eb5b5f76ea992c17ebcf5a0e506a820a4d574c4d0723905971e2f5f6725ae203 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:06:50,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:06:50,399 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 02:06:50,410 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:06:50,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:06:50,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:06:50,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:06:50,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:06:50,452 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:06:50,452 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:06:50,452 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:06:50,452 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:06:50,453 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:06:50,454 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:06:50,455 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:06:50,456 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:06:50,456 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:06:50,456 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:06:50,456 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:06:50,456 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:06:50,456 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 02:06:50,457 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 02:06:50,457 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 02:06:50,457 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:06:50,457 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 02:06:50,457 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 02:06:50,457 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:06:50,457 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:06:50,457 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:06:50,457 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:06:50,458 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:06:50,458 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:06:50,458 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:06:50,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:06:50,458 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:06:50,458 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:06:50,459 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:06:50,459 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:06:50,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:06:50,459 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:06:50,459 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:06:50,459 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 02:06:50,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 02:06:50,459 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:06:50,460 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:06:50,460 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:06:50,460 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:06:50,460 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_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB 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 -> eb5b5f76ea992c17ebcf5a0e506a820a4d574c4d0723905971e2f5f6725ae203 [2024-11-28 02:06:50,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:06:50,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:06:50,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:06:50,814 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:06:50,814 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:06:50,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-wmm/mix036_pso.opt_tso.opt.i [2024-11-28 02:06:53,810 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/data/d57f37697/89cca29fb2dd47a2bcf04b6b828823c5/FLAGab98a0fba [2024-11-28 02:06:54,215 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:06:54,217 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/sv-benchmarks/c/pthread-wmm/mix036_pso.opt_tso.opt.i [2024-11-28 02:06:54,238 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/data/d57f37697/89cca29fb2dd47a2bcf04b6b828823c5/FLAGab98a0fba [2024-11-28 02:06:54,258 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/data/d57f37697/89cca29fb2dd47a2bcf04b6b828823c5 [2024-11-28 02:06:54,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:06:54,264 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:06:54,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:06:54,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:06:54,273 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:06:54,275 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:06:54" (1/1) ... [2024-11-28 02:06:54,276 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b17a40d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:54, skipping insertion in model container [2024-11-28 02:06:54,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:06:54" (1/1) ... [2024-11-28 02:06:54,333 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:06:54,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:06:54,877 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:06:54,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:06:55,043 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:06:55,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:55 WrapperNode [2024-11-28 02:06:55,045 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:06:55,046 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:06:55,047 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:06:55,047 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:06:55,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:55" (1/1) ... [2024-11-28 02:06:55,079 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:55" (1/1) ... [2024-11-28 02:06:55,119 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 140 [2024-11-28 02:06:55,119 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:06:55,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:06:55,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:06:55,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:06:55,135 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:55" (1/1) ... [2024-11-28 02:06:55,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:55" (1/1) ... [2024-11-28 02:06:55,141 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:55" (1/1) ... [2024-11-28 02:06:55,177 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-28 02:06:55,177 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:55" (1/1) ... [2024-11-28 02:06:55,177 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:55" (1/1) ... [2024-11-28 02:06:55,189 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:55" (1/1) ... [2024-11-28 02:06:55,194 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:55" (1/1) ... [2024-11-28 02:06:55,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:55" (1/1) ... [2024-11-28 02:06:55,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:55" (1/1) ... [2024-11-28 02:06:55,200 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:55" (1/1) ... [2024-11-28 02:06:55,208 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:06:55,210 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:06:55,211 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:06:55,211 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:06:55,212 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:55" (1/1) ... [2024-11-28 02:06:55,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:06:55,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:06:55,249 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:06:55,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:06:55,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-28 02:06:55,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:06:55,284 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-28 02:06:55,284 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-28 02:06:55,284 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-28 02:06:55,284 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-28 02:06:55,284 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-28 02:06:55,284 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-28 02:06:55,284 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-28 02:06:55,284 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-28 02:06:55,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 02:06:55,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-28 02:06:55,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:06:55,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:06:55,286 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 02:06:55,475 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:06:55,477 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:06:55,877 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 02:06:55,877 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:06:56,200 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:06:56,200 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-28 02:06:56,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:06:56 BoogieIcfgContainer [2024-11-28 02:06:56,201 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:06:56,203 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:06:56,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:06:56,208 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:06:56,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:06:54" (1/3) ... [2024-11-28 02:06:56,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2afddd50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:06:56, skipping insertion in model container [2024-11-28 02:06:56,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:55" (2/3) ... [2024-11-28 02:06:56,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2afddd50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:06:56, skipping insertion in model container [2024-11-28 02:06:56,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:06:56" (3/3) ... [2024-11-28 02:06:56,211 INFO L128 eAbstractionObserver]: Analyzing ICFG mix036_pso.opt_tso.opt.i [2024-11-28 02:06:56,228 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:06:56,230 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix036_pso.opt_tso.opt.i that has 5 procedures, 54 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-28 02:06:56,230 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 02:06:56,310 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-28 02:06:56,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 126 flow [2024-11-28 02:06:56,415 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2024-11-28 02:06:56,418 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 02:06:56,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 110 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2024-11-28 02:06:56,425 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 126 flow [2024-11-28 02:06:56,429 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 114 flow [2024-11-28 02:06:56,444 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:06:56,462 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;@7692ae21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:06:56,463 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-28 02:06:56,482 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 02:06:56,482 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-11-28 02:06:56,482 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 02:06:56,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:06:56,484 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:06:56,485 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-28 02:06:56,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:06:56,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1547913968, now seen corresponding path program 1 times [2024-11-28 02:06:56,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:06:56,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478103766] [2024-11-28 02:06:56,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:06:56,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:06:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:06:57,279 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-28 02:06:57,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:06:57,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478103766] [2024-11-28 02:06:57,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478103766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:06:57,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:06:57,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 02:06:57,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961141754] [2024-11-28 02:06:57,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:06:57,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:06:57,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:06:57,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:06:57,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:06:57,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2024-11-28 02:06:57,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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-28 02:06:57,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:06:57,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2024-11-28 02:06:57,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:06:58,037 INFO L124 PetriNetUnfolderBase]: 931/1851 cut-off events. [2024-11-28 02:06:58,038 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 02:06:58,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3247 conditions, 1851 events. 931/1851 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 13952 event pairs, 199 based on Foata normal form. 96/1907 useless extension candidates. Maximal degree in co-relation 3235. Up to 1021 conditions per place. [2024-11-28 02:06:58,073 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 29 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2024-11-28 02:06:58,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 58 transitions, 194 flow [2024-11-28 02:06:58,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:06:58,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 02:06:58,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2024-11-28 02:06:58,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7575757575757576 [2024-11-28 02:06:58,093 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 125 transitions. [2024-11-28 02:06:58,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 58 transitions, 194 flow [2024-11-28 02:06:58,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 58 transitions, 190 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-28 02:06:58,109 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2024-11-28 02:06:58,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-11-28 02:06:58,118 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2024-11-28 02:06:58,118 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2024-11-28 02:06:58,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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-28 02:06:58,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:06:58,119 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:06:58,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 02:06:58,120 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-28 02:06:58,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:06:58,122 INFO L85 PathProgramCache]: Analyzing trace with hash 837422488, now seen corresponding path program 1 times [2024-11-28 02:06:58,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:06:58,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094791573] [2024-11-28 02:06:58,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:06:58,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:06:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:06:58,260 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-28 02:06:58,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:06:58,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094791573] [2024-11-28 02:06:58,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094791573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:06:58,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:06:58,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 02:06:58,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686098143] [2024-11-28 02:06:58,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:06:58,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:06:58,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:06:58,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:06:58,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:06:58,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2024-11-28 02:06:58,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-28 02:06:58,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:06:58,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2024-11-28 02:06:58,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:06:58,740 INFO L124 PetriNetUnfolderBase]: 815/1519 cut-off events. [2024-11-28 02:06:58,740 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2024-11-28 02:06:58,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2833 conditions, 1519 events. 815/1519 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11030 event pairs, 815 based on Foata normal form. 48/1491 useless extension candidates. Maximal degree in co-relation 2823. Up to 1188 conditions per place. [2024-11-28 02:06:58,754 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 19 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2024-11-28 02:06:58,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 144 flow [2024-11-28 02:06:58,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:06:58,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 02:06:58,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-11-28 02:06:58,757 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2024-11-28 02:06:58,758 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 106 transitions. [2024-11-28 02:06:58,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 144 flow [2024-11-28 02:06:58,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 02:06:58,762 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 98 flow [2024-11-28 02:06:58,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2024-11-28 02:06:58,763 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2024-11-28 02:06:58,763 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 98 flow [2024-11-28 02:06:58,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-28 02:06:58,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:06:58,764 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:06:58,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 02:06:58,764 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-28 02:06:58,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:06:58,765 INFO L85 PathProgramCache]: Analyzing trace with hash 837423711, now seen corresponding path program 1 times [2024-11-28 02:06:58,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:06:58,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444255530] [2024-11-28 02:06:58,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:06:58,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:06:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:06:59,132 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-28 02:06:59,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:06:59,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444255530] [2024-11-28 02:06:59,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444255530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:06:59,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:06:59,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:06:59,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709079949] [2024-11-28 02:06:59,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:06:59,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:06:59,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:06:59,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:06:59,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:06:59,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-11-28 02:06:59,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 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-28 02:06:59,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:06:59,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-11-28 02:06:59,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:07:00,678 INFO L124 PetriNetUnfolderBase]: 4832/7640 cut-off events. [2024-11-28 02:07:00,678 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 02:07:00,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14409 conditions, 7640 events. 4832/7640 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 53017 event pairs, 2502 based on Foata normal form. 0/7449 useless extension candidates. Maximal degree in co-relation 14403. Up to 4354 conditions per place. [2024-11-28 02:07:00,738 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 34 selfloop transitions, 5 changer transitions 49/106 dead transitions. [2024-11-28 02:07:00,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 106 transitions, 404 flow [2024-11-28 02:07:00,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:07:00,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-28 02:07:00,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 274 transitions. [2024-11-28 02:07:00,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2024-11-28 02:07:00,744 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 98 flow. Second operand 8 states and 274 transitions. [2024-11-28 02:07:00,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 106 transitions, 404 flow [2024-11-28 02:07:00,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 106 transitions, 403 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 02:07:00,747 INFO L231 Difference]: Finished difference. Result has 66 places, 47 transitions, 152 flow [2024-11-28 02:07:00,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=152, PETRI_PLACES=66, PETRI_TRANSITIONS=47} [2024-11-28 02:07:00,749 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2024-11-28 02:07:00,749 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 47 transitions, 152 flow [2024-11-28 02:07:00,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 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-28 02:07:00,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:07:00,751 INFO L206 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-28 02:07:00,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 02:07:00,751 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-28 02:07:00,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:00,752 INFO L85 PathProgramCache]: Analyzing trace with hash -447455969, now seen corresponding path program 1 times [2024-11-28 02:07:00,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:00,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702861307] [2024-11-28 02:07:00,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:00,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:01,087 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-28 02:07:01,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:01,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702861307] [2024-11-28 02:07:01,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702861307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:01,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:01,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:07:01,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507691465] [2024-11-28 02:07:01,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:01,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:07:01,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:01,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:07:01,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:07:01,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-11-28 02:07:01,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 47 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 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-28 02:07:01,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:07:01,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-11-28 02:07:01,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:07:02,323 INFO L124 PetriNetUnfolderBase]: 3470/5369 cut-off events. [2024-11-28 02:07:02,323 INFO L125 PetriNetUnfolderBase]: For 7300/7300 co-relation queries the response was YES. [2024-11-28 02:07:02,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15620 conditions, 5369 events. 3470/5369 cut-off events. For 7300/7300 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 34659 event pairs, 762 based on Foata normal form. 156/5450 useless extension candidates. Maximal degree in co-relation 15608. Up to 2836 conditions per place. [2024-11-28 02:07:02,392 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 35 selfloop transitions, 3 changer transitions 37/93 dead transitions. [2024-11-28 02:07:02,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 93 transitions, 506 flow [2024-11-28 02:07:02,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 02:07:02,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-28 02:07:02,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 234 transitions. [2024-11-28 02:07:02,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6077922077922078 [2024-11-28 02:07:02,395 INFO L175 Difference]: Start difference. First operand has 66 places, 47 transitions, 152 flow. Second operand 7 states and 234 transitions. [2024-11-28 02:07:02,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 93 transitions, 506 flow [2024-11-28 02:07:02,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 93 transitions, 493 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-11-28 02:07:02,447 INFO L231 Difference]: Finished difference. Result has 68 places, 47 transitions, 162 flow [2024-11-28 02:07:02,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=162, PETRI_PLACES=68, PETRI_TRANSITIONS=47} [2024-11-28 02:07:02,449 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 6 predicate places. [2024-11-28 02:07:02,450 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 47 transitions, 162 flow [2024-11-28 02:07:02,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 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-28 02:07:02,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:07:02,450 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:02,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 02:07:02,451 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-28 02:07:02,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:02,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1351584668, now seen corresponding path program 1 times [2024-11-28 02:07:02,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:02,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778114500] [2024-11-28 02:07:02,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:02,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:02,780 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-28 02:07:02,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:02,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778114500] [2024-11-28 02:07:02,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778114500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:02,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:02,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:07:02,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970256394] [2024-11-28 02:07:02,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:02,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:07:02,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:02,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:07:02,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:07:02,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-11-28 02:07:02,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 47 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-28 02:07:02,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:07:02,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-11-28 02:07:02,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:07:04,305 INFO L124 PetriNetUnfolderBase]: 6879/10385 cut-off events. [2024-11-28 02:07:04,306 INFO L125 PetriNetUnfolderBase]: For 7331/7924 co-relation queries the response was YES. [2024-11-28 02:07:04,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25008 conditions, 10385 events. 6879/10385 cut-off events. For 7331/7924 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 71279 event pairs, 1271 based on Foata normal form. 355/10388 useless extension candidates. Maximal degree in co-relation 24992. Up to 5464 conditions per place. [2024-11-28 02:07:04,422 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 46 selfloop transitions, 6 changer transitions 0/73 dead transitions. [2024-11-28 02:07:04,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 73 transitions, 336 flow [2024-11-28 02:07:04,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:07:04,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 02:07:04,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2024-11-28 02:07:04,424 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6772727272727272 [2024-11-28 02:07:04,424 INFO L175 Difference]: Start difference. First operand has 68 places, 47 transitions, 162 flow. Second operand 4 states and 149 transitions. [2024-11-28 02:07:04,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 73 transitions, 336 flow [2024-11-28 02:07:04,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 73 transitions, 322 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-11-28 02:07:04,466 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 194 flow [2024-11-28 02:07:04,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2024-11-28 02:07:04,468 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 1 predicate places. [2024-11-28 02:07:04,469 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 194 flow [2024-11-28 02:07:04,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-28 02:07:04,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:07:04,469 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:04,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 02:07:04,469 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-28 02:07:04,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:04,470 INFO L85 PathProgramCache]: Analyzing trace with hash 513539103, now seen corresponding path program 1 times [2024-11-28 02:07:04,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:04,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130875660] [2024-11-28 02:07:04,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:04,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:04,793 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-28 02:07:04,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:04,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130875660] [2024-11-28 02:07:04,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130875660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:04,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:04,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:07:04,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064714347] [2024-11-28 02:07:04,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:04,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:07:04,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:04,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:07:04,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:07:04,811 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-11-28 02:07:04,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 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-28 02:07:04,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:07:04,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-11-28 02:07:04,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:07:05,959 INFO L124 PetriNetUnfolderBase]: 6051/9253 cut-off events. [2024-11-28 02:07:05,959 INFO L125 PetriNetUnfolderBase]: For 7124/8254 co-relation queries the response was YES. [2024-11-28 02:07:06,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24992 conditions, 9253 events. 6051/9253 cut-off events. For 7124/8254 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 62431 event pairs, 712 based on Foata normal form. 350/9308 useless extension candidates. Maximal degree in co-relation 24978. Up to 3721 conditions per place. [2024-11-28 02:07:06,037 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 59 selfloop transitions, 10 changer transitions 0/90 dead transitions. [2024-11-28 02:07:06,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 90 transitions, 455 flow [2024-11-28 02:07:06,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:07:06,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 02:07:06,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 190 transitions. [2024-11-28 02:07:06,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6909090909090909 [2024-11-28 02:07:06,039 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 194 flow. Second operand 5 states and 190 transitions. [2024-11-28 02:07:06,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 90 transitions, 455 flow [2024-11-28 02:07:06,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 90 transitions, 452 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 02:07:06,042 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 259 flow [2024-11-28 02:07:06,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=259, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2024-11-28 02:07:06,044 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 6 predicate places. [2024-11-28 02:07:06,045 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 259 flow [2024-11-28 02:07:06,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 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-28 02:07:06,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:07:06,045 INFO L206 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] [2024-11-28 02:07:06,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 02:07:06,046 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-28 02:07:06,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:06,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1891086994, now seen corresponding path program 1 times [2024-11-28 02:07:06,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:06,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827660196] [2024-11-28 02:07:06,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:06,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:06,979 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-28 02:07:06,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:06,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827660196] [2024-11-28 02:07:06,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827660196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:06,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:06,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 02:07:06,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238312612] [2024-11-28 02:07:06,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:06,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 02:07:06,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:06,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 02:07:06,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:07:07,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 55 [2024-11-28 02:07:07,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 259 flow. Second operand has 9 states, 9 states have (on average 24.22222222222222) internal successors, (218), 9 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-28 02:07:07,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:07:07,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 55 [2024-11-28 02:07:07,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:07:08,955 INFO L124 PetriNetUnfolderBase]: 6670/11010 cut-off events. [2024-11-28 02:07:08,955 INFO L125 PetriNetUnfolderBase]: For 15130/17797 co-relation queries the response was YES. [2024-11-28 02:07:08,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32060 conditions, 11010 events. 6670/11010 cut-off events. For 15130/17797 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 81061 event pairs, 1681 based on Foata normal form. 192/10566 useless extension candidates. Maximal degree in co-relation 32043. Up to 7338 conditions per place. [2024-11-28 02:07:09,037 INFO L140 encePairwiseOnDemand]: 42/55 looper letters, 89 selfloop transitions, 42 changer transitions 4/162 dead transitions. [2024-11-28 02:07:09,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 162 transitions, 986 flow [2024-11-28 02:07:09,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 02:07:09,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-28 02:07:09,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 420 transitions. [2024-11-28 02:07:09,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5874125874125874 [2024-11-28 02:07:09,040 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 259 flow. Second operand 13 states and 420 transitions. [2024-11-28 02:07:09,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 162 transitions, 986 flow [2024-11-28 02:07:09,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 162 transitions, 971 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-11-28 02:07:09,048 INFO L231 Difference]: Finished difference. Result has 86 places, 98 transitions, 635 flow [2024-11-28 02:07:09,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=635, PETRI_PLACES=86, PETRI_TRANSITIONS=98} [2024-11-28 02:07:09,048 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 24 predicate places. [2024-11-28 02:07:09,048 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 98 transitions, 635 flow [2024-11-28 02:07:09,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 24.22222222222222) internal successors, (218), 9 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-28 02:07:09,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:07:09,049 INFO L206 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] [2024-11-28 02:07:09,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 02:07:09,049 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-28 02:07:09,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:09,050 INFO L85 PathProgramCache]: Analyzing trace with hash 2084419650, now seen corresponding path program 2 times [2024-11-28 02:07:09,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:09,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416903879] [2024-11-28 02:07:09,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:07:09,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:09,078 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 02:07:09,078 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:07:09,383 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-28 02:07:09,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:09,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416903879] [2024-11-28 02:07:09,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416903879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:09,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:09,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:07:09,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874533786] [2024-11-28 02:07:09,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:09,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:07:09,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:09,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:07:09,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:07:09,390 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2024-11-28 02:07:09,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 98 transitions, 635 flow. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 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-28 02:07:09,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:07:09,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2024-11-28 02:07:09,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:07:11,479 INFO L124 PetriNetUnfolderBase]: 8490/14646 cut-off events. [2024-11-28 02:07:11,480 INFO L125 PetriNetUnfolderBase]: For 30231/32268 co-relation queries the response was YES. [2024-11-28 02:07:11,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47899 conditions, 14646 events. 8490/14646 cut-off events. For 30231/32268 co-relation queries the response was YES. Maximal size of possible extension queue 823. Compared 121618 event pairs, 2559 based on Foata normal form. 242/13779 useless extension candidates. Maximal degree in co-relation 47874. Up to 5073 conditions per place. [2024-11-28 02:07:11,601 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 90 selfloop transitions, 7 changer transitions 15/154 dead transitions. [2024-11-28 02:07:11,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 154 transitions, 1131 flow [2024-11-28 02:07:11,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:07:11,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 02:07:11,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 218 transitions. [2024-11-28 02:07:11,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6606060606060606 [2024-11-28 02:07:11,603 INFO L175 Difference]: Start difference. First operand has 86 places, 98 transitions, 635 flow. Second operand 6 states and 218 transitions. [2024-11-28 02:07:11,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 154 transitions, 1131 flow [2024-11-28 02:07:11,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 154 transitions, 1059 flow, removed 36 selfloop flow, removed 0 redundant places. [2024-11-28 02:07:11,677 INFO L231 Difference]: Finished difference. Result has 95 places, 88 transitions, 532 flow [2024-11-28 02:07:11,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=532, PETRI_PLACES=95, PETRI_TRANSITIONS=88} [2024-11-28 02:07:11,678 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 33 predicate places. [2024-11-28 02:07:11,678 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 88 transitions, 532 flow [2024-11-28 02:07:11,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 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-28 02:07:11,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:07:11,684 INFO L206 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] [2024-11-28 02:07:11,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 02:07:11,684 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-28 02:07:11,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:11,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1265830576, now seen corresponding path program 3 times [2024-11-28 02:07:11,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:11,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223243898] [2024-11-28 02:07:11,685 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 02:07:11,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:11,748 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-28 02:07:11,750 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:07:12,044 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-28 02:07:12,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:12,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223243898] [2024-11-28 02:07:12,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223243898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:12,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:12,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:07:12,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996500375] [2024-11-28 02:07:12,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:12,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:07:12,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:12,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:07:12,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:07:12,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-11-28 02:07:12,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 88 transitions, 532 flow. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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-28 02:07:12,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:07:12,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-11-28 02:07:12,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:07:12,978 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][91], [111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 30#L868true, 42#L780true, 63#true, 65#true, 183#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 61#true, Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 67#true, Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), 46#L803true, Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-28 02:07:12,979 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-28 02:07:12,979 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 02:07:12,979 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 02:07:12,980 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 02:07:13,018 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][91], [111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 42#L780true, 63#true, 65#true, 183#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), 7#L866true, 46#L803true, Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-28 02:07:13,018 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-11-28 02:07:13,019 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 02:07:13,019 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 02:07:13,019 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 02:07:13,155 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][91], [111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 63#true, 65#true, 183#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), 7#L866true, 46#L803true, Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, 38#P1EXITtrue, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-28 02:07:13,155 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-28 02:07:13,155 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 02:07:13,155 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 02:07:13,155 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 02:07:13,157 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][91], [30#L868true, 111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 42#L780true, 63#true, 65#true, 183#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), 46#L803true, Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-28 02:07:13,157 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-28 02:07:13,157 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 02:07:13,157 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 02:07:13,157 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 02:07:13,157 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 02:07:13,159 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][91], [30#L868true, 42#L780true, 63#true, 65#true, 183#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), 46#L803true, Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-28 02:07:13,159 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-28 02:07:13,159 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 02:07:13,159 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 02:07:13,159 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 02:07:13,237 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][91], [111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 30#L868true, 63#true, 65#true, 183#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 61#true, Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 67#true, Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), 46#L803true, Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, 38#P1EXITtrue, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-28 02:07:13,237 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-28 02:07:13,237 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 02:07:13,237 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 02:07:13,237 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 02:07:13,240 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 30#L868true, 42#L780true, 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 26#L808true, 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-28 02:07:13,240 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-28 02:07:13,240 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 02:07:13,240 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 02:07:13,240 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 02:07:13,276 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][91], [30#L868true, 111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 63#true, 65#true, 183#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), 46#L803true, Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, 38#P1EXITtrue, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-28 02:07:13,277 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-28 02:07:13,277 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 02:07:13,277 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 02:07:13,277 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 02:07:13,277 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 02:07:13,278 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][91], [30#L868true, 63#true, 65#true, 183#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), 46#L803true, Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, 38#P1EXITtrue, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-28 02:07:13,278 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-28 02:07:13,278 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 02:07:13,278 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 02:07:13,278 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 02:07:13,280 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 42#L780true, 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), 7#L866true, Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 26#L808true, 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-28 02:07:13,280 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-28 02:07:13,280 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 02:07:13,280 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 02:07:13,280 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 02:07:13,370 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 30#L868true, 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 26#L808true, 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, 38#P1EXITtrue, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-28 02:07:13,370 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,370 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,370 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,371 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,520 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), 7#L866true, Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 26#L808true, 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, 38#P1EXITtrue, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-28 02:07:13,520 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-28 02:07:13,520 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 02:07:13,520 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 02:07:13,520 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 02:07:13,522 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [30#L868true, 111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 42#L780true, 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 26#L808true, 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-28 02:07:13,522 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-28 02:07:13,522 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 02:07:13,522 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 02:07:13,522 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 02:07:13,522 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 02:07:13,524 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [30#L868true, 42#L780true, 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 26#L808true, 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-28 02:07:13,524 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-28 02:07:13,524 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 02:07:13,524 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 02:07:13,524 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 02:07:13,525 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 42#L780true, 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), 7#L866true, Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 58#P2EXITtrue, Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-28 02:07:13,525 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-28 02:07:13,525 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 02:07:13,525 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 02:07:13,525 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 02:07:13,525 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [30#L868true, 42#L780true, 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 26#L808true, 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-28 02:07:13,525 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-28 02:07:13,525 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 02:07:13,526 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 02:07:13,526 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 02:07:13,588 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 30#L868true, 42#L780true, 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 67#true, Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 58#P2EXITtrue, Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-28 02:07:13,588 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,588 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,588 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,588 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,611 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [30#L868true, 111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 26#L808true, 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, 38#P1EXITtrue, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-28 02:07:13,612 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,612 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,612 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,612 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,612 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,614 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [30#L868true, 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 26#L808true, 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, 38#P1EXITtrue, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-28 02:07:13,614 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,614 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,614 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,614 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,615 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), 7#L866true, Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 58#P2EXITtrue, Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, 38#P1EXITtrue, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-28 02:07:13,615 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,615 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,615 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,615 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,616 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [30#L868true, 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 26#L808true, 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, 38#P1EXITtrue, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-28 02:07:13,616 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,616 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,616 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,616 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,619 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [30#L868true, 111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 42#L780true, 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 58#P2EXITtrue, Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-28 02:07:13,619 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,619 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,619 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,619 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,619 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,622 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [30#L868true, 42#L780true, 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), 58#P2EXITtrue, Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-28 02:07:13,622 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,623 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,623 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,623 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,624 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [30#L868true, 42#L780true, 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 58#P2EXITtrue, Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-28 02:07:13,624 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,624 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,624 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,624 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 02:07:13,712 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 30#L868true, 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 67#true, Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 58#P2EXITtrue, Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, 38#P1EXITtrue, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-28 02:07:13,712 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 02:07:13,712 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 02:07:13,713 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 02:07:13,713 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 02:07:13,750 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [30#L868true, 111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 58#P2EXITtrue, Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, 38#P1EXITtrue, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-28 02:07:13,751 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 02:07:13,751 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 02:07:13,751 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 02:07:13,751 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 02:07:13,751 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 02:07:13,753 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [30#L868true, 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 58#P2EXITtrue, Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, 38#P1EXITtrue, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-28 02:07:13,754 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 02:07:13,754 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 02:07:13,754 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 02:07:13,754 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 02:07:13,755 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][105], [30#L868true, 63#true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 147#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 67#true, Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 145#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 58#P2EXITtrue, Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 149#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), Black: 169#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 167#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#L757true, 38#P1EXITtrue, Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 127#true, Black: 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-28 02:07:13,755 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 02:07:13,755 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 02:07:13,755 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 02:07:13,755 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 02:07:14,212 INFO L124 PetriNetUnfolderBase]: 10277/15489 cut-off events. [2024-11-28 02:07:14,212 INFO L125 PetriNetUnfolderBase]: For 34125/38061 co-relation queries the response was YES. [2024-11-28 02:07:14,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52735 conditions, 15489 events. 10277/15489 cut-off events. For 34125/38061 co-relation queries the response was YES. Maximal size of possible extension queue 920. Compared 107640 event pairs, 593 based on Foata normal form. 617/15359 useless extension candidates. Maximal degree in co-relation 52705. Up to 4865 conditions per place. [2024-11-28 02:07:14,316 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 98 selfloop transitions, 14 changer transitions 6/153 dead transitions. [2024-11-28 02:07:14,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 153 transitions, 1086 flow [2024-11-28 02:07:14,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:07:14,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 02:07:14,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 229 transitions. [2024-11-28 02:07:14,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.693939393939394 [2024-11-28 02:07:14,318 INFO L175 Difference]: Start difference. First operand has 95 places, 88 transitions, 532 flow. Second operand 6 states and 229 transitions. [2024-11-28 02:07:14,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 153 transitions, 1086 flow [2024-11-28 02:07:14,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 153 transitions, 1069 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-11-28 02:07:14,349 INFO L231 Difference]: Finished difference. Result has 94 places, 88 transitions, 572 flow [2024-11-28 02:07:14,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=572, PETRI_PLACES=94, PETRI_TRANSITIONS=88} [2024-11-28 02:07:14,350 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 32 predicate places. [2024-11-28 02:07:14,350 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 88 transitions, 572 flow [2024-11-28 02:07:14,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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-28 02:07:14,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:07:14,350 INFO L206 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, 1] [2024-11-28 02:07:14,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 02:07:14,350 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-28 02:07:14,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:14,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1026574011, now seen corresponding path program 1 times [2024-11-28 02:07:14,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:14,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747253023] [2024-11-28 02:07:14,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:14,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:14,960 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-28 02:07:14,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:14,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747253023] [2024-11-28 02:07:14,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747253023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:14,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:14,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 02:07:14,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798946657] [2024-11-28 02:07:14,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:14,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 02:07:14,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:14,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 02:07:14,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:07:14,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 55 [2024-11-28 02:07:14,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 88 transitions, 572 flow. Second operand has 9 states, 9 states have (on average 24.333333333333332) internal successors, (219), 9 states have internal predecessors, (219), 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-28 02:07:14,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:07:14,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 55 [2024-11-28 02:07:14,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:07:18,383 INFO L124 PetriNetUnfolderBase]: 14232/23879 cut-off events. [2024-11-28 02:07:18,383 INFO L125 PetriNetUnfolderBase]: For 68131/73674 co-relation queries the response was YES. [2024-11-28 02:07:18,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84357 conditions, 23879 events. 14232/23879 cut-off events. For 68131/73674 co-relation queries the response was YES. Maximal size of possible extension queue 1446. Compared 198529 event pairs, 2094 based on Foata normal form. 623/22594 useless extension candidates. Maximal degree in co-relation 84327. Up to 8499 conditions per place. [2024-11-28 02:07:18,574 INFO L140 encePairwiseOnDemand]: 42/55 looper letters, 129 selfloop transitions, 68 changer transitions 33/264 dead transitions. [2024-11-28 02:07:18,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 264 transitions, 2093 flow [2024-11-28 02:07:18,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:07:18,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-28 02:07:18,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 493 transitions. [2024-11-28 02:07:18,577 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5975757575757575 [2024-11-28 02:07:18,577 INFO L175 Difference]: Start difference. First operand has 94 places, 88 transitions, 572 flow. Second operand 15 states and 493 transitions. [2024-11-28 02:07:18,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 264 transitions, 2093 flow [2024-11-28 02:07:19,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 264 transitions, 2054 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-11-28 02:07:19,032 INFO L231 Difference]: Finished difference. Result has 114 places, 145 transitions, 1317 flow [2024-11-28 02:07:19,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1317, PETRI_PLACES=114, PETRI_TRANSITIONS=145} [2024-11-28 02:07:19,033 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 52 predicate places. [2024-11-28 02:07:19,033 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 145 transitions, 1317 flow [2024-11-28 02:07:19,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 24.333333333333332) internal successors, (219), 9 states have internal predecessors, (219), 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-28 02:07:19,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:07:19,033 INFO L206 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, 1] [2024-11-28 02:07:19,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 02:07:19,034 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-28 02:07:19,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:19,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1726459289, now seen corresponding path program 2 times [2024-11-28 02:07:19,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:19,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855848030] [2024-11-28 02:07:19,035 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:07:19,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:19,055 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 02:07:19,055 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:07:19,443 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-28 02:07:19,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:19,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855848030] [2024-11-28 02:07:19,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855848030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:19,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:19,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 02:07:19,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783951383] [2024-11-28 02:07:19,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:19,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:07:19,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:19,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:07:19,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:07:19,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 55 [2024-11-28 02:07:19,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 145 transitions, 1317 flow. Second operand has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 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-28 02:07:19,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:07:19,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 55 [2024-11-28 02:07:19,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:07:23,686 INFO L124 PetriNetUnfolderBase]: 18118/30795 cut-off events. [2024-11-28 02:07:23,686 INFO L125 PetriNetUnfolderBase]: For 155572/160522 co-relation queries the response was YES. [2024-11-28 02:07:23,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124951 conditions, 30795 events. 18118/30795 cut-off events. For 155572/160522 co-relation queries the response was YES. Maximal size of possible extension queue 2009. Compared 274181 event pairs, 6425 based on Foata normal form. 747/28591 useless extension candidates. Maximal degree in co-relation 124911. Up to 12727 conditions per place. [2024-11-28 02:07:23,908 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 120 selfloop transitions, 31 changer transitions 56/241 dead transitions. [2024-11-28 02:07:23,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 241 transitions, 2488 flow [2024-11-28 02:07:23,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:07:23,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-28 02:07:23,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 281 transitions. [2024-11-28 02:07:23,910 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6386363636363637 [2024-11-28 02:07:23,910 INFO L175 Difference]: Start difference. First operand has 114 places, 145 transitions, 1317 flow. Second operand 8 states and 281 transitions. [2024-11-28 02:07:23,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 241 transitions, 2488 flow [2024-11-28 02:07:24,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 241 transitions, 2430 flow, removed 29 selfloop flow, removed 3 redundant places. [2024-11-28 02:07:24,703 INFO L231 Difference]: Finished difference. Result has 116 places, 131 transitions, 1199 flow [2024-11-28 02:07:24,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1275, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1199, PETRI_PLACES=116, PETRI_TRANSITIONS=131} [2024-11-28 02:07:24,704 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 54 predicate places. [2024-11-28 02:07:24,704 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 131 transitions, 1199 flow [2024-11-28 02:07:24,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 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-28 02:07:24,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:07:24,705 INFO L206 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, 1] [2024-11-28 02:07:24,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 02:07:24,705 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-28 02:07:24,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:24,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1565770763, now seen corresponding path program 3 times [2024-11-28 02:07:24,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:24,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726423923] [2024-11-28 02:07:24,706 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 02:07:24,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:24,744 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-28 02:07:24,744 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:07:24,925 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-28 02:07:24,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:24,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726423923] [2024-11-28 02:07:24,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726423923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:24,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:24,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:07:24,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526036908] [2024-11-28 02:07:24,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:24,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:07:24,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:24,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:07:24,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:07:24,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-11-28 02:07:24,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 131 transitions, 1199 flow. Second operand has 7 states, 7 states have (on average 26.714285714285715) internal successors, (187), 7 states have internal predecessors, (187), 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-28 02:07:24,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:07:24,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-11-28 02:07:24,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:07:27,966 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][167], [111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 63#true, 56#L865-4true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 200#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1) (= ~z$w_buff0~0 0)), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 194#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 67#true, 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 210#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 ~x~0) (not (= ~z$w_buff0~0 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 198#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff0~0 0)), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 206#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 226#(= ~x~0 1), Black: 202#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff0~0 ~x~0) (not (= ~z$w_buff0~0 0))), Black: 204#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (not (= ~x~0 0))), 256#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 26#L808true, 193#(not (= ~x~0 0)), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), 10#L757true, 38#P1EXITtrue, Black: 235#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), Black: 240#(and (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 238#(and (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 179#(< (mod ~main$tmp_guard0~0 256) 1), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-28 02:07:27,966 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-28 02:07:27,966 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 02:07:27,966 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 02:07:27,966 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 02:07:28,495 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L834-->L841: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_79 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_37 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_80 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_73 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~z$w_buff0_used~0_79 (ite (= (mod (ite .cse0 0 v_~z$w_buff0_used~0_80) 256) 0) 0 1)) (= v_~z~0_54 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_34 v_~z~0_55))) (= v_~z$r_buff0_thd4~0_36 (ite (= (mod (ite .cse2 0 v_~z$r_buff0_thd4~0_37) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_73) 256) 0) 0 1) v_~z$w_buff1_used~0_72) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_72 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_36 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) 256) 0) 0 1) v_~z$r_buff1_thd4~0_23)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_80, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_55} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][167], [111#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 63#true, 56#L865-4true, 65#true, 185#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 61#true, Black: 83#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 200#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1) (= ~z$w_buff0~0 0)), Black: 130#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 139#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~z$w_buff0~0 1)), Black: 194#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 67#true, 165#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), Black: 77#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 210#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 141#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 81#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 143#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z~0 0) (= ~b~0 1) (= ~z$w_buff0~0 1)), Black: 192#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 ~x~0) (not (= ~z$w_buff0~0 0))), Black: 198#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff0~0 0)), 58#P2EXITtrue, Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 206#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 226#(= ~x~0 1), Black: 202#(and (= ~z$r_buff0_thd4~0 1) (= ~z$w_buff0_used~0 1) (= ~z$w_buff1~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff0~0 ~x~0) (not (= ~z$w_buff0~0 0))), Black: 204#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (not (= ~x~0 0))), 256#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 120#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 193#(not (= ~x~0 0)), 29#L841true, Black: 93#(= ~__unbuffered_p3_EAX~0 0), Black: 160#(= ~b~0 1), 10#L757true, 38#P1EXITtrue, Black: 235#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), Black: 240#(and (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 113#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 238#(and (= ~__unbuffered_p0_EAX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 179#(< (mod ~main$tmp_guard0~0 256) 1), 127#true, Black: 124#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2024-11-28 02:07:28,495 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-28 02:07:28,495 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 02:07:28,495 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 02:07:28,495 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 02:07:30,156 INFO L124 PetriNetUnfolderBase]: 23266/34760 cut-off events. [2024-11-28 02:07:30,156 INFO L125 PetriNetUnfolderBase]: For 145014/156128 co-relation queries the response was YES. [2024-11-28 02:07:30,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136867 conditions, 34760 events. 23266/34760 cut-off events. For 145014/156128 co-relation queries the response was YES. Maximal size of possible extension queue 2414. Compared 268599 event pairs, 1500 based on Foata normal form. 1607/34610 useless extension candidates. Maximal degree in co-relation 136825. Up to 13056 conditions per place. [2024-11-28 02:07:30,390 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 67 selfloop transitions, 18 changer transitions 115/226 dead transitions. [2024-11-28 02:07:30,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 226 transitions, 2256 flow [2024-11-28 02:07:30,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 02:07:30,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-28 02:07:30,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 252 transitions. [2024-11-28 02:07:30,392 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6545454545454545 [2024-11-28 02:07:30,392 INFO L175 Difference]: Start difference. First operand has 116 places, 131 transitions, 1199 flow. Second operand 7 states and 252 transitions. [2024-11-28 02:07:30,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 226 transitions, 2256 flow [2024-11-28 02:07:31,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 226 transitions, 2126 flow, removed 31 selfloop flow, removed 8 redundant places. [2024-11-28 02:07:31,360 INFO L231 Difference]: Finished difference. Result has 114 places, 77 transitions, 574 flow [2024-11-28 02:07:31,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1081, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=574, PETRI_PLACES=114, PETRI_TRANSITIONS=77} [2024-11-28 02:07:31,361 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 52 predicate places. [2024-11-28 02:07:31,361 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 77 transitions, 574 flow [2024-11-28 02:07:31,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.714285714285715) internal successors, (187), 7 states have internal predecessors, (187), 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-28 02:07:31,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:07:31,361 INFO L206 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, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:31,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 02:07:31,361 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-28 02:07:31,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:31,362 INFO L85 PathProgramCache]: Analyzing trace with hash -121483124, now seen corresponding path program 1 times [2024-11-28 02:07:31,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:31,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264106079] [2024-11-28 02:07:31,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:31,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:31,747 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-28 02:07:31,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:31,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264106079] [2024-11-28 02:07:31,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264106079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:31,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:31,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:07:31,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784398163] [2024-11-28 02:07:31,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:31,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:07:31,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:31,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:07:31,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:07:31,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 55 [2024-11-28 02:07:31,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 77 transitions, 574 flow. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 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-28 02:07:31,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:07:31,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 55 [2024-11-28 02:07:31,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:07:33,514 INFO L124 PetriNetUnfolderBase]: 6761/12644 cut-off events. [2024-11-28 02:07:33,515 INFO L125 PetriNetUnfolderBase]: For 69524/71763 co-relation queries the response was YES. [2024-11-28 02:07:33,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48717 conditions, 12644 events. 6761/12644 cut-off events. For 69524/71763 co-relation queries the response was YES. Maximal size of possible extension queue 1031. Compared 113337 event pairs, 1606 based on Foata normal form. 140/11516 useless extension candidates. Maximal degree in co-relation 48679. Up to 4777 conditions per place. [2024-11-28 02:07:33,617 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 43 selfloop transitions, 8 changer transitions 37/123 dead transitions. [2024-11-28 02:07:33,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 123 transitions, 1046 flow [2024-11-28 02:07:33,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 02:07:33,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-28 02:07:33,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 219 transitions. [2024-11-28 02:07:33,618 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5688311688311688 [2024-11-28 02:07:33,619 INFO L175 Difference]: Start difference. First operand has 114 places, 77 transitions, 574 flow. Second operand 7 states and 219 transitions. [2024-11-28 02:07:33,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 123 transitions, 1046 flow [2024-11-28 02:07:33,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 123 transitions, 866 flow, removed 76 selfloop flow, removed 14 redundant places. [2024-11-28 02:07:33,949 INFO L231 Difference]: Finished difference. Result has 102 places, 69 transitions, 430 flow [2024-11-28 02:07:33,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=430, PETRI_PLACES=102, PETRI_TRANSITIONS=69} [2024-11-28 02:07:33,950 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 40 predicate places. [2024-11-28 02:07:33,950 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 69 transitions, 430 flow [2024-11-28 02:07:33,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 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-28 02:07:33,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:07:33,950 INFO L206 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, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:33,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 02:07:33,950 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-28 02:07:33,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:33,951 INFO L85 PathProgramCache]: Analyzing trace with hash -832466578, now seen corresponding path program 2 times [2024-11-28 02:07:33,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:33,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258621315] [2024-11-28 02:07:33,951 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:07:33,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:33,974 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 02:07:33,975 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:07:34,189 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-28 02:07:34,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:34,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258621315] [2024-11-28 02:07:34,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258621315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:34,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:34,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:07:34,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787456091] [2024-11-28 02:07:34,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:34,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:07:34,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:34,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:07:34,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:07:34,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2024-11-28 02:07:34,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 69 transitions, 430 flow. Second operand has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 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-28 02:07:34,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:07:34,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2024-11-28 02:07:34,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:07:35,174 INFO L124 PetriNetUnfolderBase]: 4096/8307 cut-off events. [2024-11-28 02:07:35,174 INFO L125 PetriNetUnfolderBase]: For 17828/18474 co-relation queries the response was YES. [2024-11-28 02:07:35,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25391 conditions, 8307 events. 4096/8307 cut-off events. For 17828/18474 co-relation queries the response was YES. Maximal size of possible extension queue 820. Compared 75862 event pairs, 680 based on Foata normal form. 76/7492 useless extension candidates. Maximal degree in co-relation 25359. Up to 2641 conditions per place. [2024-11-28 02:07:35,220 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 30 selfloop transitions, 2 changer transitions 29/98 dead transitions. [2024-11-28 02:07:35,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 98 transitions, 658 flow [2024-11-28 02:07:35,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:07:35,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 02:07:35,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 202 transitions. [2024-11-28 02:07:35,222 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6121212121212121 [2024-11-28 02:07:35,222 INFO L175 Difference]: Start difference. First operand has 102 places, 69 transitions, 430 flow. Second operand 6 states and 202 transitions. [2024-11-28 02:07:35,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 98 transitions, 658 flow [2024-11-28 02:07:35,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 98 transitions, 620 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-11-28 02:07:35,348 INFO L231 Difference]: Finished difference. Result has 97 places, 64 transitions, 365 flow [2024-11-28 02:07:35,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=365, PETRI_PLACES=97, PETRI_TRANSITIONS=64} [2024-11-28 02:07:35,349 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 35 predicate places. [2024-11-28 02:07:35,349 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 64 transitions, 365 flow [2024-11-28 02:07:35,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 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-28 02:07:35,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:07:35,350 INFO L206 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, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:35,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 02:07:35,350 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-28 02:07:35,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:35,350 INFO L85 PathProgramCache]: Analyzing trace with hash 2137071574, now seen corresponding path program 3 times [2024-11-28 02:07:35,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:35,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935270167] [2024-11-28 02:07:35,350 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 02:07:35,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:35,380 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-28 02:07:35,381 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:07:35,923 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-28 02:07:35,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:35,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935270167] [2024-11-28 02:07:35,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935270167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:35,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:35,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 02:07:35,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911675224] [2024-11-28 02:07:35,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:35,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:07:35,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:35,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:07:35,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:07:35,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2024-11-28 02:07:35,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 64 transitions, 365 flow. Second operand has 7 states, 7 states have (on average 29.428571428571427) internal successors, (206), 7 states have internal predecessors, (206), 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-28 02:07:35,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:07:35,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2024-11-28 02:07:35,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:07:36,885 INFO L124 PetriNetUnfolderBase]: 3428/6972 cut-off events. [2024-11-28 02:07:36,885 INFO L125 PetriNetUnfolderBase]: For 10688/11126 co-relation queries the response was YES. [2024-11-28 02:07:36,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19905 conditions, 6972 events. 3428/6972 cut-off events. For 10688/11126 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 62540 event pairs, 1220 based on Foata normal form. 45/6073 useless extension candidates. Maximal degree in co-relation 19876. Up to 2342 conditions per place. [2024-11-28 02:07:36,919 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 22 selfloop transitions, 3 changer transitions 28/92 dead transitions. [2024-11-28 02:07:36,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 92 transitions, 547 flow [2024-11-28 02:07:36,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:07:36,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-28 02:07:36,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 268 transitions. [2024-11-28 02:07:36,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6090909090909091 [2024-11-28 02:07:36,921 INFO L175 Difference]: Start difference. First operand has 97 places, 64 transitions, 365 flow. Second operand 8 states and 268 transitions. [2024-11-28 02:07:36,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 92 transitions, 547 flow [2024-11-28 02:07:37,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 92 transitions, 529 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-11-28 02:07:37,009 INFO L231 Difference]: Finished difference. Result has 98 places, 61 transitions, 342 flow [2024-11-28 02:07:37,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=342, PETRI_PLACES=98, PETRI_TRANSITIONS=61} [2024-11-28 02:07:37,009 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 36 predicate places. [2024-11-28 02:07:37,010 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 61 transitions, 342 flow [2024-11-28 02:07:37,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.428571428571427) internal successors, (206), 7 states have internal predecessors, (206), 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-28 02:07:37,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:07:37,010 INFO L206 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, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:37,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 02:07:37,010 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-28 02:07:37,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:37,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1153093984, now seen corresponding path program 4 times [2024-11-28 02:07:37,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:37,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887633112] [2024-11-28 02:07:37,011 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 02:07:37,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:37,064 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 02:07:37,064 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-28 02:07:37,064 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 02:07:37,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:07:37,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 02:07:37,158 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 02:07:37,159 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-28 02:07:37,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-28 02:07:37,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-28 02:07:37,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-28 02:07:37,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-28 02:07:37,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-28 02:07:37,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-28 02:07:37,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-28 02:07:37,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 02:07:37,162 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 3, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:37,297 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-28 02:07:37,297 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 02:07:37,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:07:37 BasicIcfg [2024-11-28 02:07:37,306 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 02:07:37,307 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 02:07:37,307 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 02:07:37,308 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 02:07:37,309 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:06:56" (3/4) ... [2024-11-28 02:07:37,310 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-28 02:07:37,311 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 02:07:37,313 INFO L158 Benchmark]: Toolchain (without parser) took 43048.75ms. Allocated memory was 117.4MB in the beginning and 10.3GB in the end (delta: 10.2GB). Free memory was 91.6MB in the beginning and 8.8GB in the end (delta: -8.7GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-11-28 02:07:37,313 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 167.8MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:07:37,314 INFO L158 Benchmark]: CACSL2BoogieTranslator took 779.61ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 68.6MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 02:07:37,314 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.04ms. Allocated memory is still 117.4MB. Free memory was 68.6MB in the beginning and 66.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:07:37,315 INFO L158 Benchmark]: Boogie Preprocessor took 89.55ms. Allocated memory is still 117.4MB. Free memory was 66.4MB in the beginning and 63.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:07:37,315 INFO L158 Benchmark]: RCFGBuilder took 990.94ms. Allocated memory is still 117.4MB. Free memory was 63.2MB in the beginning and 69.2MB in the end (delta: -6.1MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. [2024-11-28 02:07:37,316 INFO L158 Benchmark]: TraceAbstraction took 41103.82ms. Allocated memory was 117.4MB in the beginning and 10.3GB in the end (delta: 10.2GB). Free memory was 68.7MB in the beginning and 8.8GB in the end (delta: -8.7GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-11-28 02:07:37,316 INFO L158 Benchmark]: Witness Printer took 3.97ms. Allocated memory is still 10.3GB. Free memory was 8.8GB in the beginning and 8.8GB in the end (delta: 115.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:07:37,318 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.54ms. Allocated memory is still 167.8MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 779.61ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 68.6MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.04ms. Allocated memory is still 117.4MB. Free memory was 68.6MB in the beginning and 66.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 89.55ms. Allocated memory is still 117.4MB. Free memory was 66.4MB in the beginning and 63.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 990.94ms. Allocated memory is still 117.4MB. Free memory was 63.2MB in the beginning and 69.2MB in the end (delta: -6.1MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. * TraceAbstraction took 41103.82ms. Allocated memory was 117.4MB in the beginning and 10.3GB in the end (delta: 10.2GB). Free memory was 68.7MB in the beginning and 8.8GB in the end (delta: -8.7GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 3.97ms. Allocated memory is still 10.3GB. Free memory was 8.8GB in the beginning and 8.8GB in the end (delta: 115.0kB). 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L858] 0 pthread_t t949; [L859] FCALL, FORK 0 pthread_create(&t949, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t949=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t950; [L861] FCALL, FORK 0 pthread_create(&t950, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t949=-3, t950=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L862] 0 pthread_t t951; [L863] FCALL, FORK 0 pthread_create(&t951, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t949=-3, t950=-2, t951=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L864] 0 pthread_t t952; [L865] FCALL, FORK 0 pthread_create(&t952, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t949=-3, t950=-2, t951=-1, t952=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L814] 4 z$w_buff1 = z$w_buff0 [L815] 4 z$w_buff0 = 1 [L816] 4 z$w_buff1_used = z$w_buff0_used [L817] 4 z$w_buff0_used = (_Bool)1 [L818] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L818] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L819] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L820] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L821] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L822] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L823] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L824] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L827] 4 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L830] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L833] 4 __unbuffered_p3_EBX = b VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 b = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L786] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L789] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 3 z$flush_delayed = weak$$choice2 [L792] 3 z$mem_tmp = z [L793] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L794] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L795] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L796] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L797] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L799] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 __unbuffered_p2_EAX = z [L801] 3 z = z$flush_delayed ? z$mem_tmp : z [L802] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L836] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L837] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L838] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L839] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L840] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L764] 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=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L807] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t949=-3, t950=-2, t951=-1, t952=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L872] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L873] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L874] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L875] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t949=-3, t950=-2, t951=-1, t952=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t949=-3, t950=-2, t951=-1, t952=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L880] 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}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix036_pso.opt_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 859]: 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: 865]: 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: 863]: 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: 861]: 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 9 procedures, 89 locations, 8 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: 40.8s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 34.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 932 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 885 mSDsluCounter, 386 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 302 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2498 IncrementalHoareTripleChecker+Invalid, 2546 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 84 mSDtfsCounter, 2498 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1317occurred in iteration=10, InterpolantAutomatonStates: 106, 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.5s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 454 NumberOfCodeBlocks, 454 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 400 ConstructedInterpolants, 0 QuantifiedInterpolants, 2512 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-28 02:07:37,342 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix036_pso.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB --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 eb5b5f76ea992c17ebcf5a0e506a820a4d574c4d0723905971e2f5f6725ae203 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:07:40,071 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:07:40,183 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-28 02:07:40,188 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:07:40,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:07:40,212 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:07:40,213 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:07:40,213 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:07:40,213 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:07:40,214 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:07:40,214 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:07:40,214 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:07:40,214 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:07:40,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:07:40,215 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:07:40,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:07:40,215 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:07:40,215 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:07:40,215 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:07:40,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:07:40,216 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 02:07:40,216 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 02:07:40,216 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 02:07:40,216 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:07:40,216 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 02:07:40,216 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 02:07:40,216 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 02:07:40,216 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 02:07:40,217 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:07:40,217 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:07:40,217 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:07:40,217 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:07:40,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:07:40,217 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:07:40,217 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:07:40,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:07:40,218 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:07:40,218 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:07:40,218 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:07:40,218 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:07:40,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:07:40,218 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:07:40,218 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:07:40,218 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 02:07:40,218 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 02:07:40,218 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:07:40,218 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:07:40,218 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:07:40,219 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:07:40,219 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_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB 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 -> eb5b5f76ea992c17ebcf5a0e506a820a4d574c4d0723905971e2f5f6725ae203 [2024-11-28 02:07:40,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:07:40,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:07:40,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:07:40,586 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:07:40,586 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:07:40,587 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-wmm/mix036_pso.opt_tso.opt.i [2024-11-28 02:07:43,474 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/data/cece88dc2/43d476548820452ea4111ea0ab5ff9d7/FLAGac5d63dd9 [2024-11-28 02:07:43,824 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:07:43,824 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/sv-benchmarks/c/pthread-wmm/mix036_pso.opt_tso.opt.i [2024-11-28 02:07:43,842 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/data/cece88dc2/43d476548820452ea4111ea0ab5ff9d7/FLAGac5d63dd9 [2024-11-28 02:07:43,864 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/data/cece88dc2/43d476548820452ea4111ea0ab5ff9d7 [2024-11-28 02:07:43,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:07:43,870 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:07:43,871 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:07:43,873 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:07:43,877 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:07:43,878 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:07:43" (1/1) ... [2024-11-28 02:07:43,879 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8d4e70c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:43, skipping insertion in model container [2024-11-28 02:07:43,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:07:43" (1/1) ... [2024-11-28 02:07:43,926 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:07:44,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:07:44,454 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:07:44,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:07:44,584 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:07:44,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:44 WrapperNode [2024-11-28 02:07:44,585 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:07:44,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:07:44,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:07:44,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:07:44,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:44" (1/1) ... [2024-11-28 02:07:44,618 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:44" (1/1) ... [2024-11-28 02:07:44,650 INFO L138 Inliner]: procedures = 177, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 141 [2024-11-28 02:07:44,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:07:44,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:07:44,655 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:07:44,655 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:07:44,663 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:44" (1/1) ... [2024-11-28 02:07:44,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:44" (1/1) ... [2024-11-28 02:07:44,667 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:44" (1/1) ... [2024-11-28 02:07:44,696 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-28 02:07:44,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:44" (1/1) ... [2024-11-28 02:07:44,697 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:44" (1/1) ... [2024-11-28 02:07:44,710 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:44" (1/1) ... [2024-11-28 02:07:44,715 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:44" (1/1) ... [2024-11-28 02:07:44,718 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:44" (1/1) ... [2024-11-28 02:07:44,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:44" (1/1) ... [2024-11-28 02:07:44,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:44" (1/1) ... [2024-11-28 02:07:44,735 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:07:44,736 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:07:44,736 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:07:44,736 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:07:44,737 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:44" (1/1) ... [2024-11-28 02:07:44,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:07:44,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:07:44,777 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:07:44,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:07:44,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-28 02:07:44,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:07:44,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 02:07:44,812 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-28 02:07:44,812 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-28 02:07:44,812 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-28 02:07:44,813 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-28 02:07:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-28 02:07:44,813 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-28 02:07:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-28 02:07:44,813 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-28 02:07:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-28 02:07:44,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:07:44,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:07:44,815 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 02:07:44,988 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:07:44,990 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:07:45,495 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 02:07:45,495 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:07:45,859 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:07:45,859 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-28 02:07:45,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:07:45 BoogieIcfgContainer [2024-11-28 02:07:45,860 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:07:45,863 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:07:45,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:07:45,867 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:07:45,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:07:43" (1/3) ... [2024-11-28 02:07:45,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3709c7de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:07:45, skipping insertion in model container [2024-11-28 02:07:45,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:07:44" (2/3) ... [2024-11-28 02:07:45,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3709c7de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:07:45, skipping insertion in model container [2024-11-28 02:07:45,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:07:45" (3/3) ... [2024-11-28 02:07:45,871 INFO L128 eAbstractionObserver]: Analyzing ICFG mix036_pso.opt_tso.opt.i [2024-11-28 02:07:45,888 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:07:45,889 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix036_pso.opt_tso.opt.i that has 5 procedures, 54 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-28 02:07:45,890 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 02:07:45,991 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-28 02:07:46,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 126 flow [2024-11-28 02:07:46,086 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2024-11-28 02:07:46,089 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 02:07:46,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 110 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2024-11-28 02:07:46,094 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 126 flow [2024-11-28 02:07:46,099 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 114 flow [2024-11-28 02:07:46,109 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:07:46,120 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;@209ab231, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:07:46,124 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-28 02:07:46,144 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 02:07:46,144 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-11-28 02:07:46,144 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 02:07:46,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:07:46,145 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:46,145 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-28 02:07:46,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:46,153 INFO L85 PathProgramCache]: Analyzing trace with hash -236054960, now seen corresponding path program 1 times [2024-11-28 02:07:46,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:07:46,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1024564663] [2024-11-28 02:07:46,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:46,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:07:46,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:07:46,172 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:07:46,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 02:07:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:46,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 02:07:46,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:07:46,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-28 02:07:46,415 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:07:46,416 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:07:46,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024564663] [2024-11-28 02:07:46,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024564663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:46,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:46,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 02:07:46,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139825276] [2024-11-28 02:07:46,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:46,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:07:46,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:07:46,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:07:46,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:46,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2024-11-28 02:07:46,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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-28 02:07:46,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:07:46,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2024-11-28 02:07:46,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:07:47,116 INFO L124 PetriNetUnfolderBase]: 931/1851 cut-off events. [2024-11-28 02:07:47,117 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 02:07:47,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3247 conditions, 1851 events. 931/1851 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 13952 event pairs, 199 based on Foata normal form. 96/1907 useless extension candidates. Maximal degree in co-relation 3235. Up to 1021 conditions per place. [2024-11-28 02:07:47,144 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 29 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2024-11-28 02:07:47,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 58 transitions, 194 flow [2024-11-28 02:07:47,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:07:47,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 02:07:47,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2024-11-28 02:07:47,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7575757575757576 [2024-11-28 02:07:47,161 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 125 transitions. [2024-11-28 02:07:47,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 58 transitions, 194 flow [2024-11-28 02:07:47,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 58 transitions, 190 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-28 02:07:47,173 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2024-11-28 02:07:47,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-11-28 02:07:47,183 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2024-11-28 02:07:47,183 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2024-11-28 02:07:47,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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-28 02:07:47,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:07:47,184 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:47,196 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 02:07:47,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:07:47,385 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-28 02:07:47,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:47,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1916275610, now seen corresponding path program 1 times [2024-11-28 02:07:47,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:07:47,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [608673988] [2024-11-28 02:07:47,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:47,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:07:47,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:07:47,392 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:07:47,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 02:07:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:47,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-28 02:07:47,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:07:47,586 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-28 02:07:47,586 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:07:47,586 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:07:47,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608673988] [2024-11-28 02:07:47,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608673988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:47,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:47,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 02:07:47,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721731203] [2024-11-28 02:07:47,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:47,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:07:47,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:07:47,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:07:47,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:07:47,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2024-11-28 02:07:47,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-28 02:07:47,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:07:47,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2024-11-28 02:07:47,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:07:47,949 INFO L124 PetriNetUnfolderBase]: 815/1519 cut-off events. [2024-11-28 02:07:47,949 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2024-11-28 02:07:47,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2833 conditions, 1519 events. 815/1519 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11030 event pairs, 815 based on Foata normal form. 48/1491 useless extension candidates. Maximal degree in co-relation 2823. Up to 1188 conditions per place. [2024-11-28 02:07:47,961 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 19 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2024-11-28 02:07:47,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 144 flow [2024-11-28 02:07:47,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:07:47,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 02:07:47,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-11-28 02:07:47,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2024-11-28 02:07:47,963 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 106 transitions. [2024-11-28 02:07:47,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 144 flow [2024-11-28 02:07:47,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 02:07:47,965 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 98 flow [2024-11-28 02:07:47,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2024-11-28 02:07:47,966 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2024-11-28 02:07:47,966 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 98 flow [2024-11-28 02:07:47,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-28 02:07:47,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:07:47,967 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:47,977 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-28 02:07:48,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:07:48,168 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-28 02:07:48,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:48,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1916276833, now seen corresponding path program 1 times [2024-11-28 02:07:48,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:07:48,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1303308955] [2024-11-28 02:07:48,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:48,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:07:48,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:07:48,173 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:07:48,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 02:07:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:48,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 02:07:48,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:07:48,344 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-28 02:07:48,346 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:07:48,346 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:07:48,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303308955] [2024-11-28 02:07:48,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303308955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:48,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:48,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:07:48,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429826991] [2024-11-28 02:07:48,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:48,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:07:48,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:07:48,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:07:48,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:07:48,368 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-11-28 02:07:48,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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-28 02:07:48,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:07:48,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-11-28 02:07:48,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:07:49,355 INFO L124 PetriNetUnfolderBase]: 3857/6079 cut-off events. [2024-11-28 02:07:49,355 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 02:07:49,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11545 conditions, 6079 events. 3857/6079 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 42483 event pairs, 536 based on Foata normal form. 180/6242 useless extension candidates. Maximal degree in co-relation 11539. Up to 3346 conditions per place. [2024-11-28 02:07:49,391 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 44 selfloop transitions, 6 changer transitions 1/70 dead transitions. [2024-11-28 02:07:49,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 70 transitions, 258 flow [2024-11-28 02:07:49,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:07:49,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 02:07:49,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2024-11-28 02:07:49,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6772727272727272 [2024-11-28 02:07:49,394 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 98 flow. Second operand 4 states and 149 transitions. [2024-11-28 02:07:49,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 70 transitions, 258 flow [2024-11-28 02:07:49,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 70 transitions, 257 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 02:07:49,396 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 139 flow [2024-11-28 02:07:49,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2024-11-28 02:07:49,397 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2024-11-28 02:07:49,397 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 139 flow [2024-11-28 02:07:49,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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-28 02:07:49,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:07:49,397 INFO L206 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-28 02:07:49,406 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 02:07:49,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:07:49,601 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-28 02:07:49,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:49,602 INFO L85 PathProgramCache]: Analyzing trace with hash 431396840, now seen corresponding path program 1 times [2024-11-28 02:07:49,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:07:49,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [257704186] [2024-11-28 02:07:49,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:49,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:07:49,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:07:49,605 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:07:49,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 02:07:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:49,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 02:07:49,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:07:49,761 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-28 02:07:49,761 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:07:49,761 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:07:49,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257704186] [2024-11-28 02:07:49,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257704186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:49,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:49,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:07:49,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643769167] [2024-11-28 02:07:49,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:49,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:07:49,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:07:49,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:07:49,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:07:49,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-11-28 02:07:49,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-28 02:07:49,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:07:49,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-11-28 02:07:49,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:07:50,759 INFO L124 PetriNetUnfolderBase]: 3272/5182 cut-off events. [2024-11-28 02:07:50,760 INFO L125 PetriNetUnfolderBase]: For 1395/1395 co-relation queries the response was YES. [2024-11-28 02:07:50,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11814 conditions, 5182 events. 3272/5182 cut-off events. For 1395/1395 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 34850 event pairs, 192 based on Foata normal form. 174/5341 useless extension candidates. Maximal degree in co-relation 11805. Up to 2581 conditions per place. [2024-11-28 02:07:50,794 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 56 selfloop transitions, 10 changer transitions 1/86 dead transitions. [2024-11-28 02:07:50,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 86 transitions, 378 flow [2024-11-28 02:07:50,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:07:50,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 02:07:50,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 189 transitions. [2024-11-28 02:07:50,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6872727272727273 [2024-11-28 02:07:50,799 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 139 flow. Second operand 5 states and 189 transitions. [2024-11-28 02:07:50,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 86 transitions, 378 flow [2024-11-28 02:07:50,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 86 transitions, 367 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-28 02:07:50,803 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 191 flow [2024-11-28 02:07:50,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2024-11-28 02:07:50,805 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 1 predicate places. [2024-11-28 02:07:50,805 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 191 flow [2024-11-28 02:07:50,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-28 02:07:50,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:07:50,806 INFO L206 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] [2024-11-28 02:07:50,815 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 02:07:51,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:07:51,007 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-28 02:07:51,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:51,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1593206073, now seen corresponding path program 1 times [2024-11-28 02:07:51,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:07:51,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1644252704] [2024-11-28 02:07:51,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:51,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:07:51,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:07:51,012 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:07:51,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 02:07:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:51,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 02:07:51,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:07:51,194 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-28 02:07:51,194 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:07:51,195 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:07:51,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644252704] [2024-11-28 02:07:51,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644252704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:51,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:51,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:07:51,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338793958] [2024-11-28 02:07:51,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:51,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:07:51,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:07:51,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:07:51,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:07:51,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-11-28 02:07:51,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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-28 02:07:51,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:07:51,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-11-28 02:07:51,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:07:51,845 INFO L124 PetriNetUnfolderBase]: 2201/3465 cut-off events. [2024-11-28 02:07:51,845 INFO L125 PetriNetUnfolderBase]: For 2772/2772 co-relation queries the response was YES. [2024-11-28 02:07:51,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8968 conditions, 3465 events. 2201/3465 cut-off events. For 2772/2772 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 20519 event pairs, 69 based on Foata normal form. 140/3590 useless extension candidates. Maximal degree in co-relation 8957. Up to 1221 conditions per place. [2024-11-28 02:07:51,871 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 66 selfloop transitions, 14 changer transitions 1/100 dead transitions. [2024-11-28 02:07:51,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 100 transitions, 497 flow [2024-11-28 02:07:51,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:07:51,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 02:07:51,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 227 transitions. [2024-11-28 02:07:51,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6878787878787879 [2024-11-28 02:07:51,873 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 191 flow. Second operand 6 states and 227 transitions. [2024-11-28 02:07:51,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 100 transitions, 497 flow [2024-11-28 02:07:51,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 100 transitions, 467 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-28 02:07:51,885 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 241 flow [2024-11-28 02:07:51,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=241, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2024-11-28 02:07:51,887 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2024-11-28 02:07:51,888 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 241 flow [2024-11-28 02:07:51,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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-28 02:07:51,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:07:51,888 INFO L206 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] [2024-11-28 02:07:51,897 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 02:07:52,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:07:52,089 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-28 02:07:52,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:52,090 INFO L85 PathProgramCache]: Analyzing trace with hash 161544374, now seen corresponding path program 1 times [2024-11-28 02:07:52,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:07:52,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1643200709] [2024-11-28 02:07:52,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:52,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:07:52,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:07:52,094 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:07:52,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 02:07:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:52,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 02:07:52,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:07:52,289 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-28 02:07:52,289 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:07:52,290 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:07:52,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643200709] [2024-11-28 02:07:52,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643200709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:52,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:52,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:07:52,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082964460] [2024-11-28 02:07:52,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:52,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:07:52,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:07:52,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:07:52,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:07:52,302 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-11-28 02:07:52,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 241 flow. Second operand has 7 states, 7 states have (on average 26.571428571428573) internal successors, (186), 7 states have internal predecessors, (186), 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-28 02:07:52,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:07:52,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-11-28 02:07:52,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:07:52,859 INFO L124 PetriNetUnfolderBase]: 1353/2045 cut-off events. [2024-11-28 02:07:52,860 INFO L125 PetriNetUnfolderBase]: For 3118/3118 co-relation queries the response was YES. [2024-11-28 02:07:52,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6057 conditions, 2045 events. 1353/2045 cut-off events. For 3118/3118 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9989 event pairs, 39 based on Foata normal form. 72/2102 useless extension candidates. Maximal degree in co-relation 6045. Up to 668 conditions per place. [2024-11-28 02:07:52,875 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 60 selfloop transitions, 18 changer transitions 1/98 dead transitions. [2024-11-28 02:07:52,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 98 transitions, 499 flow [2024-11-28 02:07:52,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 02:07:52,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-28 02:07:52,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 249 transitions. [2024-11-28 02:07:52,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6467532467532467 [2024-11-28 02:07:52,876 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 241 flow. Second operand 7 states and 249 transitions. [2024-11-28 02:07:52,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 98 transitions, 499 flow [2024-11-28 02:07:52,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 98 transitions, 453 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-28 02:07:52,895 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 251 flow [2024-11-28 02:07:52,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=251, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2024-11-28 02:07:52,895 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 7 predicate places. [2024-11-28 02:07:52,896 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 251 flow [2024-11-28 02:07:52,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.571428571428573) internal successors, (186), 7 states have internal predecessors, (186), 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-28 02:07:52,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:07:52,896 INFO L206 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, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:52,905 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-28 02:07:53,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:07:53,100 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-28 02:07:53,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:53,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1148215702, now seen corresponding path program 1 times [2024-11-28 02:07:53,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:07:53,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1041808167] [2024-11-28 02:07:53,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:53,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:07:53,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:07:53,103 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:07:53,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 02:07:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:53,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-28 02:07:53,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:07:53,530 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-28 02:07:53,530 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:07:53,530 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:07:53,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041808167] [2024-11-28 02:07:53,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041808167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:53,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:53,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 02:07:53,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843026782] [2024-11-28 02:07:53,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:53,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 02:07:53,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:07:53,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 02:07:53,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:07:53,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-11-28 02:07:53,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 251 flow. Second operand has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 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-28 02:07:53,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:07:53,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-11-28 02:07:53,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:07:54,472 INFO L124 PetriNetUnfolderBase]: 3359/4951 cut-off events. [2024-11-28 02:07:54,472 INFO L125 PetriNetUnfolderBase]: For 5800/5816 co-relation queries the response was YES. [2024-11-28 02:07:54,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14102 conditions, 4951 events. 3359/4951 cut-off events. For 5800/5816 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 27004 event pairs, 857 based on Foata normal form. 32/4960 useless extension candidates. Maximal degree in co-relation 14089. Up to 2881 conditions per place. [2024-11-28 02:07:54,498 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 54 selfloop transitions, 9 changer transitions 54/133 dead transitions. [2024-11-28 02:07:54,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 133 transitions, 801 flow [2024-11-28 02:07:54,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 02:07:54,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-28 02:07:54,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 291 transitions. [2024-11-28 02:07:54,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5878787878787879 [2024-11-28 02:07:54,501 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 251 flow. Second operand 9 states and 291 transitions. [2024-11-28 02:07:54,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 133 transitions, 801 flow [2024-11-28 02:07:54,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 133 transitions, 600 flow, removed 34 selfloop flow, removed 10 redundant places. [2024-11-28 02:07:54,566 INFO L231 Difference]: Finished difference. Result has 73 places, 60 transitions, 209 flow [2024-11-28 02:07:54,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=209, PETRI_PLACES=73, PETRI_TRANSITIONS=60} [2024-11-28 02:07:54,567 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 11 predicate places. [2024-11-28 02:07:54,571 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 60 transitions, 209 flow [2024-11-28 02:07:54,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 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-28 02:07:54,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:07:54,571 INFO L206 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, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:54,582 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 02:07:54,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:07:54,772 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-28 02:07:54,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:54,773 INFO L85 PathProgramCache]: Analyzing trace with hash 313703220, now seen corresponding path program 2 times [2024-11-28 02:07:54,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:07:54,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [835048507] [2024-11-28 02:07:54,774 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:07:54,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:07:54,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:07:54,776 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:07:54,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 02:07:54,888 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 02:07:54,889 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:07:54,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-28 02:07:54,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:07:55,137 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-28 02:07:55,138 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:07:55,138 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:07:55,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835048507] [2024-11-28 02:07:55,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835048507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:55,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:55,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 02:07:55,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192825900] [2024-11-28 02:07:55,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:55,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 02:07:55,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:07:55,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 02:07:55,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:07:55,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-11-28 02:07:55,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 60 transitions, 209 flow. Second operand has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 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-28 02:07:55,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:07:55,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-11-28 02:07:55,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:07:56,084 INFO L124 PetriNetUnfolderBase]: 3775/5612 cut-off events. [2024-11-28 02:07:56,085 INFO L125 PetriNetUnfolderBase]: For 1425/1517 co-relation queries the response was YES. [2024-11-28 02:07:56,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13332 conditions, 5612 events. 3775/5612 cut-off events. For 1425/1517 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 31570 event pairs, 971 based on Foata normal form. 46/5609 useless extension candidates. Maximal degree in co-relation 13318. Up to 3553 conditions per place. [2024-11-28 02:07:56,136 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 56 selfloop transitions, 14 changer transitions 47/134 dead transitions. [2024-11-28 02:07:56,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 134 transitions, 694 flow [2024-11-28 02:07:56,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 02:07:56,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-28 02:07:56,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 283 transitions. [2024-11-28 02:07:56,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5717171717171717 [2024-11-28 02:07:56,139 INFO L175 Difference]: Start difference. First operand has 73 places, 60 transitions, 209 flow. Second operand 9 states and 283 transitions. [2024-11-28 02:07:56,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 134 transitions, 694 flow [2024-11-28 02:07:56,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 134 transitions, 640 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-11-28 02:07:56,145 INFO L231 Difference]: Finished difference. Result has 76 places, 66 transitions, 267 flow [2024-11-28 02:07:56,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=267, PETRI_PLACES=76, PETRI_TRANSITIONS=66} [2024-11-28 02:07:56,146 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 14 predicate places. [2024-11-28 02:07:56,146 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 66 transitions, 267 flow [2024-11-28 02:07:56,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 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-28 02:07:56,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:07:56,146 INFO L206 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, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:56,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-28 02:07:56,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:07:56,347 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-28 02:07:56,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:56,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1632638172, now seen corresponding path program 3 times [2024-11-28 02:07:56,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:07:56,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [335885172] [2024-11-28 02:07:56,348 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 02:07:56,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:07:56,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:07:56,353 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:07:56,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 02:07:56,474 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-28 02:07:56,474 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:07:56,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-28 02:07:56,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:07:56,666 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-28 02:07:56,667 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:07:56,667 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:07:56,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335885172] [2024-11-28 02:07:56,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335885172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:56,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:56,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 02:07:56,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638423206] [2024-11-28 02:07:56,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:56,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 02:07:56,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:07:56,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 02:07:56,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:07:56,694 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-11-28 02:07:56,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 66 transitions, 267 flow. Second operand has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 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-28 02:07:56,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:07:56,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-11-28 02:07:56,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:07:57,430 INFO L124 PetriNetUnfolderBase]: 5126/7758 cut-off events. [2024-11-28 02:07:57,430 INFO L125 PetriNetUnfolderBase]: For 2254/2371 co-relation queries the response was YES. [2024-11-28 02:07:57,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19003 conditions, 7758 events. 5126/7758 cut-off events. For 2254/2371 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 45838 event pairs, 1281 based on Foata normal form. 29/7618 useless extension candidates. Maximal degree in co-relation 18987. Up to 4512 conditions per place. [2024-11-28 02:07:57,481 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 51 selfloop transitions, 22 changer transitions 53/144 dead transitions. [2024-11-28 02:07:57,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 144 transitions, 808 flow [2024-11-28 02:07:57,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 02:07:57,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-28 02:07:57,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 284 transitions. [2024-11-28 02:07:57,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5737373737373738 [2024-11-28 02:07:57,483 INFO L175 Difference]: Start difference. First operand has 76 places, 66 transitions, 267 flow. Second operand 9 states and 284 transitions. [2024-11-28 02:07:57,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 144 transitions, 808 flow [2024-11-28 02:07:57,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 144 transitions, 766 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-11-28 02:07:57,488 INFO L231 Difference]: Finished difference. Result has 80 places, 75 transitions, 383 flow [2024-11-28 02:07:57,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=383, PETRI_PLACES=80, PETRI_TRANSITIONS=75} [2024-11-28 02:07:57,489 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 18 predicate places. [2024-11-28 02:07:57,489 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 75 transitions, 383 flow [2024-11-28 02:07:57,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 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-28 02:07:57,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:07:57,489 INFO L206 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, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:57,498 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 02:07:57,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:07:57,693 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-28 02:07:57,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:57,695 INFO L85 PathProgramCache]: Analyzing trace with hash -666201534, now seen corresponding path program 4 times [2024-11-28 02:07:57,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:07:57,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [419320725] [2024-11-28 02:07:57,696 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 02:07:57,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:07:57,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:07:57,700 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:07:57,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 02:07:57,806 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 02:07:57,806 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:07:57,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-28 02:07:57,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:07:58,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-28 02:07:58,055 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:07:58,055 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:07:58,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419320725] [2024-11-28 02:07:58,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419320725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:58,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:58,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 02:07:58,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637786398] [2024-11-28 02:07:58,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:58,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 02:07:58,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:07:58,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 02:07:58,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-28 02:07:58,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2024-11-28 02:07:58,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 75 transitions, 383 flow. Second operand has 8 states, 8 states have (on average 29.25) internal successors, (234), 8 states have internal predecessors, (234), 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-28 02:07:58,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:07:58,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2024-11-28 02:07:58,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:07:58,755 INFO L124 PetriNetUnfolderBase]: 2600/4983 cut-off events. [2024-11-28 02:07:58,755 INFO L125 PetriNetUnfolderBase]: For 571/585 co-relation queries the response was YES. [2024-11-28 02:07:58,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10326 conditions, 4983 events. 2600/4983 cut-off events. For 571/585 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 38347 event pairs, 924 based on Foata normal form. 17/4566 useless extension candidates. Maximal degree in co-relation 10307. Up to 1479 conditions per place. [2024-11-28 02:07:58,784 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 37 selfloop transitions, 5 changer transitions 21/116 dead transitions. [2024-11-28 02:07:58,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 116 transitions, 601 flow [2024-11-28 02:07:58,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 02:07:58,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-28 02:07:58,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 307 transitions. [2024-11-28 02:07:58,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6202020202020202 [2024-11-28 02:07:58,786 INFO L175 Difference]: Start difference. First operand has 80 places, 75 transitions, 383 flow. Second operand 9 states and 307 transitions. [2024-11-28 02:07:58,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 116 transitions, 601 flow [2024-11-28 02:07:58,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 116 transitions, 564 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-11-28 02:07:58,791 INFO L231 Difference]: Finished difference. Result has 85 places, 79 transitions, 395 flow [2024-11-28 02:07:58,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=395, PETRI_PLACES=85, PETRI_TRANSITIONS=79} [2024-11-28 02:07:58,792 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 23 predicate places. [2024-11-28 02:07:58,792 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 79 transitions, 395 flow [2024-11-28 02:07:58,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.25) internal successors, (234), 8 states have internal predecessors, (234), 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-28 02:07:58,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:07:58,793 INFO L206 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, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:58,802 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-28 02:07:58,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:07:58,994 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-28 02:07:58,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:58,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1357024226, now seen corresponding path program 5 times [2024-11-28 02:07:58,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:07:58,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [90036754] [2024-11-28 02:07:58,995 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 02:07:58,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:07:58,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:07:58,997 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:07:59,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 02:07:59,105 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 02:07:59,106 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:07:59,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-28 02:07:59,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:07:59,309 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-28 02:07:59,309 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:07:59,309 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:07:59,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90036754] [2024-11-28 02:07:59,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90036754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:59,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:59,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 02:07:59,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417315671] [2024-11-28 02:07:59,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:59,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 02:07:59,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:07:59,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 02:07:59,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:07:59,348 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-11-28 02:07:59,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 79 transitions, 395 flow. Second operand has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 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-28 02:07:59,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:07:59,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-11-28 02:07:59,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:08:00,437 INFO L124 PetriNetUnfolderBase]: 7905/12553 cut-off events. [2024-11-28 02:08:00,437 INFO L125 PetriNetUnfolderBase]: For 7531/7896 co-relation queries the response was YES. [2024-11-28 02:08:00,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32055 conditions, 12553 events. 7905/12553 cut-off events. For 7531/7896 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 87013 event pairs, 1067 based on Foata normal form. 51/12414 useless extension candidates. Maximal degree in co-relation 32033. Up to 6217 conditions per place. [2024-11-28 02:08:00,531 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 79 selfloop transitions, 20 changer transitions 39/156 dead transitions. [2024-11-28 02:08:00,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 156 transitions, 941 flow [2024-11-28 02:08:00,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 02:08:00,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-28 02:08:00,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 285 transitions. [2024-11-28 02:08:00,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2024-11-28 02:08:00,534 INFO L175 Difference]: Start difference. First operand has 85 places, 79 transitions, 395 flow. Second operand 9 states and 285 transitions. [2024-11-28 02:08:00,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 156 transitions, 941 flow [2024-11-28 02:08:00,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 156 transitions, 927 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-11-28 02:08:00,551 INFO L231 Difference]: Finished difference. Result has 90 places, 75 transitions, 414 flow [2024-11-28 02:08:00,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=414, PETRI_PLACES=90, PETRI_TRANSITIONS=75} [2024-11-28 02:08:00,552 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 28 predicate places. [2024-11-28 02:08:00,554 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 75 transitions, 414 flow [2024-11-28 02:08:00,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 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-28 02:08:00,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:08:00,555 INFO L206 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, 1, 1, 1, 1, 1, 1] [2024-11-28 02:08:00,564 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-28 02:08:00,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:08:00,756 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-28 02:08:00,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:00,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1557880334, now seen corresponding path program 6 times [2024-11-28 02:08:00,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:08:00,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1933143828] [2024-11-28 02:08:00,757 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-28 02:08:00,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:08:00,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:08:00,759 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:08:00,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-28 02:08:00,859 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-28 02:08:00,859 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:08:00,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-28 02:08:00,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:08:01,048 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-28 02:08:01,048 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:08:01,048 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:08:01,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933143828] [2024-11-28 02:08:01,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933143828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:08:01,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:08:01,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 02:08:01,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957848345] [2024-11-28 02:08:01,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:08:01,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 02:08:01,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:08:01,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 02:08:01,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:08:01,097 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-11-28 02:08:01,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 75 transitions, 414 flow. Second operand has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 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-28 02:08:01,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:08:01,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-11-28 02:08:01,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:08:02,422 INFO L124 PetriNetUnfolderBase]: 9151/13989 cut-off events. [2024-11-28 02:08:02,422 INFO L125 PetriNetUnfolderBase]: For 10460/10755 co-relation queries the response was YES. [2024-11-28 02:08:02,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36796 conditions, 13989 events. 9151/13989 cut-off events. For 10460/10755 co-relation queries the response was YES. Maximal size of possible extension queue 799. Compared 94854 event pairs, 1771 based on Foata normal form. 65/13851 useless extension candidates. Maximal degree in co-relation 36771. Up to 7169 conditions per place. [2024-11-28 02:08:02,464 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 65 selfloop transitions, 19 changer transitions 56/158 dead transitions. [2024-11-28 02:08:02,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 158 transitions, 979 flow [2024-11-28 02:08:02,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 02:08:02,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-28 02:08:02,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 290 transitions. [2024-11-28 02:08:02,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5858585858585859 [2024-11-28 02:08:02,465 INFO L175 Difference]: Start difference. First operand has 90 places, 75 transitions, 414 flow. Second operand 9 states and 290 transitions. [2024-11-28 02:08:02,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 158 transitions, 979 flow [2024-11-28 02:08:02,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 158 transitions, 936 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-11-28 02:08:02,497 INFO L231 Difference]: Finished difference. Result has 92 places, 74 transitions, 430 flow [2024-11-28 02:08:02,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=430, PETRI_PLACES=92, PETRI_TRANSITIONS=74} [2024-11-28 02:08:02,497 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 30 predicate places. [2024-11-28 02:08:02,497 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 74 transitions, 430 flow [2024-11-28 02:08:02,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 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-28 02:08:02,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:08:02,498 INFO L206 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, 1, 1, 1, 1, 1, 1] [2024-11-28 02:08:02,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-28 02:08:02,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:08:02,698 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-28 02:08:02,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:02,699 INFO L85 PathProgramCache]: Analyzing trace with hash -742401448, now seen corresponding path program 7 times [2024-11-28 02:08:02,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:08:02,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [299003355] [2024-11-28 02:08:02,699 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-28 02:08:02,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:08:02,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:08:02,703 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:08:02,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-28 02:08:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:02,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-28 02:08:02,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:08:03,002 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-28 02:08:03,002 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:08:03,002 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:08:03,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299003355] [2024-11-28 02:08:03,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299003355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:08:03,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:08:03,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 02:08:03,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555643113] [2024-11-28 02:08:03,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:08:03,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 02:08:03,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:08:03,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 02:08:03,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-28 02:08:03,050 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-11-28 02:08:03,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 74 transitions, 430 flow. Second operand has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 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-28 02:08:03,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:08:03,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-11-28 02:08:03,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:08:04,447 INFO L124 PetriNetUnfolderBase]: 6309/10035 cut-off events. [2024-11-28 02:08:04,447 INFO L125 PetriNetUnfolderBase]: For 11234/11407 co-relation queries the response was YES. [2024-11-28 02:08:04,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26824 conditions, 10035 events. 6309/10035 cut-off events. For 11234/11407 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 66185 event pairs, 1062 based on Foata normal form. 55/9991 useless extension candidates. Maximal degree in co-relation 26798. Up to 4720 conditions per place. [2024-11-28 02:08:04,486 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 44 selfloop transitions, 11 changer transitions 88/160 dead transitions. [2024-11-28 02:08:04,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 160 transitions, 1011 flow [2024-11-28 02:08:04,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 02:08:04,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-28 02:08:04,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 293 transitions. [2024-11-28 02:08:04,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.591919191919192 [2024-11-28 02:08:04,488 INFO L175 Difference]: Start difference. First operand has 92 places, 74 transitions, 430 flow. Second operand 9 states and 293 transitions. [2024-11-28 02:08:04,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 160 transitions, 1011 flow [2024-11-28 02:08:04,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 160 transitions, 964 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-11-28 02:08:04,495 INFO L231 Difference]: Finished difference. Result has 92 places, 63 transitions, 326 flow [2024-11-28 02:08:04,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=326, PETRI_PLACES=92, PETRI_TRANSITIONS=63} [2024-11-28 02:08:04,496 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 30 predicate places. [2024-11-28 02:08:04,496 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 63 transitions, 326 flow [2024-11-28 02:08:04,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 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-28 02:08:04,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:08:04,496 INFO L206 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, 1, 1, 1, 1, 1, 1] [2024-11-28 02:08:04,508 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-28 02:08:04,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:08:04,697 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-28 02:08:04,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:04,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1145219844, now seen corresponding path program 8 times [2024-11-28 02:08:04,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:08:04,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1180914558] [2024-11-28 02:08:04,698 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:08:04,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:08:04,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:08:04,700 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:08:04,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-28 02:08:04,803 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 02:08:04,803 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-28 02:08:04,803 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 02:08:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:08:04,910 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-28 02:08:04,910 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 02:08:04,911 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-28 02:08:04,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-28 02:08:04,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-28 02:08:04,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-28 02:08:04,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-28 02:08:04,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-28 02:08:04,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-28 02:08:04,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-28 02:08:04,926 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-28 02:08:05,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:08:05,117 INFO L422 BasicCegarLoop]: Path program histogram: [8, 1, 1, 1, 1, 1, 1] [2024-11-28 02:08:05,226 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-28 02:08:05,227 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 02:08:05,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:08:05 BasicIcfg [2024-11-28 02:08:05,233 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 02:08:05,234 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 02:08:05,234 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 02:08:05,234 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 02:08:05,235 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:07:45" (3/4) ... [2024-11-28 02:08:05,236 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-28 02:08:05,237 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 02:08:05,238 INFO L158 Benchmark]: Toolchain (without parser) took 21368.55ms. Allocated memory was 83.9MB in the beginning and 1.0GB in the end (delta: 922.7MB). Free memory was 58.7MB in the beginning and 521.3MB in the end (delta: -462.6MB). Peak memory consumption was 465.2MB. Max. memory is 16.1GB. [2024-11-28 02:08:05,238 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 83.9MB. Free memory was 64.2MB in the beginning and 64.1MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:08:05,239 INFO L158 Benchmark]: CACSL2BoogieTranslator took 715.19ms. Allocated memory is still 83.9MB. Free memory was 58.7MB in the beginning and 35.3MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 02:08:05,239 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.28ms. Allocated memory is still 83.9MB. Free memory was 35.3MB in the beginning and 33.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:08:05,239 INFO L158 Benchmark]: Boogie Preprocessor took 80.76ms. Allocated memory is still 83.9MB. Free memory was 33.2MB in the beginning and 29.9MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 02:08:05,239 INFO L158 Benchmark]: RCFGBuilder took 1123.60ms. Allocated memory is still 83.9MB. Free memory was 29.9MB in the beginning and 35.2MB in the end (delta: -5.3MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2024-11-28 02:08:05,240 INFO L158 Benchmark]: TraceAbstraction took 19370.72ms. Allocated memory was 83.9MB in the beginning and 1.0GB in the end (delta: 922.7MB). Free memory was 34.7MB in the beginning and 521.3MB in the end (delta: -486.6MB). Peak memory consumption was 433.8MB. Max. memory is 16.1GB. [2024-11-28 02:08:05,240 INFO L158 Benchmark]: Witness Printer took 3.60ms. Allocated memory is still 1.0GB. Free memory was 521.3MB in the beginning and 521.3MB in the end (delta: 39.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 02:08:05,244 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.40ms. Allocated memory is still 83.9MB. Free memory was 64.2MB in the beginning and 64.1MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 715.19ms. Allocated memory is still 83.9MB. Free memory was 58.7MB in the beginning and 35.3MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.28ms. Allocated memory is still 83.9MB. Free memory was 35.3MB in the beginning and 33.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 80.76ms. Allocated memory is still 83.9MB. Free memory was 33.2MB in the beginning and 29.9MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1123.60ms. Allocated memory is still 83.9MB. Free memory was 29.9MB in the beginning and 35.2MB in the end (delta: -5.3MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * TraceAbstraction took 19370.72ms. Allocated memory was 83.9MB in the beginning and 1.0GB in the end (delta: 922.7MB). Free memory was 34.7MB in the beginning and 521.3MB in the end (delta: -486.6MB). Peak memory consumption was 433.8MB. Max. memory is 16.1GB. * Witness Printer took 3.60ms. Allocated memory is still 1.0GB. Free memory was 521.3MB in the beginning and 521.3MB in the end (delta: 39.5kB). 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L858] 0 pthread_t t949; [L859] FCALL, FORK 0 pthread_create(&t949, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t949=1021, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t950; [L861] FCALL, FORK 0 pthread_create(&t950, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t949=1021, t950=1022, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L862] 0 pthread_t t951; [L863] FCALL, FORK 0 pthread_create(&t951, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t949=1021, t950=1022, t951=1023, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L864] 0 pthread_t t952; [L865] FCALL, FORK 0 pthread_create(&t952, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t949=1021, t950=1022, t951=1023, t952=1024, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L814] 4 z$w_buff1 = z$w_buff0 [L815] 4 z$w_buff0 = 1 [L816] 4 z$w_buff1_used = z$w_buff0_used [L817] 4 z$w_buff0_used = (_Bool)1 [L818] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L818] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L819] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L820] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L821] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L822] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L823] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L824] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L827] 4 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L830] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L833] 4 __unbuffered_p3_EBX = b VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 b = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L786] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L789] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 3 z$flush_delayed = weak$$choice2 [L792] 3 z$mem_tmp = z [L793] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L794] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L795] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L796] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L797] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L799] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 __unbuffered_p2_EAX = z [L801] 3 z = z$flush_delayed ? z$mem_tmp : z [L802] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L836] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L837] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L838] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L839] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L840] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L807] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t949=1021, t950=1022, t951=1023, t952=1024, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L872] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L873] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L874] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L875] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t949=1021, t950=1022, t951=1023, t952=1024, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t949=1021, t950=1022, t951=1023, t952=1024, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L880] 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}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix036_pso.opt_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 859]: 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: 865]: 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: 863]: 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: 861]: 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 9 procedures, 89 locations, 8 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: 19.1s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 845 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 788 mSDsluCounter, 499 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 455 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3253 IncrementalHoareTripleChecker+Invalid, 3288 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 44 mSDtfsCounter, 3253 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 420 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=430occurred in iteration=12, InterpolantAutomatonStates: 91, 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.3s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 437 NumberOfCodeBlocks, 436 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 385 ConstructedInterpolants, 0 QuantifiedInterpolants, 1655 SizeOfPredicates, 57 NumberOfNonLiveVariables, 1604 ConjunctsInSsa, 103 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-28 02:08:05,269 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_988ac678-924f-45a1-8759-2b052fb94c17/bin/uautomizer-verify-aQ6SnzHsRB/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