./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:03:40,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:03:40,489 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 14:03:40,496 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:03:40,496 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:03:40,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:03:40,527 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:03:40,528 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:03:40,528 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:03:40,529 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:03:40,529 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:03:40,529 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:03:40,529 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:03:40,530 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:03:40,530 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:03:40,530 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:03:40,530 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:03:40,531 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:03:40,531 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:03:40,531 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:03:40,531 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 14:03:40,531 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 14:03:40,532 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 14:03:40,532 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:03:40,532 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:03:40,532 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:03:40,532 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 14:03:40,533 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:03:40,533 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:03:40,533 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:03:40,533 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:03:40,534 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:03:40,534 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:03:40,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:03:40,534 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:03:40,534 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:03:40,535 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:03:40,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:03:40,535 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:03:40,535 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:03:40,535 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:03:40,536 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:03:40,536 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_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 [2024-11-13 14:03:40,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:03:40,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:03:40,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:03:40,950 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:03:40,950 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:03:40,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i Unable to find full path for "g++" [2024-11-13 14:03:43,328 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:03:43,772 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:03:43,773 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2024-11-13 14:03:43,812 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/data/2853a69c8/729584e89fe847ab9750650468f4a9e3/FLAG54030fc0a [2024-11-13 14:03:43,839 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/data/2853a69c8/729584e89fe847ab9750650468f4a9e3 [2024-11-13 14:03:43,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:03:43,846 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:03:43,848 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:03:43,848 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:03:43,854 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:03:43,855 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:03:43" (1/1) ... [2024-11-13 14:03:43,857 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3108fc1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:43, skipping insertion in model container [2024-11-13 14:03:43,857 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:03:43" (1/1) ... [2024-11-13 14:03:43,916 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:03:44,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:03:44,556 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:03:44,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:03:44,675 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:03:44,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:44 WrapperNode [2024-11-13 14:03:44,676 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:03:44,678 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:03:44,678 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:03:44,678 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:03:44,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:44" (1/1) ... [2024-11-13 14:03:44,704 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:44" (1/1) ... [2024-11-13 14:03:44,758 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 136 [2024-11-13 14:03:44,759 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:03:44,764 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:03:44,764 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:03:44,764 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:03:44,783 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:44" (1/1) ... [2024-11-13 14:03:44,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:44" (1/1) ... [2024-11-13 14:03:44,791 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:44" (1/1) ... [2024-11-13 14:03:44,824 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 14:03:44,825 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:44" (1/1) ... [2024-11-13 14:03:44,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:44" (1/1) ... [2024-11-13 14:03:44,840 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:44" (1/1) ... [2024-11-13 14:03:44,848 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:44" (1/1) ... [2024-11-13 14:03:44,850 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:44" (1/1) ... [2024-11-13 14:03:44,852 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:44" (1/1) ... [2024-11-13 14:03:44,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:03:44,864 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:03:44,864 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:03:44,864 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:03:44,866 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:44" (1/1) ... [2024-11-13 14:03:44,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:03:44,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:03:44,917 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:03:44,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:03:44,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 14:03:44,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:03:44,963 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-13 14:03:44,963 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-13 14:03:44,964 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-13 14:03:44,964 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-13 14:03:44,964 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-13 14:03:44,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-13 14:03:44,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:03:44,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 14:03:44,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:03:44,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:03:44,968 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 14:03:45,151 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:03:45,153 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:03:45,713 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 14:03:45,714 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:03:46,072 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:03:46,072 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 14:03:46,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:03:46 BoogieIcfgContainer [2024-11-13 14:03:46,073 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:03:46,077 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:03:46,077 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:03:46,084 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:03:46,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:03:43" (1/3) ... [2024-11-13 14:03:46,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@778d946b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:03:46, skipping insertion in model container [2024-11-13 14:03:46,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:44" (2/3) ... [2024-11-13 14:03:46,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@778d946b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:03:46, skipping insertion in model container [2024-11-13 14:03:46,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:03:46" (3/3) ... [2024-11-13 14:03:46,091 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2024-11-13 14:03:46,111 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:03:46,115 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i that has 4 procedures, 43 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-13 14:03:46,115 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 14:03:46,206 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 14:03:46,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-11-13 14:03:46,314 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-11-13 14:03:46,319 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:03:46,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2024-11-13 14:03:46,326 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-11-13 14:03:46,332 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-11-13 14:03:46,346 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:03:46,369 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;@546feb18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:03:46,370 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-13 14:03:46,377 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 14:03:46,377 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-13 14:03:46,377 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:03:46,377 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:03:46,378 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-13 14:03:46,379 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:03:46,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:46,389 INFO L85 PathProgramCache]: Analyzing trace with hash 11874970, now seen corresponding path program 1 times [2024-11-13 14:03:46,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:46,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665607245] [2024-11-13 14:03:46,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:46,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:47,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:03:47,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:03:47,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665607245] [2024-11-13 14:03:47,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665607245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:03:47,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:03:47,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 14:03:47,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895788575] [2024-11-13 14:03:47,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:03:47,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:03:47,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:03:47,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:03:47,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:03:47,115 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2024-11-13 14:03:47,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:03:47,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:03:47,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2024-11-13 14:03:47,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:03:47,829 INFO L124 PetriNetUnfolderBase]: 680/1277 cut-off events. [2024-11-13 14:03:47,829 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-13 14:03:47,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 1277 events. 680/1277 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8166 event pairs, 104 based on Foata normal form. 72/1333 useless extension candidates. Maximal degree in co-relation 2342. Up to 844 conditions per place. [2024-11-13 14:03:47,849 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 33 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2024-11-13 14:03:47,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 53 transitions, 195 flow [2024-11-13 14:03:47,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:03:47,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:03:47,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-11-13 14:03:47,874 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-11-13 14:03:47,879 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 99 transitions. [2024-11-13 14:03:47,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 53 transitions, 195 flow [2024-11-13 14:03:47,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 190 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-13 14:03:47,895 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-11-13 14:03:47,900 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-11-13 14:03:47,906 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-11-13 14:03:47,907 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-11-13 14:03:47,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:03:47,909 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:03:47,910 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:03:47,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:03:47,910 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:03:47,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:47,911 INFO L85 PathProgramCache]: Analyzing trace with hash 625606107, now seen corresponding path program 1 times [2024-11-13 14:03:47,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:47,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435794756] [2024-11-13 14:03:47,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:47,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:48,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:03:48,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:03:48,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435794756] [2024-11-13 14:03:48,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435794756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:03:48,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:03:48,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 14:03:48,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621281119] [2024-11-13 14:03:48,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:03:48,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:03:48,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:03:48,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:03:48,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:03:48,131 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-11-13 14:03:48,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:03:48,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:03:48,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-11-13 14:03:48,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:03:48,541 INFO L124 PetriNetUnfolderBase]: 605/1137 cut-off events. [2024-11-13 14:03:48,541 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-11-13 14:03:48,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2181 conditions, 1137 events. 605/1137 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7018 event pairs, 605 based on Foata normal form. 36/1123 useless extension candidates. Maximal degree in co-relation 2171. Up to 926 conditions per place. [2024-11-13 14:03:48,554 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 18 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-11-13 14:03:48,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 120 flow [2024-11-13 14:03:48,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:03:48,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:03:48,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-11-13 14:03:48,558 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-11-13 14:03:48,558 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 75 transitions. [2024-11-13 14:03:48,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 120 flow [2024-11-13 14:03:48,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:03:48,563 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2024-11-13 14:03:48,566 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2024-11-13 14:03:48,567 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2024-11-13 14:03:48,567 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2024-11-13 14:03:48,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:03:48,568 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:03:48,568 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:03:48,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:03:48,568 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:03:48,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:48,569 INFO L85 PathProgramCache]: Analyzing trace with hash 625607718, now seen corresponding path program 1 times [2024-11-13 14:03:48,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:48,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024284572] [2024-11-13 14:03:48,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:48,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:50,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:03:50,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:03:50,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024284572] [2024-11-13 14:03:50,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024284572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:03:50,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:03:50,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:03:50,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440977384] [2024-11-13 14:03:50,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:03:50,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:03:50,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:03:50,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:03:50,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:03:50,344 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2024-11-13 14:03:50,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 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-13 14:03:50,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:03:50,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2024-11-13 14:03:50,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:03:52,470 INFO L124 PetriNetUnfolderBase]: 3181/5158 cut-off events. [2024-11-13 14:03:52,470 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:03:52,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9892 conditions, 5158 events. 3181/5158 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 33096 event pairs, 392 based on Foata normal form. 0/5021 useless extension candidates. Maximal degree in co-relation 9886. Up to 2283 conditions per place. [2024-11-13 14:03:52,512 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 41 selfloop transitions, 12 changer transitions 90/153 dead transitions. [2024-11-13 14:03:52,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 153 transitions, 604 flow [2024-11-13 14:03:52,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 14:03:52,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-13 14:03:52,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 314 transitions. [2024-11-13 14:03:52,516 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5946969696969697 [2024-11-13 14:03:52,516 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 12 states and 314 transitions. [2024-11-13 14:03:52,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 153 transitions, 604 flow [2024-11-13 14:03:52,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 153 transitions, 603 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 14:03:52,524 INFO L231 Difference]: Finished difference. Result has 64 places, 44 transitions, 213 flow [2024-11-13 14:03:52,525 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=213, PETRI_PLACES=64, PETRI_TRANSITIONS=44} [2024-11-13 14:03:52,527 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 15 predicate places. [2024-11-13 14:03:52,527 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 44 transitions, 213 flow [2024-11-13 14:03:52,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 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-13 14:03:52,527 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:03:52,527 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:03:52,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:03:52,528 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:03:52,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:52,529 INFO L85 PathProgramCache]: Analyzing trace with hash 827570693, now seen corresponding path program 1 times [2024-11-13 14:03:52,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:52,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255755028] [2024-11-13 14:03:52,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:52,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:53,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:03:53,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:03:53,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255755028] [2024-11-13 14:03:53,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255755028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:03:53,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:03:53,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:03:53,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050735443] [2024-11-13 14:03:53,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:03:53,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:03:53,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:03:53,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:03:53,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:03:53,947 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2024-11-13 14:03:53,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 44 transitions, 213 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:03:53,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:03:53,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2024-11-13 14:03:53,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:03:55,446 INFO L124 PetriNetUnfolderBase]: 2355/3922 cut-off events. [2024-11-13 14:03:55,446 INFO L125 PetriNetUnfolderBase]: For 8780/8783 co-relation queries the response was YES. [2024-11-13 14:03:55,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14278 conditions, 3922 events. 2355/3922 cut-off events. For 8780/8783 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 24816 event pairs, 500 based on Foata normal form. 99/4015 useless extension candidates. Maximal degree in co-relation 14260. Up to 2269 conditions per place. [2024-11-13 14:03:55,485 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 46 selfloop transitions, 19 changer transitions 54/129 dead transitions. [2024-11-13 14:03:55,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 129 transitions, 951 flow [2024-11-13 14:03:55,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 14:03:55,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-13 14:03:55,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 253 transitions. [2024-11-13 14:03:55,490 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.575 [2024-11-13 14:03:55,492 INFO L175 Difference]: Start difference. First operand has 64 places, 44 transitions, 213 flow. Second operand 10 states and 253 transitions. [2024-11-13 14:03:55,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 129 transitions, 951 flow [2024-11-13 14:03:55,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 129 transitions, 875 flow, removed 38 selfloop flow, removed 4 redundant places. [2024-11-13 14:03:55,530 INFO L231 Difference]: Finished difference. Result has 69 places, 53 transitions, 361 flow [2024-11-13 14:03:55,530 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=361, PETRI_PLACES=69, PETRI_TRANSITIONS=53} [2024-11-13 14:03:55,532 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 20 predicate places. [2024-11-13 14:03:55,532 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 53 transitions, 361 flow [2024-11-13 14:03:55,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:03:55,534 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:03:55,534 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:03:55,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 14:03:55,534 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:03:55,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:55,535 INFO L85 PathProgramCache]: Analyzing trace with hash 59559027, now seen corresponding path program 1 times [2024-11-13 14:03:55,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:55,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53472582] [2024-11-13 14:03:55,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:55,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:55,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:03:55,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:03:55,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53472582] [2024-11-13 14:03:55,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53472582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:03:55,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:03:55,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:03:55,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208835462] [2024-11-13 14:03:55,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:03:55,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:03:55,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:03:55,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:03:55,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:03:55,870 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-11-13 14:03:55,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 53 transitions, 361 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:03:55,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:03:55,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-11-13 14:03:55,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:03:57,390 INFO L124 PetriNetUnfolderBase]: 2791/4724 cut-off events. [2024-11-13 14:03:57,390 INFO L125 PetriNetUnfolderBase]: For 16588/17316 co-relation queries the response was YES. [2024-11-13 14:03:57,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18998 conditions, 4724 events. 2791/4724 cut-off events. For 16588/17316 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 32211 event pairs, 663 based on Foata normal form. 392/4954 useless extension candidates. Maximal degree in co-relation 18973. Up to 2030 conditions per place. [2024-11-13 14:03:57,447 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 46 selfloop transitions, 6 changer transitions 47/118 dead transitions. [2024-11-13 14:03:57,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 118 transitions, 1019 flow [2024-11-13 14:03:57,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:03:57,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 14:03:57,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 183 transitions. [2024-11-13 14:03:57,450 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5941558441558441 [2024-11-13 14:03:57,450 INFO L175 Difference]: Start difference. First operand has 69 places, 53 transitions, 361 flow. Second operand 7 states and 183 transitions. [2024-11-13 14:03:57,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 118 transitions, 1019 flow [2024-11-13 14:03:57,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 118 transitions, 977 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-11-13 14:03:57,496 INFO L231 Difference]: Finished difference. Result has 68 places, 53 transitions, 371 flow [2024-11-13 14:03:57,497 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=371, PETRI_PLACES=68, PETRI_TRANSITIONS=53} [2024-11-13 14:03:57,499 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 19 predicate places. [2024-11-13 14:03:57,501 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 53 transitions, 371 flow [2024-11-13 14:03:57,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:03:57,501 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:03:57,502 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:03:57,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 14:03:57,502 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:03:57,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:57,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1393230876, now seen corresponding path program 1 times [2024-11-13 14:03:57,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:03:57,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700438054] [2024-11-13 14:03:57,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:57,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:03:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:58,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:03:58,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:03:58,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700438054] [2024-11-13 14:03:58,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700438054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:03:58,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:03:58,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:03:58,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042520875] [2024-11-13 14:03:58,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:03:58,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:03:58,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:03:58,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:03:58,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:03:58,345 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-13 14:03:58,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 53 transitions, 371 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:03:58,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:03:58,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-13 14:03:58,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:03:59,874 INFO L124 PetriNetUnfolderBase]: 3231/5480 cut-off events. [2024-11-13 14:03:59,875 INFO L125 PetriNetUnfolderBase]: For 17539/18594 co-relation queries the response was YES. [2024-11-13 14:03:59,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21658 conditions, 5480 events. 3231/5480 cut-off events. For 17539/18594 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 38051 event pairs, 976 based on Foata normal form. 607/5881 useless extension candidates. Maximal degree in co-relation 21633. Up to 3591 conditions per place. [2024-11-13 14:03:59,928 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 37 selfloop transitions, 4 changer transitions 39/106 dead transitions. [2024-11-13 14:03:59,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 106 transitions, 877 flow [2024-11-13 14:03:59,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:03:59,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 14:03:59,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2024-11-13 14:03:59,930 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5811688311688312 [2024-11-13 14:03:59,931 INFO L175 Difference]: Start difference. First operand has 68 places, 53 transitions, 371 flow. Second operand 7 states and 179 transitions. [2024-11-13 14:03:59,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 106 transitions, 877 flow [2024-11-13 14:04:00,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 106 transitions, 855 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-11-13 14:04:00,017 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 417 flow [2024-11-13 14:04:00,019 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=417, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2024-11-13 14:04:00,020 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 21 predicate places. [2024-11-13 14:04:00,021 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 417 flow [2024-11-13 14:04:00,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:04:00,021 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:04:00,022 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:04:00,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 14:04:00,022 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:04:00,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:04:00,022 INFO L85 PathProgramCache]: Analyzing trace with hash 810999619, now seen corresponding path program 1 times [2024-11-13 14:04:00,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:04:00,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987053600] [2024-11-13 14:04:00,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:04:00,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:04:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:01,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:04:01,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:04:01,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987053600] [2024-11-13 14:04:01,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987053600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:04:01,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:04:01,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:04:01,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109555574] [2024-11-13 14:04:01,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:04:01,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:04:01,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:04:01,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:04:01,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:04:01,043 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2024-11-13 14:04:01,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 417 flow. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:04:01,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:04:01,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2024-11-13 14:04:01,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:04:03,448 INFO L124 PetriNetUnfolderBase]: 4492/7749 cut-off events. [2024-11-13 14:04:03,448 INFO L125 PetriNetUnfolderBase]: For 25276/25308 co-relation queries the response was YES. [2024-11-13 14:04:03,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31852 conditions, 7749 events. 4492/7749 cut-off events. For 25276/25308 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 58000 event pairs, 985 based on Foata normal form. 196/7884 useless extension candidates. Maximal degree in co-relation 31825. Up to 2933 conditions per place. [2024-11-13 14:04:03,532 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 57 selfloop transitions, 21 changer transitions 55/144 dead transitions. [2024-11-13 14:04:03,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 144 transitions, 1290 flow [2024-11-13 14:04:03,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 14:04:03,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-13 14:04:03,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 246 transitions. [2024-11-13 14:04:03,534 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5590909090909091 [2024-11-13 14:04:03,534 INFO L175 Difference]: Start difference. First operand has 70 places, 56 transitions, 417 flow. Second operand 10 states and 246 transitions. [2024-11-13 14:04:03,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 144 transitions, 1290 flow [2024-11-13 14:04:03,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 144 transitions, 1267 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-11-13 14:04:03,606 INFO L231 Difference]: Finished difference. Result has 81 places, 63 transitions, 607 flow [2024-11-13 14:04:03,608 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=607, PETRI_PLACES=81, PETRI_TRANSITIONS=63} [2024-11-13 14:04:03,609 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 32 predicate places. [2024-11-13 14:04:03,609 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 63 transitions, 607 flow [2024-11-13 14:04:03,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:04:03,610 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:04:03,610 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:04:03,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 14:04:03,610 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:04:03,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:04:03,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1542743980, now seen corresponding path program 1 times [2024-11-13 14:04:03,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:04:03,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851954201] [2024-11-13 14:04:03,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:04:03,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:04:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:04,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:04:04,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:04:04,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851954201] [2024-11-13 14:04:04,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851954201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:04:04,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:04:04,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:04:04,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204159356] [2024-11-13 14:04:04,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:04:04,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:04:04,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:04:04,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:04:04,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:04:04,070 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-13 14:04:04,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 63 transitions, 607 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:04:04,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:04:04,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-13 14:04:04,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:04:05,764 INFO L124 PetriNetUnfolderBase]: 4122/7298 cut-off events. [2024-11-13 14:04:05,764 INFO L125 PetriNetUnfolderBase]: For 42892/44051 co-relation queries the response was YES. [2024-11-13 14:04:05,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33715 conditions, 7298 events. 4122/7298 cut-off events. For 42892/44051 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 55803 event pairs, 1856 based on Foata normal form. 634/7776 useless extension candidates. Maximal degree in co-relation 33680. Up to 4832 conditions per place. [2024-11-13 14:04:05,816 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 49 selfloop transitions, 14 changer transitions 42/132 dead transitions. [2024-11-13 14:04:05,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 132 transitions, 1473 flow [2024-11-13 14:04:05,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:04:05,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-13 14:04:05,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 205 transitions. [2024-11-13 14:04:05,818 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5823863636363636 [2024-11-13 14:04:05,818 INFO L175 Difference]: Start difference. First operand has 81 places, 63 transitions, 607 flow. Second operand 8 states and 205 transitions. [2024-11-13 14:04:05,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 132 transitions, 1473 flow [2024-11-13 14:04:05,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 132 transitions, 1415 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-11-13 14:04:05,910 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 721 flow [2024-11-13 14:04:05,910 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=721, PETRI_PLACES=84, PETRI_TRANSITIONS=70} [2024-11-13 14:04:05,911 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 35 predicate places. [2024-11-13 14:04:05,911 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 721 flow [2024-11-13 14:04:05,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:04:05,911 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:04:05,911 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:04:05,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 14:04:05,912 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:04:05,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:04:05,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1127372396, now seen corresponding path program 2 times [2024-11-13 14:04:05,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:04:05,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911059789] [2024-11-13 14:04:05,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:04:05,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:04:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:06,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:04:06,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:04:06,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911059789] [2024-11-13 14:04:06,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911059789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:04:06,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:04:06,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:04:06,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127160488] [2024-11-13 14:04:06,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:04:06,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:04:06,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:04:06,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:04:06,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:04:06,605 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-13 14:04:06,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 70 transitions, 721 flow. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:04:06,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:04:06,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-13 14:04:06,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:04:08,758 INFO L124 PetriNetUnfolderBase]: 3958/7012 cut-off events. [2024-11-13 14:04:08,758 INFO L125 PetriNetUnfolderBase]: For 46743/47730 co-relation queries the response was YES. [2024-11-13 14:04:08,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34259 conditions, 7012 events. 3958/7012 cut-off events. For 46743/47730 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 53324 event pairs, 1805 based on Foata normal form. 624/7481 useless extension candidates. Maximal degree in co-relation 34220. Up to 4749 conditions per place. [2024-11-13 14:04:08,823 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 45 selfloop transitions, 14 changer transitions 42/128 dead transitions. [2024-11-13 14:04:08,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 128 transitions, 1476 flow [2024-11-13 14:04:08,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:04:08,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-13 14:04:08,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2024-11-13 14:04:08,825 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5738636363636364 [2024-11-13 14:04:08,825 INFO L175 Difference]: Start difference. First operand has 84 places, 70 transitions, 721 flow. Second operand 8 states and 202 transitions. [2024-11-13 14:04:08,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 128 transitions, 1476 flow [2024-11-13 14:04:08,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 128 transitions, 1424 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-11-13 14:04:08,967 INFO L231 Difference]: Finished difference. Result has 87 places, 70 transitions, 739 flow [2024-11-13 14:04:08,967 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=739, PETRI_PLACES=87, PETRI_TRANSITIONS=70} [2024-11-13 14:04:08,968 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 38 predicate places. [2024-11-13 14:04:08,970 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 70 transitions, 739 flow [2024-11-13 14:04:08,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:04:08,970 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:04:08,970 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:04:08,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 14:04:08,971 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:04:08,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:04:08,971 INFO L85 PathProgramCache]: Analyzing trace with hash -97355430, now seen corresponding path program 1 times [2024-11-13 14:04:08,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:04:08,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5832772] [2024-11-13 14:04:08,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:04:08,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:04:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:10,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:04:10,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:04:10,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5832772] [2024-11-13 14:04:10,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5832772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:04:10,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:04:10,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:04:10,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757037028] [2024-11-13 14:04:10,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:04:10,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:04:10,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:04:10,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:04:10,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:04:10,943 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-11-13 14:04:10,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 70 transitions, 739 flow. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:04:10,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:04:10,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-11-13 14:04:10,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:04:12,819 INFO L124 PetriNetUnfolderBase]: 4961/8462 cut-off events. [2024-11-13 14:04:12,819 INFO L125 PetriNetUnfolderBase]: For 57395/57418 co-relation queries the response was YES. [2024-11-13 14:04:12,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41506 conditions, 8462 events. 4961/8462 cut-off events. For 57395/57418 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 62179 event pairs, 1438 based on Foata normal form. 244/8701 useless extension candidates. Maximal degree in co-relation 41465. Up to 4922 conditions per place. [2024-11-13 14:04:12,890 INFO L140 encePairwiseOnDemand]: 30/44 looper letters, 68 selfloop transitions, 34 changer transitions 94/205 dead transitions. [2024-11-13 14:04:12,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 205 transitions, 2562 flow [2024-11-13 14:04:12,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 14:04:12,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-13 14:04:12,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 242 transitions. [2024-11-13 14:04:12,893 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.55 [2024-11-13 14:04:12,893 INFO L175 Difference]: Start difference. First operand has 87 places, 70 transitions, 739 flow. Second operand 10 states and 242 transitions. [2024-11-13 14:04:12,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 205 transitions, 2562 flow [2024-11-13 14:04:13,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 205 transitions, 2492 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-11-13 14:04:13,059 INFO L231 Difference]: Finished difference. Result has 94 places, 88 transitions, 1090 flow [2024-11-13 14:04:13,060 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1090, PETRI_PLACES=94, PETRI_TRANSITIONS=88} [2024-11-13 14:04:13,061 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 45 predicate places. [2024-11-13 14:04:13,062 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 88 transitions, 1090 flow [2024-11-13 14:04:13,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:04:13,063 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:04:13,063 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:04:13,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 14:04:13,063 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:04:13,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:04:13,064 INFO L85 PathProgramCache]: Analyzing trace with hash -364931210, now seen corresponding path program 1 times [2024-11-13 14:04:13,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:04:13,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150205553] [2024-11-13 14:04:13,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:04:13,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:04:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:13,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:04:13,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:04:13,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150205553] [2024-11-13 14:04:13,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150205553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:04:13,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:04:13,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:04:13,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204641487] [2024-11-13 14:04:13,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:04:13,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:04:13,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:04:13,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:04:13,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:04:13,278 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-13 14:04:13,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 88 transitions, 1090 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:04:13,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:04:13,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-13 14:04:13,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:04:13,743 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([373] L792-->L799: Formula: (let ((.cse1 (not (= 0 (mod v_~z$r_buff1_thd3~0_28 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_30 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_87 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse3 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_88 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~z$w_buff1_used~0_75 256) 0))))) (and (= v_~z$r_buff0_thd3~0_29 (ite (= (mod (ite .cse0 0 v_~z$r_buff0_thd3~0_30) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_74 256) 0)) .cse1) (and (not (= (mod v_~z$r_buff0_thd3~0_29 256) 0)) .cse2)) 0 v_~z$r_buff1_thd3~0_28) 256) 0) 0 1) v_~z$r_buff1_thd3~0_27) (= v_~z$w_buff0_used~0_87 (ite (= (mod (ite .cse3 0 v_~z$w_buff0_used~0_88) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse0 .cse4) 0 v_~z$w_buff1_used~0_75) 256) 0) 0 1) v_~z$w_buff1_used~0_74) (= v_~z~0_25 (ite .cse3 v_~z$w_buff0~0_23 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_26)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_88, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_75, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_30, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_87, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_29, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][63], [60#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 42#L769true, 44#L824true, 210#true, Black: 65#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 198#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$w_buff0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 140#(and (= ~z$w_buff1~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 72#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 138#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 51#true, Black: 133#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 63#(<= ~y~0 0), 90#true, 61#true, 49#true, Black: 76#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 64#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), 21#L759true, 23#L799true, Black: 214#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 161#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 220#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 224#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 213#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (= ~z$r_buff1_thd0~0 0)), Black: 151#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 152#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 218#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 159#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 215#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 226#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 53#true, 148#true, Black: 163#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 222#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 150#(= ~x~0 1), Black: 93#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 92#(= ~x~0 0), 241#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 176#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0)), Black: 117#(= ~y~0 1)]) [2024-11-13 14:04:13,744 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-11-13 14:04:13,744 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-11-13 14:04:13,744 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-11-13 14:04:13,745 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-11-13 14:04:13,846 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([373] L792-->L799: Formula: (let ((.cse1 (not (= 0 (mod v_~z$r_buff1_thd3~0_28 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_30 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_87 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse3 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_88 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~z$w_buff1_used~0_75 256) 0))))) (and (= v_~z$r_buff0_thd3~0_29 (ite (= (mod (ite .cse0 0 v_~z$r_buff0_thd3~0_30) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_74 256) 0)) .cse1) (and (not (= (mod v_~z$r_buff0_thd3~0_29 256) 0)) .cse2)) 0 v_~z$r_buff1_thd3~0_28) 256) 0) 0 1) v_~z$r_buff1_thd3~0_27) (= v_~z$w_buff0_used~0_87 (ite (= (mod (ite .cse3 0 v_~z$w_buff0_used~0_88) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse0 .cse4) 0 v_~z$w_buff1_used~0_75) 256) 0) 0 1) v_~z$w_buff1_used~0_74) (= v_~z~0_25 (ite .cse3 v_~z$w_buff0~0_23 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_26)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_88, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_75, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_30, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_87, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_29, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][84], [60#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 42#L769true, 44#L824true, 210#true, 239#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 65#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 198#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$w_buff0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 140#(and (= ~z$w_buff1~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 72#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 138#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 51#true, Black: 133#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 63#(<= ~y~0 0), 90#true, 61#true, Black: 76#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 49#true, Black: 64#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), 23#L799true, Black: 214#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 161#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 220#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 224#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 213#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (= ~z$r_buff1_thd0~0 0)), 14#L762true, Black: 151#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 152#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 218#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 159#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 215#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 226#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 53#true, 148#true, Black: 163#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 222#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 150#(= ~x~0 1), Black: 93#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 92#(= ~x~0 0), Black: 176#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0)), Black: 117#(= ~y~0 1)]) [2024-11-13 14:04:13,846 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-11-13 14:04:13,847 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-13 14:04:13,847 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-13 14:04:13,847 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-13 14:04:13,951 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([373] L792-->L799: Formula: (let ((.cse1 (not (= 0 (mod v_~z$r_buff1_thd3~0_28 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_30 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_87 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse3 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_88 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~z$w_buff1_used~0_75 256) 0))))) (and (= v_~z$r_buff0_thd3~0_29 (ite (= (mod (ite .cse0 0 v_~z$r_buff0_thd3~0_30) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_74 256) 0)) .cse1) (and (not (= (mod v_~z$r_buff0_thd3~0_29 256) 0)) .cse2)) 0 v_~z$r_buff1_thd3~0_28) 256) 0) 0 1) v_~z$r_buff1_thd3~0_27) (= v_~z$w_buff0_used~0_87 (ite (= (mod (ite .cse3 0 v_~z$w_buff0_used~0_88) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse0 .cse4) 0 v_~z$w_buff1_used~0_75) 256) 0) 0 1) v_~z$w_buff1_used~0_74) (= v_~z~0_25 (ite .cse3 v_~z$w_buff0~0_23 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_26)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_88, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_75, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_30, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_87, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_29, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][84], [60#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 42#L769true, 44#L824true, 210#true, 239#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 65#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 198#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$w_buff0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 140#(and (= ~z$w_buff1~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 72#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 138#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), 51#true, Black: 74#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 133#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 63#(<= ~y~0 0), 90#true, 61#true, Black: 76#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 49#true, Black: 64#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), 23#L799true, Black: 214#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 220#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 161#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 224#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 213#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (= ~z$r_buff1_thd0~0 0)), Black: 151#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 152#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 218#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 159#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 215#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 226#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 53#true, 148#true, Black: 163#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 222#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 150#(= ~x~0 1), Black: 93#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), 38#P0EXITtrue, Black: 92#(= ~x~0 0), Black: 176#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0)), Black: 117#(= ~y~0 1)]) [2024-11-13 14:04:13,951 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-11-13 14:04:13,951 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-13 14:04:13,951 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-13 14:04:13,951 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-13 14:04:15,129 INFO L124 PetriNetUnfolderBase]: 6633/10569 cut-off events. [2024-11-13 14:04:15,129 INFO L125 PetriNetUnfolderBase]: For 97646/100947 co-relation queries the response was YES. [2024-11-13 14:04:15,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51675 conditions, 10569 events. 6633/10569 cut-off events. For 97646/100947 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 71253 event pairs, 1018 based on Foata normal form. 1950/12128 useless extension candidates. Maximal degree in co-relation 51629. Up to 5701 conditions per place. [2024-11-13 14:04:15,188 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 79 selfloop transitions, 5 changer transitions 6/123 dead transitions. [2024-11-13 14:04:15,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 123 transitions, 1635 flow [2024-11-13 14:04:15,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:04:15,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 14:04:15,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2024-11-13 14:04:15,189 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2024-11-13 14:04:15,192 INFO L175 Difference]: Start difference. First operand has 94 places, 88 transitions, 1090 flow. Second operand 4 states and 108 transitions. [2024-11-13 14:04:15,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 123 transitions, 1635 flow [2024-11-13 14:04:15,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 123 transitions, 1595 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-11-13 14:04:15,299 INFO L231 Difference]: Finished difference. Result has 87 places, 86 transitions, 1019 flow [2024-11-13 14:04:15,299 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=981, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1019, PETRI_PLACES=87, PETRI_TRANSITIONS=86} [2024-11-13 14:04:15,299 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 38 predicate places. [2024-11-13 14:04:15,299 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 86 transitions, 1019 flow [2024-11-13 14:04:15,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:04:15,300 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:04:15,300 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:04:15,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 14:04:15,300 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:04:15,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:04:15,300 INFO L85 PathProgramCache]: Analyzing trace with hash 2047113351, now seen corresponding path program 1 times [2024-11-13 14:04:15,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:04:15,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430581434] [2024-11-13 14:04:15,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:04:15,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:04:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:15,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:04:15,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:04:15,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430581434] [2024-11-13 14:04:15,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430581434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:04:15,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:04:15,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:04:15,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855574979] [2024-11-13 14:04:15,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:04:15,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:04:15,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:04:15,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:04:15,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:04:15,565 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-13 14:04:15,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 86 transitions, 1019 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:04:15,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:04:15,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-13 14:04:15,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:04:16,010 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([373] L792-->L799: Formula: (let ((.cse1 (not (= 0 (mod v_~z$r_buff1_thd3~0_28 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_30 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_87 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse3 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_88 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~z$w_buff1_used~0_75 256) 0))))) (and (= v_~z$r_buff0_thd3~0_29 (ite (= (mod (ite .cse0 0 v_~z$r_buff0_thd3~0_30) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_74 256) 0)) .cse1) (and (not (= (mod v_~z$r_buff0_thd3~0_29 256) 0)) .cse2)) 0 v_~z$r_buff1_thd3~0_28) 256) 0) 0 1) v_~z$r_buff1_thd3~0_27) (= v_~z$w_buff0_used~0_87 (ite (= (mod (ite .cse3 0 v_~z$w_buff0_used~0_88) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse0 .cse4) 0 v_~z$w_buff1_used~0_75) 256) 0) 0 1) v_~z$w_buff1_used~0_74) (= v_~z~0_25 (ite .cse3 v_~z$w_buff0~0_23 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_26)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_88, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_75, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_30, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_87, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_29, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][63], [60#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 42#L769true, 44#L824true, 210#true, Black: 140#(and (= ~z$w_buff1~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 65#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 198#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$w_buff0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 138#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 72#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 74#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 51#true, Black: 133#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 63#(<= ~y~0 0), 90#true, 61#true, Black: 76#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 49#true, Black: 64#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), 250#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 21#L759true, 23#L799true, Black: 214#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 161#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 213#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (= ~z$r_buff1_thd0~0 0)), Black: 151#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 152#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 159#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 53#true, 148#true, Black: 163#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 150#(= ~x~0 1), Black: 93#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 92#(= ~x~0 0), Black: 239#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 241#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 176#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0)), Black: 117#(= ~y~0 1)]) [2024-11-13 14:04:16,010 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-11-13 14:04:16,010 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-11-13 14:04:16,010 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-11-13 14:04:16,010 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-11-13 14:04:16,124 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([373] L792-->L799: Formula: (let ((.cse1 (not (= 0 (mod v_~z$r_buff1_thd3~0_28 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_30 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_87 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse3 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_88 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~z$w_buff1_used~0_75 256) 0))))) (and (= v_~z$r_buff0_thd3~0_29 (ite (= (mod (ite .cse0 0 v_~z$r_buff0_thd3~0_30) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_74 256) 0)) .cse1) (and (not (= (mod v_~z$r_buff0_thd3~0_29 256) 0)) .cse2)) 0 v_~z$r_buff1_thd3~0_28) 256) 0) 0 1) v_~z$r_buff1_thd3~0_27) (= v_~z$w_buff0_used~0_87 (ite (= (mod (ite .cse3 0 v_~z$w_buff0_used~0_88) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse0 .cse4) 0 v_~z$w_buff1_used~0_75) 256) 0) 0 1) v_~z$w_buff1_used~0_74) (= v_~z~0_25 (ite .cse3 v_~z$w_buff0~0_23 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_26)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_88, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_75, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_30, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_87, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_29, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][80], [60#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 42#L769true, 44#L824true, 210#true, 239#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 140#(and (= ~z$w_buff1~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 65#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 198#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$w_buff0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 138#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 72#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 74#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 51#true, Black: 133#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 63#(<= ~y~0 0), 90#true, 61#true, Black: 76#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 49#true, Black: 64#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), 23#L799true, Black: 214#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 161#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 14#L762true, Black: 213#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (= ~z$r_buff1_thd0~0 0)), Black: 151#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 152#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 159#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 53#true, 148#true, Black: 163#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 252#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 150#(= ~x~0 1), Black: 93#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 92#(= ~x~0 0), Black: 241#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 176#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0)), Black: 117#(= ~y~0 1)]) [2024-11-13 14:04:16,124 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-11-13 14:04:16,124 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-13 14:04:16,125 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-13 14:04:16,125 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-13 14:04:16,284 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([373] L792-->L799: Formula: (let ((.cse1 (not (= 0 (mod v_~z$r_buff1_thd3~0_28 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_30 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_87 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse3 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_88 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~z$w_buff1_used~0_75 256) 0))))) (and (= v_~z$r_buff0_thd3~0_29 (ite (= (mod (ite .cse0 0 v_~z$r_buff0_thd3~0_30) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and (not (= (mod v_~z$w_buff1_used~0_74 256) 0)) .cse1) (and (not (= (mod v_~z$r_buff0_thd3~0_29 256) 0)) .cse2)) 0 v_~z$r_buff1_thd3~0_28) 256) 0) 0 1) v_~z$r_buff1_thd3~0_27) (= v_~z$w_buff0_used~0_87 (ite (= (mod (ite .cse3 0 v_~z$w_buff0_used~0_88) 256) 0) 0 1)) (= (ite (= (mod (ite (or .cse0 .cse4) 0 v_~z$w_buff1_used~0_75) 256) 0) 0 1) v_~z$w_buff1_used~0_74) (= v_~z~0_25 (ite .cse3 v_~z$w_buff0~0_23 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_26)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_88, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_75, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_30, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_87, ~z$w_buff0~0=v_~z$w_buff0~0_23, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_29, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][80], [60#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 42#L769true, 44#L824true, 210#true, 239#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 140#(and (= ~z$w_buff1~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 65#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 198#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$w_buff0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 138#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~z$r_buff1_thd0~0 0)), Black: 72#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 74#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 51#true, Black: 133#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 63#(<= ~y~0 0), 90#true, 61#true, Black: 76#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 49#true, Black: 64#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), 23#L799true, Black: 214#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 161#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 213#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (= ~z$r_buff1_thd0~0 0)), Black: 151#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), Black: 152#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 159#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 53#true, 148#true, Black: 163#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 252#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 150#(= ~x~0 1), Black: 93#(and (or (not (= 2 ~y~0)) (= (mod ~z$r_buff1_thd0~0 256) 0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= (mod ~z$w_buff1_used~0 256) 0) (= 0 (mod ~z$w_buff0_used~0 256)) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (not (= (mod ~z$r_buff1_thd0~0 256) 0)) (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (not (= 0 (mod ~z$w_buff0_used~0 256))) (not (= 0 (mod ~z$r_buff0_thd0~0 256)))) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (= 0 (mod ~z$r_buff0_thd0~0 256)) (not (= ~z$w_buff0~0 2)) (= 0 (mod ~z$w_buff0_used~0 256)))), 38#P0EXITtrue, Black: 92#(= ~x~0 0), Black: 241#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 176#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0)), Black: 117#(= ~y~0 1)]) [2024-11-13 14:04:16,284 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-11-13 14:04:16,284 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-13 14:04:16,284 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-13 14:04:16,284 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-13 14:04:16,987 INFO L124 PetriNetUnfolderBase]: 4618/7370 cut-off events. [2024-11-13 14:04:16,987 INFO L125 PetriNetUnfolderBase]: For 54185/56190 co-relation queries the response was YES. [2024-11-13 14:04:17,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34907 conditions, 7370 events. 4618/7370 cut-off events. For 54185/56190 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 47430 event pairs, 435 based on Foata normal form. 1272/8301 useless extension candidates. Maximal degree in co-relation 34863. Up to 2597 conditions per place. [2024-11-13 14:04:17,021 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 79 selfloop transitions, 8 changer transitions 16/133 dead transitions. [2024-11-13 14:04:17,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 133 transitions, 1678 flow [2024-11-13 14:04:17,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:04:17,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 14:04:17,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2024-11-13 14:04:17,023 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2024-11-13 14:04:17,023 INFO L175 Difference]: Start difference. First operand has 87 places, 86 transitions, 1019 flow. Second operand 5 states and 137 transitions. [2024-11-13 14:04:17,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 133 transitions, 1678 flow [2024-11-13 14:04:17,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 133 transitions, 1650 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-11-13 14:04:17,056 INFO L231 Difference]: Finished difference. Result has 90 places, 81 transitions, 904 flow [2024-11-13 14:04:17,057 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=978, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=904, PETRI_PLACES=90, PETRI_TRANSITIONS=81} [2024-11-13 14:04:17,057 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 41 predicate places. [2024-11-13 14:04:17,058 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 81 transitions, 904 flow [2024-11-13 14:04:17,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:04:17,058 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:04:17,058 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:04:17,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 14:04:17,059 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:04:17,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:04:17,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1030053428, now seen corresponding path program 1 times [2024-11-13 14:04:17,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:04:17,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920320640] [2024-11-13 14:04:17,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:04:17,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:04:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:18,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:04:18,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:04:18,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920320640] [2024-11-13 14:04:18,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920320640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:04:18,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:04:18,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 14:04:18,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821160498] [2024-11-13 14:04:18,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:04:18,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 14:04:18,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:04:18,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 14:04:18,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:04:18,374 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-13 14:04:18,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 81 transitions, 904 flow. Second operand has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 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-13 14:04:18,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:04:18,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-13 14:04:18,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:04:19,845 INFO L124 PetriNetUnfolderBase]: 3248/6253 cut-off events. [2024-11-13 14:04:19,845 INFO L125 PetriNetUnfolderBase]: For 31534/33181 co-relation queries the response was YES. [2024-11-13 14:04:19,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27203 conditions, 6253 events. 3248/6253 cut-off events. For 31534/33181 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 50029 event pairs, 1073 based on Foata normal form. 489/6189 useless extension candidates. Maximal degree in co-relation 27172. Up to 2858 conditions per place. [2024-11-13 14:04:19,885 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 44 selfloop transitions, 19 changer transitions 38/139 dead transitions. [2024-11-13 14:04:19,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 139 transitions, 1585 flow [2024-11-13 14:04:19,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 14:04:19,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-13 14:04:19,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 224 transitions. [2024-11-13 14:04:19,888 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5656565656565656 [2024-11-13 14:04:19,888 INFO L175 Difference]: Start difference. First operand has 90 places, 81 transitions, 904 flow. Second operand 9 states and 224 transitions. [2024-11-13 14:04:19,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 139 transitions, 1585 flow [2024-11-13 14:04:19,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 139 transitions, 1546 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-13 14:04:19,924 INFO L231 Difference]: Finished difference. Result has 100 places, 82 transitions, 977 flow [2024-11-13 14:04:19,925 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=977, PETRI_PLACES=100, PETRI_TRANSITIONS=82} [2024-11-13 14:04:19,925 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 51 predicate places. [2024-11-13 14:04:19,926 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 82 transitions, 977 flow [2024-11-13 14:04:19,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 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-13 14:04:19,926 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:04:19,926 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:04:19,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 14:04:19,927 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:04:19,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:04:19,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1349137058, now seen corresponding path program 1 times [2024-11-13 14:04:19,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:04:19,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459542790] [2024-11-13 14:04:19,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:04:19,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:04:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:20,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:04:20,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:04:20,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459542790] [2024-11-13 14:04:20,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459542790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:04:20,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:04:20,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:04:20,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110005972] [2024-11-13 14:04:20,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:04:20,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:04:20,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:04:20,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:04:20,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:04:20,211 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-13 14:04:20,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 82 transitions, 977 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:04:20,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:04:20,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-13 14:04:20,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:04:21,436 INFO L124 PetriNetUnfolderBase]: 3900/6494 cut-off events. [2024-11-13 14:04:21,436 INFO L125 PetriNetUnfolderBase]: For 57450/58703 co-relation queries the response was YES. [2024-11-13 14:04:21,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30586 conditions, 6494 events. 3900/6494 cut-off events. For 57450/58703 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 43629 event pairs, 396 based on Foata normal form. 881/7154 useless extension candidates. Maximal degree in co-relation 30550. Up to 2464 conditions per place. [2024-11-13 14:04:21,470 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 58 selfloop transitions, 11 changer transitions 30/120 dead transitions. [2024-11-13 14:04:21,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 120 transitions, 1554 flow [2024-11-13 14:04:21,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:04:21,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 14:04:21,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2024-11-13 14:04:21,472 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-11-13 14:04:21,473 INFO L175 Difference]: Start difference. First operand has 100 places, 82 transitions, 977 flow. Second operand 6 states and 150 transitions. [2024-11-13 14:04:21,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 120 transitions, 1554 flow [2024-11-13 14:04:21,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 120 transitions, 1364 flow, removed 85 selfloop flow, removed 11 redundant places. [2024-11-13 14:04:21,531 INFO L231 Difference]: Finished difference. Result has 92 places, 64 transitions, 622 flow [2024-11-13 14:04:21,531 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=622, PETRI_PLACES=92, PETRI_TRANSITIONS=64} [2024-11-13 14:04:21,532 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 43 predicate places. [2024-11-13 14:04:21,532 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 64 transitions, 622 flow [2024-11-13 14:04:21,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:04:21,532 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:04:21,532 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:04:21,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 14:04:21,533 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:04:21,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:04:21,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1860468819, now seen corresponding path program 1 times [2024-11-13 14:04:21,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:04:21,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71881509] [2024-11-13 14:04:21,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:04:21,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:04:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:23,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:04:23,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:04:23,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71881509] [2024-11-13 14:04:23,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71881509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:04:23,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:04:23,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 14:04:23,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964486529] [2024-11-13 14:04:23,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:04:23,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 14:04:23,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:04:23,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 14:04:23,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:04:23,948 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-13 14:04:23,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 64 transitions, 622 flow. Second operand has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 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-13 14:04:23,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:04:23,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-13 14:04:23,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:04:24,556 INFO L124 PetriNetUnfolderBase]: 843/1745 cut-off events. [2024-11-13 14:04:24,556 INFO L125 PetriNetUnfolderBase]: For 8026/8377 co-relation queries the response was YES. [2024-11-13 14:04:24,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6871 conditions, 1745 events. 843/1745 cut-off events. For 8026/8377 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 11548 event pairs, 234 based on Foata normal form. 78/1647 useless extension candidates. Maximal degree in co-relation 6842. Up to 621 conditions per place. [2024-11-13 14:04:24,566 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 32 selfloop transitions, 6 changer transitions 23/89 dead transitions. [2024-11-13 14:04:24,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 89 transitions, 831 flow [2024-11-13 14:04:24,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:04:24,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 14:04:24,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2024-11-13 14:04:24,569 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.538961038961039 [2024-11-13 14:04:24,569 INFO L175 Difference]: Start difference. First operand has 92 places, 64 transitions, 622 flow. Second operand 7 states and 166 transitions. [2024-11-13 14:04:24,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 89 transitions, 831 flow [2024-11-13 14:04:24,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 89 transitions, 670 flow, removed 46 selfloop flow, removed 16 redundant places. [2024-11-13 14:04:24,590 INFO L231 Difference]: Finished difference. Result has 85 places, 57 transitions, 401 flow [2024-11-13 14:04:24,591 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=401, PETRI_PLACES=85, PETRI_TRANSITIONS=57} [2024-11-13 14:04:24,591 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 36 predicate places. [2024-11-13 14:04:24,591 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 57 transitions, 401 flow [2024-11-13 14:04:24,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 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-13 14:04:24,591 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:04:24,591 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:04:24,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 14:04:24,592 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:04:24,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:04:24,592 INFO L85 PathProgramCache]: Analyzing trace with hash -462981715, now seen corresponding path program 2 times [2024-11-13 14:04:24,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:04:24,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102407948] [2024-11-13 14:04:24,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:04:24,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:04:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:04:24,667 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:04:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:04:24,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:04:24,782 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 14:04:24,783 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-13 14:04:24,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-13 14:04:24,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-13 14:04:24,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-13 14:04:24,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-13 14:04:24,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-13 14:04:24,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-13 14:04:24,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 14:04:24,789 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:04:24,893 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 14:04:24,897 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:04:24,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:04:24 BasicIcfg [2024-11-13 14:04:24,905 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:04:24,905 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:04:24,905 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:04:24,906 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:04:24,907 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:03:46" (3/4) ... [2024-11-13 14:04:24,909 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 14:04:24,910 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:04:24,911 INFO L158 Benchmark]: Toolchain (without parser) took 41065.59ms. Allocated memory was 142.6MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 116.8MB in the beginning and 753.0MB in the end (delta: -636.2MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-13 14:04:24,911 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 167.8MB. Free memory is still 104.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:04:24,912 INFO L158 Benchmark]: CACSL2BoogieTranslator took 829.01ms. Allocated memory is still 142.6MB. Free memory was 116.8MB in the beginning and 93.4MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 14:04:24,912 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.19ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 90.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:04:24,912 INFO L158 Benchmark]: Boogie Preprocessor took 99.31ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 88.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:04:24,913 INFO L158 Benchmark]: RCFGBuilder took 1209.43ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 106.4MB in the end (delta: -18.6MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. [2024-11-13 14:04:24,913 INFO L158 Benchmark]: TraceAbstraction took 38827.93ms. Allocated memory was 142.6MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 105.5MB in the beginning and 753.2MB in the end (delta: -647.7MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-13 14:04:24,914 INFO L158 Benchmark]: Witness Printer took 4.78ms. Allocated memory is still 1.9GB. Free memory was 753.2MB in the beginning and 753.0MB in the end (delta: 154.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:04:24,916 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.43ms. Allocated memory is still 167.8MB. Free memory is still 104.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 829.01ms. Allocated memory is still 142.6MB. Free memory was 116.8MB in the beginning and 93.4MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.19ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 90.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 99.31ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 88.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1209.43ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 106.4MB in the end (delta: -18.6MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. * TraceAbstraction took 38827.93ms. Allocated memory was 142.6MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 105.5MB in the beginning and 753.2MB in the end (delta: -647.7MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 4.78ms. Allocated memory is still 1.9GB. Free memory was 753.2MB in the beginning and 753.0MB in the end (delta: 154.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff1_thd0; [L725] 0 _Bool z$r_buff1_thd1; [L726] 0 _Bool z$r_buff1_thd2; [L727] 0 _Bool z$r_buff1_thd3; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L816] 0 pthread_t t2489; [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489=-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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L818] 0 pthread_t t2490; [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489=-3, t2490=-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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L820] 0 pthread_t t2491; [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489=-3, t2490=-2, t2491=-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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0: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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, 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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L788] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L791] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489=-3, t2490=-2, t2491=-1, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L825] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L825] RET 0 assume_abort_if_not(main$tmp_guard0) [L827] 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) [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] 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 [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] 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}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489=-3, t2490=-2, t2491=-1, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489=-3, t2490=-2, t2491=-1, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L17] 0 __assert_fail ("0", "safe030_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 819]: 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: 821]: 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: 817]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 68 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 38.6s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 24.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 757 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 718 mSDsluCounter, 290 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 221 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2176 IncrementalHoareTripleChecker+Invalid, 2269 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 69 mSDtfsCounter, 2176 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1090occurred in iteration=10, InterpolantAutomatonStates: 109, 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.7s SatisfiabilityAnalysisTime, 12.7s InterpolantComputationTime, 329 NumberOfCodeBlocks, 329 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 284 ConstructedInterpolants, 0 QuantifiedInterpolants, 2375 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 14:04:24,953 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:04:28,318 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:04:28,471 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-13 14:04:28,484 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:04:28,484 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:04:28,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:04:28,569 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:04:28,577 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:04:28,578 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:04:28,578 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:04:28,578 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:04:28,578 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:04:28,579 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:04:28,579 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:04:28,579 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:04:28,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:04:28,579 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:04:28,579 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:04:28,580 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:04:28,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:04:28,580 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 14:04:28,580 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 14:04:28,580 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 14:04:28,580 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:04:28,580 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:04:28,580 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 14:04:28,583 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:04:28,587 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 14:04:28,588 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 14:04:28,588 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:04:28,588 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:04:28,588 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:04:28,588 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:04:28,588 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:04:28,588 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:04:28,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:04:28,589 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:04:28,589 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:04:28,589 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 14:04:28,589 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 14:04:28,589 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:04:28,589 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:04:28,589 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:04:28,589 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:04:28,589 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_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 [2024-11-13 14:04:28,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:04:28,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:04:29,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:04:29,003 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:04:29,004 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:04:29,006 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i Unable to find full path for "g++" [2024-11-13 14:04:31,486 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:04:31,957 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:04:31,960 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2024-11-13 14:04:31,993 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/data/353e200a4/6349ae3859894d208c7fc2f583be4458/FLAG64a19a255 [2024-11-13 14:04:32,075 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/data/353e200a4/6349ae3859894d208c7fc2f583be4458 [2024-11-13 14:04:32,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:04:32,082 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:04:32,084 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:04:32,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:04:32,092 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:04:32,094 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:04:32" (1/1) ... [2024-11-13 14:04:32,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a49da81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:04:32, skipping insertion in model container [2024-11-13 14:04:32,098 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:04:32" (1/1) ... [2024-11-13 14:04:32,161 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:04:32,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:04:32,793 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:04:32,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:04:32,955 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:04:32,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:04:32 WrapperNode [2024-11-13 14:04:32,956 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:04:32,959 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:04:32,959 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:04:32,959 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:04:32,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:04:32" (1/1) ... [2024-11-13 14:04:33,001 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:04:32" (1/1) ... [2024-11-13 14:04:33,038 INFO L138 Inliner]: procedures = 176, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-11-13 14:04:33,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:04:33,040 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:04:33,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:04:33,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:04:33,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:04:32" (1/1) ... [2024-11-13 14:04:33,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:04:32" (1/1) ... [2024-11-13 14:04:33,059 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:04:32" (1/1) ... [2024-11-13 14:04:33,085 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 14:04:33,086 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:04:32" (1/1) ... [2024-11-13 14:04:33,086 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:04:32" (1/1) ... [2024-11-13 14:04:33,103 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:04:32" (1/1) ... [2024-11-13 14:04:33,105 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:04:32" (1/1) ... [2024-11-13 14:04:33,112 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:04:32" (1/1) ... [2024-11-13 14:04:33,117 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:04:32" (1/1) ... [2024-11-13 14:04:33,125 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:04:33,126 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:04:33,126 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:04:33,126 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:04:33,127 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:04:32" (1/1) ... [2024-11-13 14:04:33,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:04:33,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:04:33,171 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:04:33,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:04:33,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 14:04:33,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:04:33,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 14:04:33,221 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-13 14:04:33,221 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-13 14:04:33,222 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-13 14:04:33,222 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-13 14:04:33,222 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-13 14:04:33,222 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-13 14:04:33,222 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 14:04:33,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:04:33,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:04:33,225 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 14:04:33,472 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:04:33,475 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:04:33,997 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 14:04:33,997 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:04:34,369 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:04:34,370 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 14:04:34,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:04:34 BoogieIcfgContainer [2024-11-13 14:04:34,371 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:04:34,375 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:04:34,375 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:04:34,382 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:04:34,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:04:32" (1/3) ... [2024-11-13 14:04:34,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@579202d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:04:34, skipping insertion in model container [2024-11-13 14:04:34,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:04:32" (2/3) ... [2024-11-13 14:04:34,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@579202d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:04:34, skipping insertion in model container [2024-11-13 14:04:34,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:04:34" (3/3) ... [2024-11-13 14:04:34,388 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2024-11-13 14:04:34,448 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:04:34,451 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i that has 4 procedures, 43 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-13 14:04:34,452 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 14:04:34,562 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 14:04:34,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2024-11-13 14:04:34,688 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2024-11-13 14:04:34,692 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:04:34,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2024-11-13 14:04:34,698 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2024-11-13 14:04:34,705 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2024-11-13 14:04:34,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:04:34,734 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;@49af6176, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:04:34,734 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-13 14:04:34,739 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 14:04:34,739 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-13 14:04:34,740 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:04:34,740 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:04:34,740 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-13 14:04:34,741 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:04:34,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:04:34,746 INFO L85 PathProgramCache]: Analyzing trace with hash 11936538, now seen corresponding path program 1 times [2024-11-13 14:04:34,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:04:34,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [628093871] [2024-11-13 14:04:34,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:04:34,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:04:34,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:04:34,764 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:04:34,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:04:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:34,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:04:34,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:04:35,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:04:35,008 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:04:35,009 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:04:35,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628093871] [2024-11-13 14:04:35,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628093871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:04:35,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:04:35,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 14:04:35,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938066737] [2024-11-13 14:04:35,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:04:35,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:04:35,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:04:35,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:04:35,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:04:35,067 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 44 [2024-11-13 14:04:35,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:04:35,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:04:35,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 44 [2024-11-13 14:04:35,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:04:35,920 INFO L124 PetriNetUnfolderBase]: 680/1277 cut-off events. [2024-11-13 14:04:35,920 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-13 14:04:35,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 1277 events. 680/1277 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8166 event pairs, 104 based on Foata normal form. 72/1333 useless extension candidates. Maximal degree in co-relation 2342. Up to 844 conditions per place. [2024-11-13 14:04:35,952 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 33 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2024-11-13 14:04:35,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 53 transitions, 195 flow [2024-11-13 14:04:35,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:04:35,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:04:35,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2024-11-13 14:04:35,975 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-11-13 14:04:35,977 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 99 transitions. [2024-11-13 14:04:35,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 53 transitions, 195 flow [2024-11-13 14:04:35,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 190 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-13 14:04:35,995 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2024-11-13 14:04:35,999 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-11-13 14:04:36,007 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-11-13 14:04:36,007 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2024-11-13 14:04:36,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:04:36,008 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:04:36,009 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:04:36,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 14:04:36,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:04:36,213 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:04:36,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:04:36,214 INFO L85 PathProgramCache]: Analyzing trace with hash 18908189, now seen corresponding path program 1 times [2024-11-13 14:04:36,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:04:36,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [695190225] [2024-11-13 14:04:36,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:04:36,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:04:36,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:04:36,219 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:04:36,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 14:04:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:36,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 14:04:36,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:04:36,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:04:36,445 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:04:36,445 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:04:36,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695190225] [2024-11-13 14:04:36,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695190225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:04:36,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:04:36,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 14:04:36,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740687113] [2024-11-13 14:04:36,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:04:36,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:04:36,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:04:36,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:04:36,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:04:36,450 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2024-11-13 14:04:36,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:04:36,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:04:36,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2024-11-13 14:04:36,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:04:36,912 INFO L124 PetriNetUnfolderBase]: 605/1137 cut-off events. [2024-11-13 14:04:36,914 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-11-13 14:04:36,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2181 conditions, 1137 events. 605/1137 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7018 event pairs, 605 based on Foata normal form. 36/1123 useless extension candidates. Maximal degree in co-relation 2171. Up to 926 conditions per place. [2024-11-13 14:04:36,932 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 18 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-11-13 14:04:36,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 120 flow [2024-11-13 14:04:36,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:04:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 14:04:36,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-11-13 14:04:36,936 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-11-13 14:04:36,936 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 75 transitions. [2024-11-13 14:04:36,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 120 flow [2024-11-13 14:04:36,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 14:04:36,939 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2024-11-13 14:04:36,939 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2024-11-13 14:04:36,940 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2024-11-13 14:04:36,940 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2024-11-13 14:04:36,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:04:36,941 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:04:36,941 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:04:36,968 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 14:04:37,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:04:37,146 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:04:37,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:04:37,147 INFO L85 PathProgramCache]: Analyzing trace with hash 18909800, now seen corresponding path program 1 times [2024-11-13 14:04:37,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:04:37,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [123486424] [2024-11-13 14:04:37,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:04:37,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:04:37,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:04:37,151 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:04:37,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 14:04:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:37,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 14:04:37,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:04:37,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:04:37,370 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:04:37,371 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:04:37,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123486424] [2024-11-13 14:04:37,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123486424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:04:37,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:04:37,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:04:37,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518314448] [2024-11-13 14:04:37,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:04:37,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:04:37,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:04:37,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:04:37,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:04:37,389 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-13 14:04:37,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:04:37,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:04:37,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-13 14:04:37,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:04:37,988 INFO L124 PetriNetUnfolderBase]: 1363/2295 cut-off events. [2024-11-13 14:04:37,988 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 14:04:37,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4413 conditions, 2295 events. 1363/2295 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 13820 event pairs, 149 based on Foata normal form. 80/2328 useless extension candidates. Maximal degree in co-relation 4407. Up to 1297 conditions per place. [2024-11-13 14:04:38,012 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 40 selfloop transitions, 5 changer transitions 1/57 dead transitions. [2024-11-13 14:04:38,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 218 flow [2024-11-13 14:04:38,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:04:38,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 14:04:38,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2024-11-13 14:04:38,014 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2024-11-13 14:04:38,014 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 4 states and 108 transitions. [2024-11-13 14:04:38,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 218 flow [2024-11-13 14:04:38,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 14:04:38,018 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 109 flow [2024-11-13 14:04:38,018 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-11-13 14:04:38,019 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2024-11-13 14:04:38,019 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 109 flow [2024-11-13 14:04:38,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:04:38,020 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:04:38,020 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:04:38,046 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-13 14:04:38,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:04:38,221 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:04:38,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:04:38,222 INFO L85 PathProgramCache]: Analyzing trace with hash 763898825, now seen corresponding path program 1 times [2024-11-13 14:04:38,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:04:38,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2052327277] [2024-11-13 14:04:38,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:04:38,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:04:38,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:04:38,226 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:04:38,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 14:04:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:38,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:04:38,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:04:38,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:04:38,450 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:04:38,450 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:04:38,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052327277] [2024-11-13 14:04:38,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052327277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:04:38,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:04:38,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:04:38,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908630826] [2024-11-13 14:04:38,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:04:38,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:04:38,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:04:38,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:04:38,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:04:38,481 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-13 14:04:38,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:04:38,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:04:38,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-13 14:04:38,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:04:38,963 INFO L124 PetriNetUnfolderBase]: 879/1511 cut-off events. [2024-11-13 14:04:38,964 INFO L125 PetriNetUnfolderBase]: For 374/374 co-relation queries the response was YES. [2024-11-13 14:04:38,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3440 conditions, 1511 events. 879/1511 cut-off events. For 374/374 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8068 event pairs, 75 based on Foata normal form. 68/1540 useless extension candidates. Maximal degree in co-relation 3431. Up to 625 conditions per place. [2024-11-13 14:04:38,978 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 50 selfloop transitions, 8 changer transitions 1/70 dead transitions. [2024-11-13 14:04:38,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 70 transitions, 314 flow [2024-11-13 14:04:38,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:04:38,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 14:04:38,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2024-11-13 14:04:38,980 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2024-11-13 14:04:38,980 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 109 flow. Second operand 5 states and 136 transitions. [2024-11-13 14:04:38,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 70 transitions, 314 flow [2024-11-13 14:04:38,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 304 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-13 14:04:38,984 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 149 flow [2024-11-13 14:04:38,985 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2024-11-13 14:04:38,985 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2024-11-13 14:04:38,986 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 149 flow [2024-11-13 14:04:38,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:04:38,986 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:04:38,986 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:04:39,011 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 14:04:39,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:04:39,192 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:04:39,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:04:39,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1947523095, now seen corresponding path program 1 times [2024-11-13 14:04:39,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:04:39,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [143499705] [2024-11-13 14:04:39,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:04:39,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:04:39,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:04:39,199 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:04:39,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 14:04:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:39,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:04:39,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:04:39,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:04:39,478 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:04:39,478 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:04:39,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143499705] [2024-11-13 14:04:39,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143499705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:04:39,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:04:39,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:04:39,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273302715] [2024-11-13 14:04:39,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:04:39,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:04:39,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:04:39,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:04:39,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:04:39,493 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-11-13 14:04:39,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 149 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:04:39,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:04:39,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-11-13 14:04:39,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:04:39,997 INFO L124 PetriNetUnfolderBase]: 491/839 cut-off events. [2024-11-13 14:04:39,997 INFO L125 PetriNetUnfolderBase]: For 674/674 co-relation queries the response was YES. [2024-11-13 14:04:40,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2178 conditions, 839 events. 491/839 cut-off events. For 674/674 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3707 event pairs, 61 based on Foata normal form. 36/841 useless extension candidates. Maximal degree in co-relation 2167. Up to 268 conditions per place. [2024-11-13 14:04:40,007 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 44 selfloop transitions, 11 changer transitions 1/67 dead transitions. [2024-11-13 14:04:40,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 325 flow [2024-11-13 14:04:40,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:04:40,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 14:04:40,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2024-11-13 14:04:40,011 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2024-11-13 14:04:40,013 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 149 flow. Second operand 6 states and 148 transitions. [2024-11-13 14:04:40,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 325 flow [2024-11-13 14:04:40,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 300 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-13 14:04:40,020 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 163 flow [2024-11-13 14:04:40,021 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2024-11-13 14:04:40,022 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2024-11-13 14:04:40,022 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 163 flow [2024-11-13 14:04:40,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:04:40,022 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:04:40,022 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:04:40,048 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 14:04:40,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:04:40,224 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:04:40,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:04:40,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1445209619, now seen corresponding path program 1 times [2024-11-13 14:04:40,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:04:40,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [560322776] [2024-11-13 14:04:40,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:04:40,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:04:40,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:04:40,230 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:04:40,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 14:04:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:04:40,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-13 14:04:40,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:04:41,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:04:41,183 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:04:41,183 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:04:41,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560322776] [2024-11-13 14:04:41,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560322776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:04:41,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:04:41,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 14:04:41,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549560339] [2024-11-13 14:04:41,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:04:41,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 14:04:41,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:04:41,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 14:04:41,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:04:41,218 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-13 14:04:41,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 163 flow. Second operand has 9 states, 9 states have (on average 19.0) internal successors, (171), 9 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:04:41,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:04:41,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-13 14:04:41,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:04:41,783 INFO L124 PetriNetUnfolderBase]: 505/962 cut-off events. [2024-11-13 14:04:41,784 INFO L125 PetriNetUnfolderBase]: For 390/411 co-relation queries the response was YES. [2024-11-13 14:04:41,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2217 conditions, 962 events. 505/962 cut-off events. For 390/411 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4898 event pairs, 201 based on Foata normal form. 8/907 useless extension candidates. Maximal degree in co-relation 2205. Up to 484 conditions per place. [2024-11-13 14:04:41,792 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 25 selfloop transitions, 4 changer transitions 14/62 dead transitions. [2024-11-13 14:04:41,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 62 transitions, 305 flow [2024-11-13 14:04:41,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:04:41,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 14:04:41,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2024-11-13 14:04:41,794 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5292207792207793 [2024-11-13 14:04:41,794 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 163 flow. Second operand 7 states and 163 transitions. [2024-11-13 14:04:41,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 62 transitions, 305 flow [2024-11-13 14:04:41,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 62 transitions, 238 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-11-13 14:04:41,806 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 134 flow [2024-11-13 14:04:41,807 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=134, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2024-11-13 14:04:41,808 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2024-11-13 14:04:41,809 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 134 flow [2024-11-13 14:04:41,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.0) internal successors, (171), 9 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:04:41,810 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:04:41,810 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:04:41,836 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-13 14:04:42,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:04:42,011 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:04:42,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:04:42,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1188579421, now seen corresponding path program 2 times [2024-11-13 14:04:42,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:04:42,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1925135469] [2024-11-13 14:04:42,012 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:04:42,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:04:42,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:04:42,017 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:04:42,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 14:04:42,167 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 14:04:42,167 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:04:42,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-13 14:04:42,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:04:43,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:04:43,030 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:04:43,030 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:04:43,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925135469] [2024-11-13 14:04:43,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925135469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:04:43,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:04:43,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 14:04:43,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841538777] [2024-11-13 14:04:43,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:04:43,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 14:04:43,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:04:43,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 14:04:43,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:04:43,043 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2024-11-13 14:04:43,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 134 flow. Second operand has 10 states, 10 states have (on average 18.8) internal successors, (188), 10 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:04:43,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:04:43,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2024-11-13 14:04:43,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:04:43,564 INFO L124 PetriNetUnfolderBase]: 573/1092 cut-off events. [2024-11-13 14:04:43,564 INFO L125 PetriNetUnfolderBase]: For 206/215 co-relation queries the response was YES. [2024-11-13 14:04:43,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2392 conditions, 1092 events. 573/1092 cut-off events. For 206/215 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5843 event pairs, 239 based on Foata normal form. 8/1032 useless extension candidates. Maximal degree in co-relation 2380. Up to 404 conditions per place. [2024-11-13 14:04:43,574 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 24 selfloop transitions, 4 changer transitions 16/63 dead transitions. [2024-11-13 14:04:43,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 63 transitions, 273 flow [2024-11-13 14:04:43,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:04:43,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 14:04:43,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2024-11-13 14:04:43,576 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5292207792207793 [2024-11-13 14:04:43,576 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 134 flow. Second operand 7 states and 163 transitions. [2024-11-13 14:04:43,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 63 transitions, 273 flow [2024-11-13 14:04:43,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 63 transitions, 258 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-13 14:04:43,580 INFO L231 Difference]: Finished difference. Result has 58 places, 42 transitions, 142 flow [2024-11-13 14:04:43,580 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=142, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2024-11-13 14:04:43,581 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2024-11-13 14:04:43,581 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 142 flow [2024-11-13 14:04:43,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.8) internal successors, (188), 10 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:04:43,582 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:04:43,582 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:04:43,610 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-13 14:04:43,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:04:43,783 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:04:43,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:04:43,783 INFO L85 PathProgramCache]: Analyzing trace with hash 50392787, now seen corresponding path program 3 times [2024-11-13 14:04:43,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:04:43,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [964674213] [2024-11-13 14:04:43,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 14:04:43,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:04:43,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:04:43,789 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:04:43,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 14:04:43,918 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-13 14:04:43,918 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:04:43,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:04:43,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:04:44,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:04:44,259 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:04:44,259 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:04:44,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964674213] [2024-11-13 14:04:44,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964674213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:04:44,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:04:44,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:04:44,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040006276] [2024-11-13 14:04:44,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:04:44,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:04:44,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:04:44,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:04:44,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:04:44,271 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-11-13 14:04:44,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:04:44,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:04:44,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-11-13 14:04:44,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:04:44,727 INFO L124 PetriNetUnfolderBase]: 657/1209 cut-off events. [2024-11-13 14:04:44,728 INFO L125 PetriNetUnfolderBase]: For 318/351 co-relation queries the response was YES. [2024-11-13 14:04:44,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2777 conditions, 1209 events. 657/1209 cut-off events. For 318/351 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6523 event pairs, 305 based on Foata normal form. 12/1137 useless extension candidates. Maximal degree in co-relation 2764. Up to 603 conditions per place. [2024-11-13 14:04:44,739 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 31 selfloop transitions, 2 changer transitions 19/70 dead transitions. [2024-11-13 14:04:44,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 70 transitions, 329 flow [2024-11-13 14:04:44,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:04:44,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 14:04:44,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2024-11-13 14:04:44,742 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5492424242424242 [2024-11-13 14:04:44,743 INFO L175 Difference]: Start difference. First operand has 58 places, 42 transitions, 142 flow. Second operand 6 states and 145 transitions. [2024-11-13 14:04:44,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 70 transitions, 329 flow [2024-11-13 14:04:44,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 299 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-11-13 14:04:44,748 INFO L231 Difference]: Finished difference. Result has 58 places, 42 transitions, 138 flow [2024-11-13 14:04:44,748 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2024-11-13 14:04:44,750 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2024-11-13 14:04:44,750 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 138 flow [2024-11-13 14:04:44,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:04:44,753 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:04:44,753 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:04:44,780 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 14:04:44,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:04:44,954 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:04:44,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:04:44,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1799298273, now seen corresponding path program 4 times [2024-11-13 14:04:44,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:04:44,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [414578346] [2024-11-13 14:04:44,955 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 14:04:44,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:04:44,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:04:44,959 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:04:44,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 14:04:45,089 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 14:04:45,090 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:04:45,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:04:45,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:04:45,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:04:45,217 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:04:45,217 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:04:45,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414578346] [2024-11-13 14:04:45,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414578346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:04:45,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:04:45,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:04:45,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442127967] [2024-11-13 14:04:45,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:04:45,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:04:45,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:04:45,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:04:45,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:04:45,234 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2024-11-13 14:04:45,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:04:45,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 14:04:45,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2024-11-13 14:04:45,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 14:04:45,617 INFO L124 PetriNetUnfolderBase]: 497/946 cut-off events. [2024-11-13 14:04:45,617 INFO L125 PetriNetUnfolderBase]: For 251/255 co-relation queries the response was YES. [2024-11-13 14:04:45,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2070 conditions, 946 events. 497/946 cut-off events. For 251/255 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4575 event pairs, 201 based on Foata normal form. 12/924 useless extension candidates. Maximal degree in co-relation 2058. Up to 409 conditions per place. [2024-11-13 14:04:45,623 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 27 selfloop transitions, 2 changer transitions 21/68 dead transitions. [2024-11-13 14:04:45,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 68 transitions, 309 flow [2024-11-13 14:04:45,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:04:45,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 14:04:45,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2024-11-13 14:04:45,625 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-11-13 14:04:45,625 INFO L175 Difference]: Start difference. First operand has 58 places, 42 transitions, 138 flow. Second operand 6 states and 143 transitions. [2024-11-13 14:04:45,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 68 transitions, 309 flow [2024-11-13 14:04:45,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 68 transitions, 291 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-11-13 14:04:45,629 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 140 flow [2024-11-13 14:04:45,630 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=140, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2024-11-13 14:04:45,630 INFO L277 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2024-11-13 14:04:45,631 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 140 flow [2024-11-13 14:04:45,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:04:45,631 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 14:04:45,631 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:04:45,656 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 14:04:45,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:04:45,832 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 14:04:45,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:04:45,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1880925251, now seen corresponding path program 5 times [2024-11-13 14:04:45,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:04:45,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1487919914] [2024-11-13 14:04:45,833 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-13 14:04:45,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:04:45,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:04:45,837 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:04:45,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 14:04:45,974 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 14:04:45,974 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-13 14:04:45,975 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:04:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:04:46,095 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-13 14:04:46,095 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 14:04:46,097 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-13 14:04:46,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-13 14:04:46,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-13 14:04:46,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-13 14:04:46,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-13 14:04:46,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-13 14:04:46,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-13 14:04:46,126 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 14:04:46,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:04:46,302 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2024-11-13 14:04:46,395 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 14:04:46,395 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:04:46,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:04:46 BasicIcfg [2024-11-13 14:04:46,406 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:04:46,407 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:04:46,408 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:04:46,408 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:04:46,409 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:04:34" (3/4) ... [2024-11-13 14:04:46,412 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 14:04:46,414 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:04:46,415 INFO L158 Benchmark]: Toolchain (without parser) took 14333.87ms. Allocated memory was 117.4MB in the beginning and 318.8MB in the end (delta: 201.3MB). Free memory was 90.8MB in the beginning and 231.4MB in the end (delta: -140.6MB). Peak memory consumption was 61.4MB. Max. memory is 16.1GB. [2024-11-13 14:04:46,415 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 117.4MB. Free memory is still 84.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:04:46,416 INFO L158 Benchmark]: CACSL2BoogieTranslator took 873.41ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 67.2MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 14:04:46,416 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.50ms. Allocated memory is still 117.4MB. Free memory was 67.2MB in the beginning and 64.6MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:04:46,417 INFO L158 Benchmark]: Boogie Preprocessor took 85.14ms. Allocated memory is still 117.4MB. Free memory was 64.6MB in the beginning and 61.6MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:04:46,418 INFO L158 Benchmark]: RCFGBuilder took 1245.64ms. Allocated memory is still 117.4MB. Free memory was 61.6MB in the beginning and 41.6MB in the end (delta: 19.9MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2024-11-13 14:04:46,418 INFO L158 Benchmark]: TraceAbstraction took 12031.75ms. Allocated memory was 117.4MB in the beginning and 318.8MB in the end (delta: 201.3MB). Free memory was 40.7MB in the beginning and 231.5MB in the end (delta: -190.9MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2024-11-13 14:04:46,419 INFO L158 Benchmark]: Witness Printer took 6.45ms. Allocated memory is still 318.8MB. Free memory was 231.5MB in the beginning and 231.4MB in the end (delta: 96.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:04:46,422 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.55ms. Allocated memory is still 117.4MB. Free memory is still 84.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 873.41ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 67.2MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.50ms. Allocated memory is still 117.4MB. Free memory was 67.2MB in the beginning and 64.6MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 85.14ms. Allocated memory is still 117.4MB. Free memory was 64.6MB in the beginning and 61.6MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1245.64ms. Allocated memory is still 117.4MB. Free memory was 61.6MB in the beginning and 41.6MB in the end (delta: 19.9MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * TraceAbstraction took 12031.75ms. Allocated memory was 117.4MB in the beginning and 318.8MB in the end (delta: 201.3MB). Free memory was 40.7MB in the beginning and 231.5MB in the end (delta: -190.9MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * Witness Printer took 6.45ms. Allocated memory is still 318.8MB. Free memory was 231.5MB in the beginning and 231.4MB in the end (delta: 96.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff1_thd0; [L725] 0 _Bool z$r_buff1_thd1; [L726] 0 _Bool z$r_buff1_thd2; [L727] 0 _Bool z$r_buff1_thd3; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L816] 0 pthread_t t2489; [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0: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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 0 pthread_t t2490; [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489=0, t2490=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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 0 pthread_t t2491; [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489=0, t2490=1, t2491=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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, 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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L788] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L791] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489=0, t2490=1, t2491=2, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L825] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L825] RET 0 assume_abort_if_not(main$tmp_guard0) [L827] 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) [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] 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 [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] 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}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489=0, t2490=1, t2491=2, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489=0, t2490=1, t2491=2, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L17] 0 __assert_fail ("0", "safe030_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 819]: 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: 821]: 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: 817]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 68 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 343 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 321 mSDsluCounter, 141 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 121 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 994 IncrementalHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 20 mSDtfsCounter, 994 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=5, InterpolantAutomatonStates: 47, 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.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 229 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 190 ConstructedInterpolants, 0 QuantifiedInterpolants, 1005 SizeOfPredicates, 25 NumberOfNonLiveVariables, 935 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 14:04:46,465 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a2988fc-5a47-4f65-b7a6-d92ba9fa2865/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample