./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1 --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 b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 15:12:10,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 15:12:11,061 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-12-02 15:12:11,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 15:12:11,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 15:12:11,098 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 15:12:11,099 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 15:12:11,099 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 15:12:11,099 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 15:12:11,100 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 15:12:11,100 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 15:12:11,100 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 15:12:11,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 15:12:11,100 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 15:12:11,101 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 15:12:11,101 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 15:12:11,101 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 15:12:11,101 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 15:12:11,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 15:12:11,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 15:12:11,101 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-02 15:12:11,101 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-02 15:12:11,102 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-02 15:12:11,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 15:12:11,102 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-12-02 15:12:11,102 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-02 15:12:11,102 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 15:12:11,102 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 15:12:11,102 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 15:12:11,102 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 15:12:11,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 15:12:11,102 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 15:12:11,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 15:12:11,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 15:12:11,103 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 15:12:11,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 15:12:11,103 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 15:12:11,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 15:12:11,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 15:12:11,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 15:12:11,104 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 15:12:11,104 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 15:12:11,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 15:12:11,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 15:12:11,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 15:12:11,104 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 15:12:11,104 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 15:12:11,104 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_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1 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 -> b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 [2024-12-02 15:12:11,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 15:12:11,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 15:12:11,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 15:12:11,380 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 15:12:11,380 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 15:12:11,382 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-12-02 15:12:14,782 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/data/01f55ba3e/828d80246d1441798cc6ed14ea937ca7/FLAG2ecafe656 [2024-12-02 15:12:15,083 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 15:12:15,084 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-12-02 15:12:15,100 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/data/01f55ba3e/828d80246d1441798cc6ed14ea937ca7/FLAG2ecafe656 [2024-12-02 15:12:15,120 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/data/01f55ba3e/828d80246d1441798cc6ed14ea937ca7 [2024-12-02 15:12:15,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 15:12:15,125 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 15:12:15,126 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 15:12:15,127 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 15:12:15,132 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 15:12:15,133 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:12:15" (1/1) ... [2024-12-02 15:12:15,134 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ff3c46e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:15, skipping insertion in model container [2024-12-02 15:12:15,135 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:12:15" (1/1) ... [2024-12-02 15:12:15,171 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 15:12:15,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 15:12:15,588 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 15:12:15,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 15:12:15,700 INFO L204 MainTranslator]: Completed translation [2024-12-02 15:12:15,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:15 WrapperNode [2024-12-02 15:12:15,701 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 15:12:15,702 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 15:12:15,702 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 15:12:15,702 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 15:12:15,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:15" (1/1) ... [2024-12-02 15:12:15,724 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:15" (1/1) ... [2024-12-02 15:12:15,746 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 136 [2024-12-02 15:12:15,747 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 15:12:15,747 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 15:12:15,747 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 15:12:15,747 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 15:12:15,756 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:15" (1/1) ... [2024-12-02 15:12:15,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:15" (1/1) ... [2024-12-02 15:12:15,759 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:15" (1/1) ... [2024-12-02 15:12:15,776 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-12-02 15:12:15,776 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:15" (1/1) ... [2024-12-02 15:12:15,777 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:15" (1/1) ... [2024-12-02 15:12:15,785 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:15" (1/1) ... [2024-12-02 15:12:15,786 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:15" (1/1) ... [2024-12-02 15:12:15,789 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:15" (1/1) ... [2024-12-02 15:12:15,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:15" (1/1) ... [2024-12-02 15:12:15,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:15" (1/1) ... [2024-12-02 15:12:15,797 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 15:12:15,798 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 15:12:15,798 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 15:12:15,798 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 15:12:15,799 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:15" (1/1) ... [2024-12-02 15:12:15,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 15:12:15,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:12:15,837 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 15:12:15,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 15:12:15,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-12-02 15:12:15,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 15:12:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-12-02 15:12:15,874 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-12-02 15:12:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-12-02 15:12:15,874 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-12-02 15:12:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-12-02 15:12:15,874 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-12-02 15:12:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 15:12:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-12-02 15:12:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 15:12:15,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 15:12:15,876 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-12-02 15:12:16,022 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 15:12:16,025 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 15:12:16,390 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-02 15:12:16,391 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 15:12:16,648 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 15:12:16,648 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-12-02 15:12:16,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:12:16 BoogieIcfgContainer [2024-12-02 15:12:16,648 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 15:12:16,652 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 15:12:16,652 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 15:12:16,658 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 15:12:16,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:12:15" (1/3) ... [2024-12-02 15:12:16,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba63130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:12:16, skipping insertion in model container [2024-12-02 15:12:16,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:15" (2/3) ... [2024-12-02 15:12:16,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba63130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:12:16, skipping insertion in model container [2024-12-02 15:12:16,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:12:16" (3/3) ... [2024-12-02 15:12:16,661 INFO L128 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-12-02 15:12:16,681 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 15:12:16,683 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 4 procedures, 42 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-12-02 15:12:16,683 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-02 15:12:16,752 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-12-02 15:12:16,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 43 transitions, 98 flow [2024-12-02 15:12:16,839 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2024-12-02 15:12:16,841 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 15:12:16,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 2/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2024-12-02 15:12:16,846 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 43 transitions, 98 flow [2024-12-02 15:12:16,850 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 40 transitions, 89 flow [2024-12-02 15:12:16,859 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 15:12:16,874 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;@5c6e042d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 15:12:16,874 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-12-02 15:12:16,880 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-12-02 15:12:16,880 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-12-02 15:12:16,880 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 15:12:16,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:12:16,881 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-12-02 15:12:16,882 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-12-02 15:12:16,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:12:16,889 INFO L85 PathProgramCache]: Analyzing trace with hash 11842232, now seen corresponding path program 1 times [2024-12-02 15:12:16,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:12:16,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674369226] [2024-12-02 15:12:16,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:12:16,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:12:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:12:17,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:12:17,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:12:17,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674369226] [2024-12-02 15:12:17,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674369226] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:12:17,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:12:17,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 15:12:17,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142783144] [2024-12-02 15:12:17,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:12:17,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 15:12:17,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:12:17,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 15:12:17,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 15:12:17,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2024-12-02 15:12:17,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-12-02 15:12:17,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:12:17,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2024-12-02 15:12:17,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:12:17,950 INFO L124 PetriNetUnfolderBase]: 680/1276 cut-off events. [2024-12-02 15:12:17,950 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-12-02 15:12:17,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2352 conditions, 1276 events. 680/1276 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8113 event pairs, 104 based on Foata normal form. 72/1335 useless extension candidates. Maximal degree in co-relation 2341. Up to 844 conditions per place. [2024-12-02 15:12:17,967 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 33 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2024-12-02 15:12:17,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 193 flow [2024-12-02 15:12:17,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 15:12:17,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 15:12:17,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-12-02 15:12:17,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7441860465116279 [2024-12-02 15:12:17,988 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 89 flow. Second operand 3 states and 96 transitions. [2024-12-02 15:12:17,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 193 flow [2024-12-02 15:12:17,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 52 transitions, 188 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-12-02 15:12:17,999 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 80 flow [2024-12-02 15:12:18,002 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2024-12-02 15:12:18,006 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2024-12-02 15:12:18,007 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 80 flow [2024-12-02 15:12:18,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-12-02 15:12:18,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:12:18,007 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:12:18,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 15:12:18,008 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-12-02 15:12:18,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:12:18,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1141173135, now seen corresponding path program 1 times [2024-12-02 15:12:18,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:12:18,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489681588] [2024-12-02 15:12:18,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:12:18,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:12:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:12:18,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:12:18,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:12:18,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489681588] [2024-12-02 15:12:18,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489681588] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:12:18,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:12:18,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 15:12:18,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170519608] [2024-12-02 15:12:18,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:12:18,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 15:12:18,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:12:18,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 15:12:18,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 15:12:18,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2024-12-02 15:12:18,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-12-02 15:12:18,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:12:18,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2024-12-02 15:12:18,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:12:18,458 INFO L124 PetriNetUnfolderBase]: 605/1133 cut-off events. [2024-12-02 15:12:18,459 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-12-02 15:12:18,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2177 conditions, 1133 events. 605/1133 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6933 event pairs, 605 based on Foata normal form. 36/1130 useless extension candidates. Maximal degree in co-relation 2167. Up to 926 conditions per place. [2024-12-02 15:12:18,466 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 18 selfloop transitions, 1 changer transitions 1/34 dead transitions. [2024-12-02 15:12:18,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 34 transitions, 118 flow [2024-12-02 15:12:18,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 15:12:18,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 15:12:18,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2024-12-02 15:12:18,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5581395348837209 [2024-12-02 15:12:18,468 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 80 flow. Second operand 3 states and 72 transitions. [2024-12-02 15:12:18,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 34 transitions, 118 flow [2024-12-02 15:12:18,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 34 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 15:12:18,470 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2024-12-02 15:12:18,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2024-12-02 15:12:18,471 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2024-12-02 15:12:18,471 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2024-12-02 15:12:18,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-12-02 15:12:18,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:12:18,472 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:12:18,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 15:12:18,472 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-12-02 15:12:18,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:12:18,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1141174531, now seen corresponding path program 1 times [2024-12-02 15:12:18,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:12:18,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248810052] [2024-12-02 15:12:18,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:12:18,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:12:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:12:19,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:12:19,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:12:19,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248810052] [2024-12-02 15:12:19,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248810052] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:12:19,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:12:19,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 15:12:19,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777875874] [2024-12-02 15:12:19,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:12:19,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:12:19,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:12:19,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:12:19,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:12:19,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-12-02 15:12:19,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 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-12-02 15:12:19,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:12:19,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-12-02 15:12:19,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:12:20,954 INFO L124 PetriNetUnfolderBase]: 2216/3594 cut-off events. [2024-12-02 15:12:20,954 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 15:12:20,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6931 conditions, 3594 events. 2216/3594 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 22578 event pairs, 295 based on Foata normal form. 0/3503 useless extension candidates. Maximal degree in co-relation 6925. Up to 1815 conditions per place. [2024-12-02 15:12:20,977 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 41 selfloop transitions, 10 changer transitions 72/133 dead transitions. [2024-12-02 15:12:20,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 133 transitions, 528 flow [2024-12-02 15:12:20,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 15:12:20,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-12-02 15:12:20,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 294 transitions. [2024-12-02 15:12:20,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5697674418604651 [2024-12-02 15:12:20,981 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 12 states and 294 transitions. [2024-12-02 15:12:20,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 133 transitions, 528 flow [2024-12-02 15:12:20,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 133 transitions, 527 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 15:12:20,985 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 170 flow [2024-12-02 15:12:20,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=170, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2024-12-02 15:12:20,986 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 13 predicate places. [2024-12-02 15:12:20,986 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 170 flow [2024-12-02 15:12:20,986 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-12-02 15:12:20,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:12:20,986 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:12:20,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 15:12:20,987 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-12-02 15:12:20,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:12:20,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1468276514, now seen corresponding path program 1 times [2024-12-02 15:12:20,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:12:20,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125068843] [2024-12-02 15:12:20,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:12:20,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:12:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:12:22,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:12:22,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:12:22,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125068843] [2024-12-02 15:12:22,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125068843] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:12:22,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:12:22,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 15:12:22,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908811442] [2024-12-02 15:12:22,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:12:22,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:12:22,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:12:22,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:12:22,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:12:22,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-12-02 15:12:22,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 40 transitions, 170 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 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-12-02 15:12:22,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:12:22,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-12-02 15:12:22,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:12:23,522 INFO L124 PetriNetUnfolderBase]: 2132/3493 cut-off events. [2024-12-02 15:12:23,523 INFO L125 PetriNetUnfolderBase]: For 6890/6890 co-relation queries the response was YES. [2024-12-02 15:12:23,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11827 conditions, 3493 events. 2132/3493 cut-off events. For 6890/6890 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 21311 event pairs, 571 based on Foata normal form. 91/3580 useless extension candidates. Maximal degree in co-relation 11811. Up to 2229 conditions per place. [2024-12-02 15:12:23,561 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 44 selfloop transitions, 16 changer transitions 55/124 dead transitions. [2024-12-02 15:12:23,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 124 transitions, 814 flow [2024-12-02 15:12:23,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 15:12:23,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-12-02 15:12:23,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 238 transitions. [2024-12-02 15:12:23,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5534883720930233 [2024-12-02 15:12:23,563 INFO L175 Difference]: Start difference. First operand has 61 places, 40 transitions, 170 flow. Second operand 10 states and 238 transitions. [2024-12-02 15:12:23,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 124 transitions, 814 flow [2024-12-02 15:12:23,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 124 transitions, 738 flow, removed 38 selfloop flow, removed 5 redundant places. [2024-12-02 15:12:23,613 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 274 flow [2024-12-02 15:12:23,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=274, PETRI_PLACES=64, PETRI_TRANSITIONS=47} [2024-12-02 15:12:23,614 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2024-12-02 15:12:23,615 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 274 flow [2024-12-02 15:12:23,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 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-12-02 15:12:23,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:12:23,615 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:12:23,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 15:12:23,616 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-12-02 15:12:23,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:12:23,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1190111313, now seen corresponding path program 1 times [2024-12-02 15:12:23,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:12:23,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430066347] [2024-12-02 15:12:23,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:12:23,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:12:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:12:24,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:12:24,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:12:24,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430066347] [2024-12-02 15:12:24,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430066347] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:12:24,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:12:24,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 15:12:24,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141700709] [2024-12-02 15:12:24,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:12:24,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:12:24,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:12:24,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:12:24,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:12:24,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-12-02 15:12:24,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:12:24,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:12:24,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-12-02 15:12:24,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:12:25,515 INFO L124 PetriNetUnfolderBase]: 2373/4056 cut-off events. [2024-12-02 15:12:25,515 INFO L125 PetriNetUnfolderBase]: For 15110/15170 co-relation queries the response was YES. [2024-12-02 15:12:25,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16818 conditions, 4056 events. 2373/4056 cut-off events. For 15110/15170 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 27143 event pairs, 543 based on Foata normal form. 165/4180 useless extension candidates. Maximal degree in co-relation 16797. Up to 1595 conditions per place. [2024-12-02 15:12:25,543 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 53 selfloop transitions, 9 changer transitions 33/106 dead transitions. [2024-12-02 15:12:25,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 106 transitions, 836 flow [2024-12-02 15:12:25,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 15:12:25,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-12-02 15:12:25,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions. [2024-12-02 15:12:25,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5697674418604651 [2024-12-02 15:12:25,545 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 274 flow. Second operand 8 states and 196 transitions. [2024-12-02 15:12:25,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 106 transitions, 836 flow [2024-12-02 15:12:25,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 106 transitions, 764 flow, removed 36 selfloop flow, removed 4 redundant places. [2024-12-02 15:12:25,571 INFO L231 Difference]: Finished difference. Result has 67 places, 51 transitions, 329 flow [2024-12-02 15:12:25,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=329, PETRI_PLACES=67, PETRI_TRANSITIONS=51} [2024-12-02 15:12:25,572 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 19 predicate places. [2024-12-02 15:12:25,573 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 51 transitions, 329 flow [2024-12-02 15:12:25,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:12:25,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:12:25,573 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:12:25,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 15:12:25,574 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-12-02 15:12:25,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:12:25,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1963849658, now seen corresponding path program 1 times [2024-12-02 15:12:25,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:12:25,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84997182] [2024-12-02 15:12:25,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:12:25,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:12:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:12:26,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:12:26,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:12:26,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84997182] [2024-12-02 15:12:26,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84997182] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:12:26,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:12:26,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 15:12:26,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138642392] [2024-12-02 15:12:26,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:12:26,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:12:26,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:12:26,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:12:26,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:12:26,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-12-02 15:12:26,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 51 transitions, 329 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:12:26,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:12:26,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-12-02 15:12:26,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:12:27,286 INFO L124 PetriNetUnfolderBase]: 2189/3864 cut-off events. [2024-12-02 15:12:27,287 INFO L125 PetriNetUnfolderBase]: For 12521/12541 co-relation queries the response was YES. [2024-12-02 15:12:27,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15355 conditions, 3864 events. 2189/3864 cut-off events. For 12521/12541 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 25988 event pairs, 439 based on Foata normal form. 137/3992 useless extension candidates. Maximal degree in co-relation 15330. Up to 2042 conditions per place. [2024-12-02 15:12:27,316 INFO L140 encePairwiseOnDemand]: 32/43 looper letters, 49 selfloop transitions, 11 changer transitions 48/119 dead transitions. [2024-12-02 15:12:27,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 119 transitions, 1010 flow [2024-12-02 15:12:27,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 15:12:27,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-12-02 15:12:27,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 226 transitions. [2024-12-02 15:12:27,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5255813953488372 [2024-12-02 15:12:27,318 INFO L175 Difference]: Start difference. First operand has 67 places, 51 transitions, 329 flow. Second operand 10 states and 226 transitions. [2024-12-02 15:12:27,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 119 transitions, 1010 flow [2024-12-02 15:12:27,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 119 transitions, 953 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-12-02 15:12:27,364 INFO L231 Difference]: Finished difference. Result has 76 places, 55 transitions, 407 flow [2024-12-02 15:12:27,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=407, PETRI_PLACES=76, PETRI_TRANSITIONS=55} [2024-12-02 15:12:27,365 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 28 predicate places. [2024-12-02 15:12:27,365 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 55 transitions, 407 flow [2024-12-02 15:12:27,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:12:27,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:12:27,366 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:12:27,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 15:12:27,366 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-12-02 15:12:27,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:12:27,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1127830320, now seen corresponding path program 1 times [2024-12-02 15:12:27,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:12:27,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484671576] [2024-12-02 15:12:27,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:12:27,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:12:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:12:27,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:12:27,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:12:27,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484671576] [2024-12-02 15:12:27,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484671576] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:12:27,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:12:27,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 15:12:27,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726166798] [2024-12-02 15:12:27,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:12:27,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 15:12:27,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:12:27,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 15:12:27,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-12-02 15:12:27,737 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2024-12-02 15:12:27,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 55 transitions, 407 flow. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:12:27,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:12:27,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2024-12-02 15:12:27,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:12:28,426 INFO L124 PetriNetUnfolderBase]: 1806/3150 cut-off events. [2024-12-02 15:12:28,426 INFO L125 PetriNetUnfolderBase]: For 11667/11844 co-relation queries the response was YES. [2024-12-02 15:12:28,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13263 conditions, 3150 events. 1806/3150 cut-off events. For 11667/11844 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 20359 event pairs, 914 based on Foata normal form. 184/3271 useless extension candidates. Maximal degree in co-relation 13232. Up to 2178 conditions per place. [2024-12-02 15:12:28,443 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 39 selfloop transitions, 13 changer transitions 32/105 dead transitions. [2024-12-02 15:12:28,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 105 transitions, 909 flow [2024-12-02 15:12:28,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 15:12:28,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-12-02 15:12:28,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2024-12-02 15:12:28,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5668604651162791 [2024-12-02 15:12:28,445 INFO L175 Difference]: Start difference. First operand has 76 places, 55 transitions, 407 flow. Second operand 8 states and 195 transitions. [2024-12-02 15:12:28,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 105 transitions, 909 flow [2024-12-02 15:12:28,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 105 transitions, 881 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-12-02 15:12:28,473 INFO L231 Difference]: Finished difference. Result has 78 places, 59 transitions, 487 flow [2024-12-02 15:12:28,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=487, PETRI_PLACES=78, PETRI_TRANSITIONS=59} [2024-12-02 15:12:28,474 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 30 predicate places. [2024-12-02 15:12:28,474 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 59 transitions, 487 flow [2024-12-02 15:12:28,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:12:28,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:12:28,474 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:12:28,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 15:12:28,475 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-12-02 15:12:28,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:12:28,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1205174585, now seen corresponding path program 1 times [2024-12-02 15:12:28,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:12:28,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097370969] [2024-12-02 15:12:28,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:12:28,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:12:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:12:28,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:12:28,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:12:28,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097370969] [2024-12-02 15:12:28,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097370969] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:12:28,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:12:28,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 15:12:28,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122129420] [2024-12-02 15:12:28,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:12:28,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 15:12:28,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:12:28,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 15:12:28,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-12-02 15:12:28,985 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2024-12-02 15:12:28,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 59 transitions, 487 flow. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:12:28,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:12:28,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2024-12-02 15:12:28,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:12:29,720 INFO L124 PetriNetUnfolderBase]: 1910/3377 cut-off events. [2024-12-02 15:12:29,720 INFO L125 PetriNetUnfolderBase]: For 15604/15791 co-relation queries the response was YES. [2024-12-02 15:12:29,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14989 conditions, 3377 events. 1910/3377 cut-off events. For 15604/15791 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 22301 event pairs, 693 based on Foata normal form. 240/3574 useless extension candidates. Maximal degree in co-relation 14955. Up to 2214 conditions per place. [2024-12-02 15:12:29,740 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 51 selfloop transitions, 9 changer transitions 36/117 dead transitions. [2024-12-02 15:12:29,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 117 transitions, 1121 flow [2024-12-02 15:12:29,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 15:12:29,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-12-02 15:12:29,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2024-12-02 15:12:29,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5726744186046512 [2024-12-02 15:12:29,743 INFO L175 Difference]: Start difference. First operand has 78 places, 59 transitions, 487 flow. Second operand 8 states and 197 transitions. [2024-12-02 15:12:29,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 117 transitions, 1121 flow [2024-12-02 15:12:29,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 117 transitions, 1065 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-12-02 15:12:29,788 INFO L231 Difference]: Finished difference. Result has 79 places, 63 transitions, 544 flow [2024-12-02 15:12:29,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=544, PETRI_PLACES=79, PETRI_TRANSITIONS=63} [2024-12-02 15:12:29,789 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 31 predicate places. [2024-12-02 15:12:29,789 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 63 transitions, 544 flow [2024-12-02 15:12:29,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:12:29,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:12:29,790 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:12:29,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 15:12:29,790 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-12-02 15:12:29,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:12:29,791 INFO L85 PathProgramCache]: Analyzing trace with hash 17697365, now seen corresponding path program 1 times [2024-12-02 15:12:29,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:12:29,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196923353] [2024-12-02 15:12:29,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:12:29,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:12:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:12:30,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:12:30,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:12:30,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196923353] [2024-12-02 15:12:30,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196923353] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:12:30,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:12:30,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 15:12:30,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49655210] [2024-12-02 15:12:30,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:12:30,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-12-02 15:12:30,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:12:30,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 15:12:30,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-12-02 15:12:30,795 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2024-12-02 15:12:30,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 63 transitions, 544 flow. Second operand has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 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-12-02 15:12:30,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:12:30,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2024-12-02 15:12:30,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:12:31,720 INFO L124 PetriNetUnfolderBase]: 2010/3549 cut-off events. [2024-12-02 15:12:31,720 INFO L125 PetriNetUnfolderBase]: For 25680/25819 co-relation queries the response was YES. [2024-12-02 15:12:31,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18573 conditions, 3549 events. 2010/3549 cut-off events. For 25680/25819 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 23385 event pairs, 486 based on Foata normal form. 188/3712 useless extension candidates. Maximal degree in co-relation 18539. Up to 2230 conditions per place. [2024-12-02 15:12:31,753 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 59 selfloop transitions, 26 changer transitions 49/155 dead transitions. [2024-12-02 15:12:31,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 155 transitions, 1781 flow [2024-12-02 15:12:31,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-02 15:12:31,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-12-02 15:12:31,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 264 transitions. [2024-12-02 15:12:31,755 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5581395348837209 [2024-12-02 15:12:31,755 INFO L175 Difference]: Start difference. First operand has 79 places, 63 transitions, 544 flow. Second operand 11 states and 264 transitions. [2024-12-02 15:12:31,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 155 transitions, 1781 flow [2024-12-02 15:12:31,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 155 transitions, 1737 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-12-02 15:12:31,791 INFO L231 Difference]: Finished difference. Result has 90 places, 82 transitions, 909 flow [2024-12-02 15:12:31,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=909, PETRI_PLACES=90, PETRI_TRANSITIONS=82} [2024-12-02 15:12:31,792 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 42 predicate places. [2024-12-02 15:12:31,792 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 82 transitions, 909 flow [2024-12-02 15:12:31,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 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-12-02 15:12:31,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:12:31,793 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:12:31,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 15:12:31,793 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-12-02 15:12:31,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:12:31,793 INFO L85 PathProgramCache]: Analyzing trace with hash 723154124, now seen corresponding path program 1 times [2024-12-02 15:12:31,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:12:31,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205198491] [2024-12-02 15:12:31,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:12:31,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:12:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:12:31,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-12-02 15:12:31,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:12:31,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205198491] [2024-12-02 15:12:31,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205198491] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:12:31,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:12:31,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 15:12:31,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529531375] [2024-12-02 15:12:31,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:12:31,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 15:12:31,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:12:31,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 15:12:31,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 15:12:31,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-12-02 15:12:31,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 82 transitions, 909 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-12-02 15:12:31,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:12:31,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-12-02 15:12:31,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:12:32,280 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([364] L769-->L776: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_30 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_28 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_61 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_76 256) 0)))) (.cse0 (and .cse5 .cse2))) (and (= v_~y$w_buff1_used~0_60 (ite (= (mod (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_61) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256))) .cse2) (and .cse3 (not (= (mod v_~y$w_buff1_used~0_60 256) 0)))) 0 v_~y$r_buff1_thd2~0_28) 256) 0) 0 1) v_~y$r_buff1_thd2~0_27) (= v_~y~0_21 (ite .cse4 v_~y$w_buff0~0_21 (ite .cse1 v_~y$w_buff1~0_16 v_~y~0_22))) (= v_~y$w_buff0_used~0_75 (ite (= (mod (ite .cse4 0 v_~y$w_buff0_used~0_76) 256) 0) 0 1)) (= (ite (= (mod (ite .cse0 0 v_~y$r_buff0_thd2~0_30) 256) 0) 0 1) v_~y$r_buff0_thd2~0_29)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_76, ~y$w_buff1~0=v_~y$w_buff1~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_21, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_30, ~y~0=v_~y~0_22, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_61} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_75, ~y$w_buff1~0=v_~y$w_buff1~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_21, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_21, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_60} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][42], [60#true, 30#L776true, 50#true, 87#true, Black: 75#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 73#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 63#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 132#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 62#(= ~x~0 0), Black: 208#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd2~0 256) 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y~0 ~y$w_buff1~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 2 ~y$w_buff0~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 131#(= ~__unbuffered_p2_EAX~0 0), Black: 199#(not (= (mod ~main$tmp_guard1~0 256) 0)), Black: 210#(and (<= 0 (div ~y$r_buff0_thd0~0 256)) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd0~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= 2 ~y$w_buff1~0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 198#(and (<= 0 (div ~y$r_buff0_thd0~0 256)) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~y$w_buff1~0))), Black: 206#(and (<= 0 (div ~y$r_buff0_thd0~0 256)) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~y$w_buff1~0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 196#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd2~0 256) 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0)), 48#true, Black: 202#(and (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (<= (mod ~y$r_buff0_thd2~0 256) 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), 19#L759true, Black: 204#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd2~0 256) 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 212#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 59#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 193#true, Black: 90#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 96#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$w_buff0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 158#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), Black: 89#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 52#true, Black: 94#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y$w_buff0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 34#L821true, 227#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 31#L789true, 129#true, Black: 183#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 113#(= ~x~0 1), Black: 185#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$r_buff1_thd0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 114#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 176#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0))]) [2024-12-02 15:12:32,280 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is not cut-off event [2024-12-02 15:12:32,281 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-12-02 15:12:32,281 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-12-02 15:12:32,281 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is not cut-off event [2024-12-02 15:12:32,296 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([364] L769-->L776: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_30 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_28 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_61 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_76 256) 0)))) (.cse0 (and .cse5 .cse2))) (and (= v_~y$w_buff1_used~0_60 (ite (= (mod (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_61) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256))) .cse2) (and .cse3 (not (= (mod v_~y$w_buff1_used~0_60 256) 0)))) 0 v_~y$r_buff1_thd2~0_28) 256) 0) 0 1) v_~y$r_buff1_thd2~0_27) (= v_~y~0_21 (ite .cse4 v_~y$w_buff0~0_21 (ite .cse1 v_~y$w_buff1~0_16 v_~y~0_22))) (= v_~y$w_buff0_used~0_75 (ite (= (mod (ite .cse4 0 v_~y$w_buff0_used~0_76) 256) 0) 0 1)) (= (ite (= (mod (ite .cse0 0 v_~y$r_buff0_thd2~0_30) 256) 0) 0 1) v_~y$r_buff0_thd2~0_29)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_76, ~y$w_buff1~0=v_~y$w_buff1~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_21, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_30, ~y~0=v_~y~0_22, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_61} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_75, ~y$w_buff1~0=v_~y$w_buff1~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_21, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_21, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_60} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][41], [60#true, 30#L776true, 50#true, 87#true, Black: 75#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 73#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 225#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 132#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 63#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 62#(= ~x~0 0), Black: 208#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd2~0 256) 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y~0 ~y$w_buff1~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 2 ~y$w_buff0~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 131#(= ~__unbuffered_p2_EAX~0 0), Black: 199#(not (= (mod ~main$tmp_guard1~0 256) 0)), Black: 210#(and (<= 0 (div ~y$r_buff0_thd0~0 256)) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd0~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= 2 ~y$w_buff1~0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 198#(and (<= 0 (div ~y$r_buff0_thd0~0 256)) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~y$w_buff1~0))), Black: 206#(and (<= 0 (div ~y$r_buff0_thd0~0 256)) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~y$w_buff1~0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 196#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd2~0 256) 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0)), 48#true, Black: 202#(and (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (<= (mod ~y$r_buff0_thd2~0 256) 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), Black: 204#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd2~0 256) 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 212#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 59#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 193#true, Black: 90#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), 14#L762true, Black: 96#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$w_buff0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 158#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), Black: 89#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 52#true, Black: 94#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y$w_buff0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 34#L821true, 31#L789true, 129#true, Black: 183#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 113#(= ~x~0 1), Black: 185#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$r_buff1_thd0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 114#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 176#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0))]) [2024-12-02 15:12:32,296 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-12-02 15:12:32,296 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-12-02 15:12:32,296 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-12-02 15:12:32,296 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-12-02 15:12:32,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([364] L769-->L776: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_75 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_30 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_28 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_61 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_76 256) 0)))) (.cse0 (and .cse5 .cse2))) (and (= v_~y$w_buff1_used~0_60 (ite (= (mod (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_61) 256) 0) 0 1)) (= (ite (= (mod (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256))) .cse2) (and .cse3 (not (= (mod v_~y$w_buff1_used~0_60 256) 0)))) 0 v_~y$r_buff1_thd2~0_28) 256) 0) 0 1) v_~y$r_buff1_thd2~0_27) (= v_~y~0_21 (ite .cse4 v_~y$w_buff0~0_21 (ite .cse1 v_~y$w_buff1~0_16 v_~y~0_22))) (= v_~y$w_buff0_used~0_75 (ite (= (mod (ite .cse4 0 v_~y$w_buff0_used~0_76) 256) 0) 0 1)) (= (ite (= (mod (ite .cse0 0 v_~y$r_buff0_thd2~0_30) 256) 0) 0 1) v_~y$r_buff0_thd2~0_29)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_76, ~y$w_buff1~0=v_~y$w_buff1~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_21, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_30, ~y~0=v_~y~0_22, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_61} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_75, ~y$w_buff1~0=v_~y$w_buff1~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_21, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_21, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_60} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][41], [60#true, 30#L776true, 50#true, 87#true, Black: 75#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 73#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 225#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 132#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 63#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 62#(= ~x~0 0), Black: 208#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd2~0 256) 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y~0 ~y$w_buff1~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 2 ~y$w_buff0~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 131#(= ~__unbuffered_p2_EAX~0 0), Black: 199#(not (= (mod ~main$tmp_guard1~0 256) 0)), Black: 210#(and (<= 0 (div ~y$r_buff0_thd0~0 256)) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd0~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= 2 ~y$w_buff1~0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 198#(and (<= 0 (div ~y$r_buff0_thd0~0 256)) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~y$w_buff1~0))), Black: 206#(and (<= 0 (div ~y$r_buff0_thd0~0 256)) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~y$w_buff1~0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 196#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd2~0 256) 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0)), 48#true, Black: 202#(and (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (<= (mod ~y$r_buff0_thd2~0 256) 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), Black: 204#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= (mod ~y$r_buff0_thd2~0 256) 0) (<= 0 (div ~y$r_buff0_thd2~0 256)) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 212#(and (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= (mod ~main$tmp_guard1~0 256) 0))), 59#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 193#true, Black: 90#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 96#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$w_buff0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 158#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), Black: 89#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 52#true, Black: 94#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~y$w_buff0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 38#P0EXITtrue, 34#L821true, 31#L789true, 129#true, Black: 113#(= ~x~0 1), Black: 183#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 185#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y$r_buff1_thd0~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 114#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (and (or (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= (mod ~y$w_buff0_used~0 256) 0)) (or (not (= (mod ~y$r_buff1_thd0~0 256) 0)) (not (= (mod ~y$r_buff0_thd0~0 256) 0)))) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0) (not (= (mod ~y$r_buff0_thd0~0 256) 0)) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd0~0 256) 0) (not (= 2 ~x~0)) (not (= 2 ~y$w_buff0~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 176#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0))]) [2024-12-02 15:12:32,361 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-12-02 15:12:32,362 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-12-02 15:12:32,362 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-12-02 15:12:32,362 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-12-02 15:12:32,797 INFO L124 PetriNetUnfolderBase]: 3640/5741 cut-off events. [2024-12-02 15:12:32,797 INFO L125 PetriNetUnfolderBase]: For 72038/73542 co-relation queries the response was YES. [2024-12-02 15:12:32,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31363 conditions, 5741 events. 3640/5741 cut-off events. For 72038/73542 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 34021 event pairs, 623 based on Foata normal form. 529/5982 useless extension candidates. Maximal degree in co-relation 31322. Up to 3028 conditions per place. [2024-12-02 15:12:32,836 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 82 selfloop transitions, 5 changer transitions 11/121 dead transitions. [2024-12-02 15:12:32,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 121 transitions, 1594 flow [2024-12-02 15:12:32,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 15:12:32,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 15:12:32,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2024-12-02 15:12:32,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6046511627906976 [2024-12-02 15:12:32,838 INFO L175 Difference]: Start difference. First operand has 90 places, 82 transitions, 909 flow. Second operand 4 states and 104 transitions. [2024-12-02 15:12:32,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 121 transitions, 1594 flow [2024-12-02 15:12:32,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 121 transitions, 1490 flow, removed 52 selfloop flow, removed 6 redundant places. [2024-12-02 15:12:32,885 INFO L231 Difference]: Finished difference. Result has 83 places, 76 transitions, 768 flow [2024-12-02 15:12:32,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=768, PETRI_PLACES=83, PETRI_TRANSITIONS=76} [2024-12-02 15:12:32,886 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 35 predicate places. [2024-12-02 15:12:32,886 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 76 transitions, 768 flow [2024-12-02 15:12:32,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-12-02 15:12:32,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:12:32,887 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:12:32,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 15:12:32,887 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-12-02 15:12:32,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:12:32,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1664042334, now seen corresponding path program 1 times [2024-12-02 15:12:32,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:12:32,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286997227] [2024-12-02 15:12:32,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:12:32,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:12:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:12:33,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:12:33,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:12:33,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286997227] [2024-12-02 15:12:33,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286997227] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:12:33,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:12:33,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 15:12:33,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481203860] [2024-12-02 15:12:33,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:12:33,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:12:33,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:12:33,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:12:33,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:12:33,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-12-02 15:12:33,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 76 transitions, 768 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 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-12-02 15:12:33,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:12:33,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-12-02 15:12:33,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:12:34,219 INFO L124 PetriNetUnfolderBase]: 2957/5180 cut-off events. [2024-12-02 15:12:34,219 INFO L125 PetriNetUnfolderBase]: For 40904/41319 co-relation queries the response was YES. [2024-12-02 15:12:34,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26426 conditions, 5180 events. 2957/5180 cut-off events. For 40904/41319 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 36687 event pairs, 968 based on Foata normal form. 149/5054 useless extension candidates. Maximal degree in co-relation 26387. Up to 1884 conditions per place. [2024-12-02 15:12:34,253 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 65 selfloop transitions, 6 changer transitions 45/135 dead transitions. [2024-12-02 15:12:34,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 135 transitions, 1576 flow [2024-12-02 15:12:34,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 15:12:34,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-12-02 15:12:34,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2024-12-02 15:12:34,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5614617940199336 [2024-12-02 15:12:34,255 INFO L175 Difference]: Start difference. First operand has 83 places, 76 transitions, 768 flow. Second operand 7 states and 169 transitions. [2024-12-02 15:12:34,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 135 transitions, 1576 flow [2024-12-02 15:12:34,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 135 transitions, 1574 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 15:12:34,293 INFO L231 Difference]: Finished difference. Result has 92 places, 75 transitions, 781 flow [2024-12-02 15:12:34,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=781, PETRI_PLACES=92, PETRI_TRANSITIONS=75} [2024-12-02 15:12:34,294 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 44 predicate places. [2024-12-02 15:12:34,294 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 75 transitions, 781 flow [2024-12-02 15:12:34,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 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-12-02 15:12:34,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:12:34,294 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:12:34,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 15:12:34,294 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-12-02 15:12:34,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:12:34,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1529376862, now seen corresponding path program 2 times [2024-12-02 15:12:34,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:12:34,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365258672] [2024-12-02 15:12:34,295 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 15:12:34,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:12:34,339 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 15:12:34,339 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 15:12:34,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:12:34,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:12:34,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365258672] [2024-12-02 15:12:34,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365258672] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:12:34,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:12:34,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 15:12:34,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208626295] [2024-12-02 15:12:34,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:12:34,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 15:12:34,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:12:34,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 15:12:34,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 15:12:34,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-12-02 15:12:34,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 75 transitions, 781 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-12-02 15:12:34,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:12:34,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-12-02 15:12:34,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:12:35,284 INFO L124 PetriNetUnfolderBase]: 2547/4134 cut-off events. [2024-12-02 15:12:35,284 INFO L125 PetriNetUnfolderBase]: For 44342/44893 co-relation queries the response was YES. [2024-12-02 15:12:35,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21514 conditions, 4134 events. 2547/4134 cut-off events. For 44342/44893 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 23822 event pairs, 375 based on Foata normal form. 374/4283 useless extension candidates. Maximal degree in co-relation 21471. Up to 1246 conditions per place. [2024-12-02 15:12:35,306 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 82 selfloop transitions, 8 changer transitions 7/119 dead transitions. [2024-12-02 15:12:35,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 119 transitions, 1430 flow [2024-12-02 15:12:35,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 15:12:35,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-12-02 15:12:35,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2024-12-02 15:12:35,308 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6139534883720931 [2024-12-02 15:12:35,308 INFO L175 Difference]: Start difference. First operand has 92 places, 75 transitions, 781 flow. Second operand 5 states and 132 transitions. [2024-12-02 15:12:35,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 119 transitions, 1430 flow [2024-12-02 15:12:35,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 119 transitions, 1400 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-12-02 15:12:35,332 INFO L231 Difference]: Finished difference. Result has 88 places, 75 transitions, 751 flow [2024-12-02 15:12:35,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=751, PETRI_PLACES=88, PETRI_TRANSITIONS=75} [2024-12-02 15:12:35,333 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 40 predicate places. [2024-12-02 15:12:35,333 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 75 transitions, 751 flow [2024-12-02 15:12:35,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-12-02 15:12:35,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:12:35,333 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:12:35,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 15:12:35,333 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-12-02 15:12:35,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:12:35,334 INFO L85 PathProgramCache]: Analyzing trace with hash -307555067, now seen corresponding path program 1 times [2024-12-02 15:12:35,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:12:35,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514697330] [2024-12-02 15:12:35,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:12:35,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:12:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:12:35,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:12:35,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:12:35,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514697330] [2024-12-02 15:12:35,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514697330] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:12:35,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:12:35,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 15:12:35,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045631083] [2024-12-02 15:12:35,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:12:35,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:12:35,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:12:35,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:12:35,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:12:35,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-12-02 15:12:35,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 75 transitions, 751 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:12:35,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:12:35,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-12-02 15:12:35,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:12:36,245 INFO L124 PetriNetUnfolderBase]: 1995/3215 cut-off events. [2024-12-02 15:12:36,245 INFO L125 PetriNetUnfolderBase]: For 37370/37846 co-relation queries the response was YES. [2024-12-02 15:12:36,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17835 conditions, 3215 events. 1995/3215 cut-off events. For 37370/37846 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 18236 event pairs, 329 based on Foata normal form. 247/3246 useless extension candidates. Maximal degree in co-relation 17793. Up to 1195 conditions per place. [2024-12-02 15:12:36,262 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 68 selfloop transitions, 11 changer transitions 14/113 dead transitions. [2024-12-02 15:12:36,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 113 transitions, 1281 flow [2024-12-02 15:12:36,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:12:36,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 15:12:36,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2024-12-02 15:12:36,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5581395348837209 [2024-12-02 15:12:36,264 INFO L175 Difference]: Start difference. First operand has 88 places, 75 transitions, 751 flow. Second operand 6 states and 144 transitions. [2024-12-02 15:12:36,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 113 transitions, 1281 flow [2024-12-02 15:12:36,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 113 transitions, 1180 flow, removed 38 selfloop flow, removed 4 redundant places. [2024-12-02 15:12:36,295 INFO L231 Difference]: Finished difference. Result has 91 places, 70 transitions, 654 flow [2024-12-02 15:12:36,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=654, PETRI_PLACES=91, PETRI_TRANSITIONS=70} [2024-12-02 15:12:36,296 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 43 predicate places. [2024-12-02 15:12:36,296 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 70 transitions, 654 flow [2024-12-02 15:12:36,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:12:36,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:12:36,296 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:12:36,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 15:12:36,297 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-12-02 15:12:36,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:12:36,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1986173737, now seen corresponding path program 1 times [2024-12-02 15:12:36,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:12:36,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800073396] [2024-12-02 15:12:36,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:12:36,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:12:36,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:12:37,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:12:37,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 15:12:37,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800073396] [2024-12-02 15:12:37,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800073396] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:12:37,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:12:37,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 15:12:37,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884902238] [2024-12-02 15:12:37,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:12:37,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 15:12:37,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 15:12:37,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 15:12:37,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-12-02 15:12:37,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2024-12-02 15:12:37,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 70 transitions, 654 flow. Second operand has 10 states, 10 states have (on average 17.7) internal successors, (177), 10 states have internal predecessors, (177), 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-12-02 15:12:37,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:12:37,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2024-12-02 15:12:37,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:12:38,598 INFO L124 PetriNetUnfolderBase]: 1464/2943 cut-off events. [2024-12-02 15:12:38,598 INFO L125 PetriNetUnfolderBase]: For 21406/22074 co-relation queries the response was YES. [2024-12-02 15:12:38,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13268 conditions, 2943 events. 1464/2943 cut-off events. For 21406/22074 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 21829 event pairs, 283 based on Foata normal form. 123/2788 useless extension candidates. Maximal degree in co-relation 13226. Up to 1171 conditions per place. [2024-12-02 15:12:38,616 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 36 selfloop transitions, 14 changer transitions 23/102 dead transitions. [2024-12-02 15:12:38,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 102 transitions, 1010 flow [2024-12-02 15:12:38,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 15:12:38,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-12-02 15:12:38,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 182 transitions. [2024-12-02 15:12:38,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5290697674418605 [2024-12-02 15:12:38,618 INFO L175 Difference]: Start difference. First operand has 91 places, 70 transitions, 654 flow. Second operand 8 states and 182 transitions. [2024-12-02 15:12:38,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 102 transitions, 1010 flow [2024-12-02 15:12:38,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 102 transitions, 872 flow, removed 59 selfloop flow, removed 11 redundant places. [2024-12-02 15:12:38,664 INFO L231 Difference]: Finished difference. Result has 91 places, 66 transitions, 577 flow [2024-12-02 15:12:38,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=577, PETRI_PLACES=91, PETRI_TRANSITIONS=66} [2024-12-02 15:12:38,665 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 43 predicate places. [2024-12-02 15:12:38,665 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 66 transitions, 577 flow [2024-12-02 15:12:38,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.7) internal successors, (177), 10 states have internal predecessors, (177), 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-12-02 15:12:38,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:12:38,665 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:12:38,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 15:12:38,665 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-12-02 15:12:38,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:12:38,666 INFO L85 PathProgramCache]: Analyzing trace with hash -345371585, now seen corresponding path program 2 times [2024-12-02 15:12:38,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 15:12:38,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958446763] [2024-12-02 15:12:38,666 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 15:12:38,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 15:12:38,779 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 15:12:38,779 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-12-02 15:12:38,779 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 15:12:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 15:12:38,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 15:12:38,914 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 15:12:38,916 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-12-02 15:12:38,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-12-02 15:12:38,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-12-02 15:12:38,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-12-02 15:12:38,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-12-02 15:12:38,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-12-02 15:12:38,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-12-02 15:12:38,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 15:12:38,919 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:12:38,986 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-12-02 15:12:38,986 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 15:12:38,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:12:38 BasicIcfg [2024-12-02 15:12:38,993 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 15:12:38,994 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 15:12:38,994 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 15:12:38,995 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 15:12:38,995 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:12:16" (3/4) ... [2024-12-02 15:12:38,998 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-12-02 15:12:38,999 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 15:12:39,000 INFO L158 Benchmark]: Toolchain (without parser) took 23875.51ms. Allocated memory was 117.4MB in the beginning and 620.8MB in the end (delta: 503.3MB). Free memory was 91.2MB in the beginning and 558.6MB in the end (delta: -467.4MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. [2024-12-02 15:12:39,000 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 117.4MB. Free memory was 72.2MB in the beginning and 72.1MB in the end (delta: 86.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 15:12:39,001 INFO L158 Benchmark]: CACSL2BoogieTranslator took 574.80ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 67.8MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-02 15:12:39,001 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.25ms. Allocated memory is still 117.4MB. Free memory was 67.8MB in the beginning and 65.2MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 15:12:39,002 INFO L158 Benchmark]: Boogie Preprocessor took 49.65ms. Allocated memory is still 117.4MB. Free memory was 65.2MB in the beginning and 62.1MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 15:12:39,002 INFO L158 Benchmark]: RCFGBuilder took 850.97ms. Allocated memory is still 117.4MB. Free memory was 62.1MB in the beginning and 65.1MB in the end (delta: -3.0MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2024-12-02 15:12:39,002 INFO L158 Benchmark]: TraceAbstraction took 22341.56ms. Allocated memory was 117.4MB in the beginning and 620.8MB in the end (delta: 503.3MB). Free memory was 64.0MB in the beginning and 558.7MB in the end (delta: -494.7MB). Peak memory consumption was 342.0MB. Max. memory is 16.1GB. [2024-12-02 15:12:39,003 INFO L158 Benchmark]: Witness Printer took 4.60ms. Allocated memory is still 620.8MB. Free memory was 558.7MB in the beginning and 558.6MB in the end (delta: 84.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 15:12:39,005 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.32ms. Allocated memory is still 117.4MB. Free memory was 72.2MB in the beginning and 72.1MB in the end (delta: 86.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 574.80ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 67.8MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.25ms. Allocated memory is still 117.4MB. Free memory was 67.8MB in the beginning and 65.2MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.65ms. Allocated memory is still 117.4MB. Free memory was 65.2MB in the beginning and 62.1MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 850.97ms. Allocated memory is still 117.4MB. Free memory was 62.1MB in the beginning and 65.1MB in the end (delta: -3.0MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. * TraceAbstraction took 22341.56ms. Allocated memory was 117.4MB in the beginning and 620.8MB in the end (delta: 503.3MB). Free memory was 64.0MB in the beginning and 558.7MB in the end (delta: -494.7MB). Peak memory consumption was 342.0MB. Max. memory is 16.1GB. * Witness Printer took 4.60ms. Allocated memory is still 620.8MB. Free memory was 558.7MB in the beginning and 558.6MB in the end (delta: 84.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L813] 0 pthread_t t2177; [L814] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L815] 0 pthread_t t2178; [L816] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177=-2, t2178=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L817] 0 pthread_t t2179; [L818] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177=-2, t2178=-1, t2179=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L751] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L768] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L785] 3 __unbuffered_p2_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L788] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177=-2, t2178=-1, t2179=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177=-2, t2178=-1, t2179=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177=-2, t2178=-1, t2179=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L17] 0 __assert_fail ("0", "safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=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: 811]: 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 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: 816]: 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: 818]: 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, 66 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: 22.1s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 706 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 672 mSDsluCounter, 191 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 139 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1955 IncrementalHoareTripleChecker+Invalid, 2045 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 52 mSDtfsCounter, 1955 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=909occurred in iteration=9, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 305 NumberOfCodeBlocks, 305 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 262 ConstructedInterpolants, 0 QuantifiedInterpolants, 2268 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-12-02 15:12:39,030 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1 --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 b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 15:12:41,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 15:12:41,636 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-12-02 15:12:41,646 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 15:12:41,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 15:12:41,676 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 15:12:41,677 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 15:12:41,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 15:12:41,678 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 15:12:41,678 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 15:12:41,678 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 15:12:41,678 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 15:12:41,678 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 15:12:41,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 15:12:41,679 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 15:12:41,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 15:12:41,679 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 15:12:41,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 15:12:41,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 15:12:41,680 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 15:12:41,680 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-02 15:12:41,680 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-02 15:12:41,680 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-02 15:12:41,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 15:12:41,680 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-12-02 15:12:41,680 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-12-02 15:12:41,681 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-12-02 15:12:41,681 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-02 15:12:41,681 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 15:12:41,681 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 15:12:41,681 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 15:12:41,681 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 15:12:41,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 15:12:41,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 15:12:41,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 15:12:41,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 15:12:41,682 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 15:12:41,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 15:12:41,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 15:12:41,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 15:12:41,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 15:12:41,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 15:12:41,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 15:12:41,682 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-12-02 15:12:41,682 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-12-02 15:12:41,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 15:12:41,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 15:12:41,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 15:12:41,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 15:12:41,683 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_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1 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 -> b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 [2024-12-02 15:12:42,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 15:12:42,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 15:12:42,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 15:12:42,025 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 15:12:42,026 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 15:12:42,028 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-12-02 15:12:45,432 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/data/56b128602/6d2dfa4fcc2540acb23b18bf7d385aad/FLAG0cdb78535 [2024-12-02 15:12:45,650 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 15:12:45,651 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-12-02 15:12:45,664 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/data/56b128602/6d2dfa4fcc2540acb23b18bf7d385aad/FLAG0cdb78535 [2024-12-02 15:12:45,677 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/data/56b128602/6d2dfa4fcc2540acb23b18bf7d385aad [2024-12-02 15:12:45,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 15:12:45,680 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 15:12:45,682 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 15:12:45,682 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 15:12:45,685 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 15:12:45,685 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:12:45" (1/1) ... [2024-12-02 15:12:45,686 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@633aca5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:45, skipping insertion in model container [2024-12-02 15:12:45,686 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:12:45" (1/1) ... [2024-12-02 15:12:45,711 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 15:12:46,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 15:12:46,059 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 15:12:46,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 15:12:46,167 INFO L204 MainTranslator]: Completed translation [2024-12-02 15:12:46,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:46 WrapperNode [2024-12-02 15:12:46,168 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 15:12:46,169 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 15:12:46,169 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 15:12:46,169 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 15:12:46,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:46" (1/1) ... [2024-12-02 15:12:46,194 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:46" (1/1) ... [2024-12-02 15:12:46,224 INFO L138 Inliner]: procedures = 176, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-12-02 15:12:46,224 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 15:12:46,225 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 15:12:46,225 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 15:12:46,225 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 15:12:46,237 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:46" (1/1) ... [2024-12-02 15:12:46,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:46" (1/1) ... [2024-12-02 15:12:46,243 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:46" (1/1) ... [2024-12-02 15:12:46,263 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-12-02 15:12:46,263 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:46" (1/1) ... [2024-12-02 15:12:46,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:46" (1/1) ... [2024-12-02 15:12:46,274 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:46" (1/1) ... [2024-12-02 15:12:46,276 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:46" (1/1) ... [2024-12-02 15:12:46,279 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:46" (1/1) ... [2024-12-02 15:12:46,281 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:46" (1/1) ... [2024-12-02 15:12:46,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:46" (1/1) ... [2024-12-02 15:12:46,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 15:12:46,288 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 15:12:46,288 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 15:12:46,288 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 15:12:46,289 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:46" (1/1) ... [2024-12-02 15:12:46,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 15:12:46,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:12:46,338 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 15:12:46,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 15:12:46,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-12-02 15:12:46,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 15:12:46,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-12-02 15:12:46,373 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-12-02 15:12:46,373 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-12-02 15:12:46,373 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-12-02 15:12:46,373 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-12-02 15:12:46,374 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-12-02 15:12:46,374 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-12-02 15:12:46,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-12-02 15:12:46,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 15:12:46,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 15:12:46,375 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-12-02 15:12:46,552 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 15:12:46,554 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 15:12:46,935 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-02 15:12:46,936 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 15:12:47,182 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 15:12:47,183 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-12-02 15:12:47,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:12:47 BoogieIcfgContainer [2024-12-02 15:12:47,183 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 15:12:47,185 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 15:12:47,185 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 15:12:47,190 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 15:12:47,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:12:45" (1/3) ... [2024-12-02 15:12:47,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436eaa1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:12:47, skipping insertion in model container [2024-12-02 15:12:47,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:12:46" (2/3) ... [2024-12-02 15:12:47,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436eaa1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:12:47, skipping insertion in model container [2024-12-02 15:12:47,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:12:47" (3/3) ... [2024-12-02 15:12:47,193 INFO L128 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-12-02 15:12:47,207 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 15:12:47,208 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 4 procedures, 42 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-12-02 15:12:47,209 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-02 15:12:47,280 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-12-02 15:12:47,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 43 transitions, 98 flow [2024-12-02 15:12:47,362 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2024-12-02 15:12:47,365 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 15:12:47,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 2/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2024-12-02 15:12:47,370 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 43 transitions, 98 flow [2024-12-02 15:12:47,374 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 40 transitions, 89 flow [2024-12-02 15:12:47,384 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 15:12:47,399 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;@551d1088, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 15:12:47,399 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-12-02 15:12:47,405 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-12-02 15:12:47,405 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-12-02 15:12:47,405 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 15:12:47,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:12:47,406 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-12-02 15:12:47,406 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-12-02 15:12:47,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:12:47,413 INFO L85 PathProgramCache]: Analyzing trace with hash 11903800, now seen corresponding path program 1 times [2024-12-02 15:12:47,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 15:12:47,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [586612524] [2024-12-02 15:12:47,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:12:47,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:12:47,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:12:47,430 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:12:47,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 15:12:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:12:47,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-02 15:12:47,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:12:47,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:12:47,602 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 15:12:47,603 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 15:12:47,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586612524] [2024-12-02 15:12:47,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586612524] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:12:47,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:12:47,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 15:12:47,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97440083] [2024-12-02 15:12:47,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:12:47,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 15:12:47,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 15:12:47,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 15:12:47,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 15:12:47,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2024-12-02 15:12:47,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-12-02 15:12:47,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:12:47,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2024-12-02 15:12:47,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:12:48,164 INFO L124 PetriNetUnfolderBase]: 680/1276 cut-off events. [2024-12-02 15:12:48,164 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-12-02 15:12:48,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2352 conditions, 1276 events. 680/1276 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8113 event pairs, 104 based on Foata normal form. 72/1335 useless extension candidates. Maximal degree in co-relation 2341. Up to 844 conditions per place. [2024-12-02 15:12:48,180 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 33 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2024-12-02 15:12:48,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 193 flow [2024-12-02 15:12:48,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 15:12:48,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 15:12:48,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-12-02 15:12:48,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7441860465116279 [2024-12-02 15:12:48,199 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 89 flow. Second operand 3 states and 96 transitions. [2024-12-02 15:12:48,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 193 flow [2024-12-02 15:12:48,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 52 transitions, 188 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-12-02 15:12:48,208 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 80 flow [2024-12-02 15:12:48,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2024-12-02 15:12:48,216 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2024-12-02 15:12:48,216 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 80 flow [2024-12-02 15:12:48,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-12-02 15:12:48,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:12:48,217 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:12:48,229 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 15:12:48,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:12:48,418 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-12-02 15:12:48,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:12:48,419 INFO L85 PathProgramCache]: Analyzing trace with hash 534475217, now seen corresponding path program 1 times [2024-12-02 15:12:48,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 15:12:48,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [32701067] [2024-12-02 15:12:48,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:12:48,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:12:48,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:12:48,423 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:12:48,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 15:12:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:12:48,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-12-02 15:12:48,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:12:48,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:12:48,577 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 15:12:48,577 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 15:12:48,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32701067] [2024-12-02 15:12:48,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32701067] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:12:48,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:12:48,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 15:12:48,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939326429] [2024-12-02 15:12:48,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:12:48,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 15:12:48,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 15:12:48,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 15:12:48,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 15:12:48,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2024-12-02 15:12:48,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-12-02 15:12:48,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:12:48,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2024-12-02 15:12:48,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:12:48,885 INFO L124 PetriNetUnfolderBase]: 605/1133 cut-off events. [2024-12-02 15:12:48,885 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-12-02 15:12:48,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2177 conditions, 1133 events. 605/1133 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6932 event pairs, 605 based on Foata normal form. 36/1130 useless extension candidates. Maximal degree in co-relation 2167. Up to 926 conditions per place. [2024-12-02 15:12:48,895 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 18 selfloop transitions, 1 changer transitions 1/34 dead transitions. [2024-12-02 15:12:48,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 34 transitions, 118 flow [2024-12-02 15:12:48,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 15:12:48,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 15:12:48,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2024-12-02 15:12:48,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5581395348837209 [2024-12-02 15:12:48,897 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 80 flow. Second operand 3 states and 72 transitions. [2024-12-02 15:12:48,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 34 transitions, 118 flow [2024-12-02 15:12:48,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 34 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 15:12:48,899 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2024-12-02 15:12:48,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2024-12-02 15:12:48,900 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2024-12-02 15:12:48,901 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2024-12-02 15:12:48,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-12-02 15:12:48,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:12:48,901 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:12:48,913 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 15:12:49,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:12:49,102 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-12-02 15:12:49,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:12:49,103 INFO L85 PathProgramCache]: Analyzing trace with hash 534476613, now seen corresponding path program 1 times [2024-12-02 15:12:49,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 15:12:49,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [154960398] [2024-12-02 15:12:49,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:12:49,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:12:49,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:12:49,107 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:12:49,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 15:12:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:12:49,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-02 15:12:49,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:12:49,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:12:49,269 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 15:12:49,269 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 15:12:49,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154960398] [2024-12-02 15:12:49,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154960398] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:12:49,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:12:49,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 15:12:49,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727982798] [2024-12-02 15:12:49,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:12:49,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 15:12:49,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 15:12:49,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 15:12:49,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 15:12:49,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-12-02 15:12:49,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:12:49,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:12:49,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-12-02 15:12:49,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:12:49,741 INFO L124 PetriNetUnfolderBase]: 1363/2292 cut-off events. [2024-12-02 15:12:49,742 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 15:12:49,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4410 conditions, 2292 events. 1363/2292 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 13567 event pairs, 149 based on Foata normal form. 80/2339 useless extension candidates. Maximal degree in co-relation 4404. Up to 1297 conditions per place. [2024-12-02 15:12:49,759 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 40 selfloop transitions, 5 changer transitions 1/56 dead transitions. [2024-12-02 15:12:49,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 216 flow [2024-12-02 15:12:49,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 15:12:49,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 15:12:49,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2024-12-02 15:12:49,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6046511627906976 [2024-12-02 15:12:49,762 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 4 states and 104 transitions. [2024-12-02 15:12:49,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 216 flow [2024-12-02 15:12:49,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 56 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 15:12:49,765 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 107 flow [2024-12-02 15:12:49,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=107, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-12-02 15:12:49,766 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2024-12-02 15:12:49,766 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 107 flow [2024-12-02 15:12:49,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:12:49,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:12:49,766 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:12:49,778 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-12-02 15:12:49,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:12:49,967 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-12-02 15:12:49,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:12:49,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1440188269, now seen corresponding path program 1 times [2024-12-02 15:12:49,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 15:12:49,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1385474993] [2024-12-02 15:12:49,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:12:49,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:12:49,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:12:49,971 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:12:49,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 15:12:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:12:50,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-02 15:12:50,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:12:50,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:12:50,157 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 15:12:50,157 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 15:12:50,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385474993] [2024-12-02 15:12:50,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385474993] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:12:50,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:12:50,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 15:12:50,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342723559] [2024-12-02 15:12:50,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:12:50,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 15:12:50,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 15:12:50,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 15:12:50,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 15:12:50,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-12-02 15:12:50,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:12:50,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:12:50,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-12-02 15:12:50,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:12:50,587 INFO L124 PetriNetUnfolderBase]: 879/1508 cut-off events. [2024-12-02 15:12:50,587 INFO L125 PetriNetUnfolderBase]: For 392/392 co-relation queries the response was YES. [2024-12-02 15:12:50,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3437 conditions, 1508 events. 879/1508 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7898 event pairs, 75 based on Foata normal form. 68/1550 useless extension candidates. Maximal degree in co-relation 3428. Up to 625 conditions per place. [2024-12-02 15:12:50,598 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 50 selfloop transitions, 8 changer transitions 1/69 dead transitions. [2024-12-02 15:12:50,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 69 transitions, 312 flow [2024-12-02 15:12:50,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 15:12:50,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-12-02 15:12:50,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2024-12-02 15:12:50,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6093023255813953 [2024-12-02 15:12:50,601 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 107 flow. Second operand 5 states and 131 transitions. [2024-12-02 15:12:50,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 69 transitions, 312 flow [2024-12-02 15:12:50,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 69 transitions, 302 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-12-02 15:12:50,604 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 147 flow [2024-12-02 15:12:50,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=147, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2024-12-02 15:12:50,606 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2024-12-02 15:12:50,606 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 147 flow [2024-12-02 15:12:50,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:12:50,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:12:50,606 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:12:50,618 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 15:12:50,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:12:50,807 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-12-02 15:12:50,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:12:50,807 INFO L85 PathProgramCache]: Analyzing trace with hash 972855942, now seen corresponding path program 1 times [2024-12-02 15:12:50,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 15:12:50,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1455908385] [2024-12-02 15:12:50,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:12:50,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:12:50,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:12:50,811 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:12:50,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 15:12:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:12:50,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-02 15:12:50,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:12:51,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:12:51,003 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 15:12:51,004 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 15:12:51,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455908385] [2024-12-02 15:12:51,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455908385] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:12:51,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:12:51,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 15:12:51,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107086268] [2024-12-02 15:12:51,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:12:51,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 15:12:51,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 15:12:51,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 15:12:51,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 15:12:51,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-12-02 15:12:51,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 147 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:12:51,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:12:51,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-12-02 15:12:51,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:12:51,369 INFO L124 PetriNetUnfolderBase]: 491/836 cut-off events. [2024-12-02 15:12:51,369 INFO L125 PetriNetUnfolderBase]: For 674/674 co-relation queries the response was YES. [2024-12-02 15:12:51,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2175 conditions, 836 events. 491/836 cut-off events. For 674/674 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3598 event pairs, 61 based on Foata normal form. 36/846 useless extension candidates. Maximal degree in co-relation 2164. Up to 268 conditions per place. [2024-12-02 15:12:51,375 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 44 selfloop transitions, 11 changer transitions 1/66 dead transitions. [2024-12-02 15:12:51,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 66 transitions, 323 flow [2024-12-02 15:12:51,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:12:51,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 15:12:51,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2024-12-02 15:12:51,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5503875968992248 [2024-12-02 15:12:51,378 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 147 flow. Second operand 6 states and 142 transitions. [2024-12-02 15:12:51,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 66 transitions, 323 flow [2024-12-02 15:12:51,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 298 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-12-02 15:12:51,383 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 161 flow [2024-12-02 15:12:51,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=161, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2024-12-02 15:12:51,384 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2024-12-02 15:12:51,385 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 161 flow [2024-12-02 15:12:51,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:12:51,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:12:51,385 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:12:51,397 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 15:12:51,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:12:51,586 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-12-02 15:12:51,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:12:51,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1607408755, now seen corresponding path program 1 times [2024-12-02 15:12:51,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 15:12:51,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1400215616] [2024-12-02 15:12:51,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:12:51,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:12:51,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:12:51,589 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:12:51,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 15:12:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:12:51,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-12-02 15:12:51,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:12:52,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:12:52,191 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 15:12:52,191 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 15:12:52,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400215616] [2024-12-02 15:12:52,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400215616] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:12:52,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:12:52,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 15:12:52,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274566536] [2024-12-02 15:12:52,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:12:52,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 15:12:52,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 15:12:52,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 15:12:52,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-12-02 15:12:52,209 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2024-12-02 15:12:52,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 161 flow. Second operand has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:12:52,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:12:52,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2024-12-02 15:12:52,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:12:52,557 INFO L124 PetriNetUnfolderBase]: 504/957 cut-off events. [2024-12-02 15:12:52,557 INFO L125 PetriNetUnfolderBase]: For 384/403 co-relation queries the response was YES. [2024-12-02 15:12:52,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2207 conditions, 957 events. 504/957 cut-off events. For 384/403 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4829 event pairs, 232 based on Foata normal form. 8/901 useless extension candidates. Maximal degree in co-relation 2195. Up to 483 conditions per place. [2024-12-02 15:12:52,562 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 25 selfloop transitions, 4 changer transitions 14/61 dead transitions. [2024-12-02 15:12:52,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 61 transitions, 303 flow [2024-12-02 15:12:52,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 15:12:52,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-12-02 15:12:52,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2024-12-02 15:12:52,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5182724252491694 [2024-12-02 15:12:52,564 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 161 flow. Second operand 7 states and 156 transitions. [2024-12-02 15:12:52,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 61 transitions, 303 flow [2024-12-02 15:12:52,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 61 transitions, 236 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-12-02 15:12:52,570 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 132 flow [2024-12-02 15:12:52,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=132, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2024-12-02 15:12:52,571 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2024-12-02 15:12:52,571 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 132 flow [2024-12-02 15:12:52,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:12:52,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:12:52,572 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:12:52,580 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-12-02 15:12:52,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:12:52,772 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-12-02 15:12:52,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:12:52,773 INFO L85 PathProgramCache]: Analyzing trace with hash -2021282583, now seen corresponding path program 2 times [2024-12-02 15:12:52,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 15:12:52,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1588779960] [2024-12-02 15:12:52,774 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 15:12:52,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:12:52,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:12:52,776 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:12:52,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 15:12:52,881 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 15:12:52,881 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 15:12:52,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-12-02 15:12:52,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:12:53,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:12:53,198 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 15:12:53,198 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 15:12:53,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588779960] [2024-12-02 15:12:53,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588779960] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:12:53,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:12:53,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 15:12:53,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848599864] [2024-12-02 15:12:53,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:12:53,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 15:12:53,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 15:12:53,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 15:12:53,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-12-02 15:12:53,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-12-02 15:12:53,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 132 flow. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:12:53,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:12:53,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-12-02 15:12:53,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:12:54,059 INFO L124 PetriNetUnfolderBase]: 1737/3173 cut-off events. [2024-12-02 15:12:54,060 INFO L125 PetriNetUnfolderBase]: For 415/421 co-relation queries the response was YES. [2024-12-02 15:12:54,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7076 conditions, 3173 events. 1737/3173 cut-off events. For 415/421 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 20984 event pairs, 538 based on Foata normal form. 28/3080 useless extension candidates. Maximal degree in co-relation 7064. Up to 882 conditions per place. [2024-12-02 15:12:54,076 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 33 selfloop transitions, 2 changer transitions 63/114 dead transitions. [2024-12-02 15:12:54,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 114 transitions, 529 flow [2024-12-02 15:12:54,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 15:12:54,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-12-02 15:12:54,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 275 transitions. [2024-12-02 15:12:54,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4919499105545617 [2024-12-02 15:12:54,078 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 132 flow. Second operand 13 states and 275 transitions. [2024-12-02 15:12:54,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 114 transitions, 529 flow [2024-12-02 15:12:54,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 114 transitions, 500 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-12-02 15:12:54,084 INFO L231 Difference]: Finished difference. Result has 70 places, 41 transitions, 151 flow [2024-12-02 15:12:54,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=151, PETRI_PLACES=70, PETRI_TRANSITIONS=41} [2024-12-02 15:12:54,085 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 22 predicate places. [2024-12-02 15:12:54,085 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 41 transitions, 151 flow [2024-12-02 15:12:54,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:12:54,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:12:54,086 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:12:54,097 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-02 15:12:54,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:12:54,287 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-12-02 15:12:54,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:12:54,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1534375457, now seen corresponding path program 3 times [2024-12-02 15:12:54,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 15:12:54,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [659942485] [2024-12-02 15:12:54,288 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 15:12:54,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:12:54,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:12:54,290 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:12:54,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-02 15:12:54,391 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-12-02 15:12:54,391 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 15:12:54,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-12-02 15:12:54,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:12:54,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:12:54,909 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 15:12:54,910 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 15:12:54,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659942485] [2024-12-02 15:12:54,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659942485] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:12:54,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:12:54,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 15:12:54,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393152928] [2024-12-02 15:12:54,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:12:54,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 15:12:54,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 15:12:54,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 15:12:54,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-12-02 15:12:54,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2024-12-02 15:12:54,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 41 transitions, 151 flow. Second operand has 10 states, 10 states have (on average 17.8) internal successors, (178), 10 states have internal predecessors, (178), 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-12-02 15:12:54,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:12:54,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2024-12-02 15:12:54,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:12:55,348 INFO L124 PetriNetUnfolderBase]: 561/1068 cut-off events. [2024-12-02 15:12:55,348 INFO L125 PetriNetUnfolderBase]: For 447/465 co-relation queries the response was YES. [2024-12-02 15:12:55,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2461 conditions, 1068 events. 561/1068 cut-off events. For 447/465 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5681 event pairs, 256 based on Foata normal form. 10/1012 useless extension candidates. Maximal degree in co-relation 2442. Up to 417 conditions per place. [2024-12-02 15:12:55,353 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 25 selfloop transitions, 4 changer transitions 15/62 dead transitions. [2024-12-02 15:12:55,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 302 flow [2024-12-02 15:12:55,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 15:12:55,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-12-02 15:12:55,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2024-12-02 15:12:55,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5182724252491694 [2024-12-02 15:12:55,355 INFO L175 Difference]: Start difference. First operand has 70 places, 41 transitions, 151 flow. Second operand 7 states and 156 transitions. [2024-12-02 15:12:55,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 302 flow [2024-12-02 15:12:55,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 262 flow, removed 19 selfloop flow, removed 11 redundant places. [2024-12-02 15:12:55,358 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 152 flow [2024-12-02 15:12:55,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=152, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2024-12-02 15:12:55,359 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 11 predicate places. [2024-12-02 15:12:55,360 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 152 flow [2024-12-02 15:12:55,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.8) internal successors, (178), 10 states have internal predecessors, (178), 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-12-02 15:12:55,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:12:55,360 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:12:55,374 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-12-02 15:12:55,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:12:55,561 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-12-02 15:12:55,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:12:55,561 INFO L85 PathProgramCache]: Analyzing trace with hash -345086843, now seen corresponding path program 4 times [2024-12-02 15:12:55,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 15:12:55,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [41728208] [2024-12-02 15:12:55,562 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-12-02 15:12:55,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:12:55,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:12:55,565 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:12:55,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-02 15:12:55,673 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-12-02 15:12:55,673 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 15:12:55,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-12-02 15:12:55,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:12:55,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:12:55,875 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 15:12:55,875 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 15:12:55,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41728208] [2024-12-02 15:12:55,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41728208] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:12:55,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:12:55,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 15:12:55,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207500667] [2024-12-02 15:12:55,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:12:55,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 15:12:55,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 15:12:55,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 15:12:55,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-12-02 15:12:55,890 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-12-02 15:12:55,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 42 transitions, 152 flow. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:12:55,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 15:12:55,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-12-02 15:12:55,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 15:12:56,232 INFO L124 PetriNetUnfolderBase]: 903/1731 cut-off events. [2024-12-02 15:12:56,233 INFO L125 PetriNetUnfolderBase]: For 546/554 co-relation queries the response was YES. [2024-12-02 15:12:56,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4041 conditions, 1731 events. 903/1731 cut-off events. For 546/554 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 10338 event pairs, 359 based on Foata normal form. 15/1683 useless extension candidates. Maximal degree in co-relation 4027. Up to 704 conditions per place. [2024-12-02 15:12:56,242 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 30 selfloop transitions, 3 changer transitions 22/71 dead transitions. [2024-12-02 15:12:56,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 71 transitions, 353 flow [2024-12-02 15:12:56,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 15:12:56,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 15:12:56,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2024-12-02 15:12:56,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5193798449612403 [2024-12-02 15:12:56,244 INFO L175 Difference]: Start difference. First operand has 59 places, 42 transitions, 152 flow. Second operand 6 states and 134 transitions. [2024-12-02 15:12:56,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 71 transitions, 353 flow [2024-12-02 15:12:56,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 71 transitions, 336 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-12-02 15:12:56,247 INFO L231 Difference]: Finished difference. Result has 59 places, 41 transitions, 149 flow [2024-12-02 15:12:56,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=149, PETRI_PLACES=59, PETRI_TRANSITIONS=41} [2024-12-02 15:12:56,248 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 11 predicate places. [2024-12-02 15:12:56,249 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 41 transitions, 149 flow [2024-12-02 15:12:56,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:12:56,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 15:12:56,249 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:12:56,260 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-12-02 15:12:56,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:12:56,450 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-12-02 15:12:56,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:12:56,450 INFO L85 PathProgramCache]: Analyzing trace with hash -420122107, now seen corresponding path program 5 times [2024-12-02 15:12:56,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 15:12:56,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [674614317] [2024-12-02 15:12:56,450 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-12-02 15:12:56,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:12:56,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:12:56,453 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 15:12:56,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-02 15:12:56,549 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 15:12:56,549 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-12-02 15:12:56,549 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 15:12:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 15:12:56,629 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-12-02 15:12:56,629 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 15:12:56,630 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-12-02 15:12:56,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-12-02 15:12:56,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-12-02 15:12:56,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-12-02 15:12:56,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-12-02 15:12:56,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-12-02 15:12:56,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-12-02 15:12:56,641 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-12-02 15:12:56,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 15:12:56,834 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2024-12-02 15:12:56,903 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-12-02 15:12:56,903 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 15:12:56,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:12:56 BasicIcfg [2024-12-02 15:12:56,910 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 15:12:56,911 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 15:12:56,911 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 15:12:56,911 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 15:12:56,912 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:12:47" (3/4) ... [2024-12-02 15:12:56,914 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-12-02 15:12:56,914 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 15:12:56,915 INFO L158 Benchmark]: Toolchain (without parser) took 11234.87ms. Allocated memory was 92.3MB in the beginning and 167.8MB in the end (delta: 75.5MB). Free memory was 68.7MB in the beginning and 51.6MB in the end (delta: 17.1MB). Peak memory consumption was 94.8MB. Max. memory is 16.1GB. [2024-12-02 15:12:56,916 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 83.9MB. Free memory is still 47.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 15:12:56,916 INFO L158 Benchmark]: CACSL2BoogieTranslator took 486.78ms. Allocated memory is still 92.3MB. Free memory was 68.5MB in the beginning and 45.2MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-02 15:12:56,916 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.49ms. Allocated memory is still 92.3MB. Free memory was 45.2MB in the beginning and 42.8MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 15:12:56,916 INFO L158 Benchmark]: Boogie Preprocessor took 61.88ms. Allocated memory is still 92.3MB. Free memory was 42.8MB in the beginning and 39.7MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 15:12:56,917 INFO L158 Benchmark]: RCFGBuilder took 895.67ms. Allocated memory is still 92.3MB. Free memory was 39.6MB in the beginning and 35.7MB in the end (delta: 3.9MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2024-12-02 15:12:56,917 INFO L158 Benchmark]: TraceAbstraction took 9724.77ms. Allocated memory was 92.3MB in the beginning and 167.8MB in the end (delta: 75.5MB). Free memory was 35.3MB in the beginning and 51.6MB in the end (delta: -16.3MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. [2024-12-02 15:12:56,917 INFO L158 Benchmark]: Witness Printer took 3.94ms. Allocated memory is still 167.8MB. Free memory was 51.6MB in the beginning and 51.6MB in the end (delta: 21.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 15:12:56,919 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.53ms. Allocated memory is still 83.9MB. Free memory is still 47.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 486.78ms. Allocated memory is still 92.3MB. Free memory was 68.5MB in the beginning and 45.2MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.49ms. Allocated memory is still 92.3MB. Free memory was 45.2MB in the beginning and 42.8MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 61.88ms. Allocated memory is still 92.3MB. Free memory was 42.8MB in the beginning and 39.7MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 895.67ms. Allocated memory is still 92.3MB. Free memory was 39.6MB in the beginning and 35.7MB in the end (delta: 3.9MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9724.77ms. Allocated memory was 92.3MB in the beginning and 167.8MB in the end (delta: 75.5MB). Free memory was 35.3MB in the beginning and 51.6MB in the end (delta: -16.3MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. * Witness Printer took 3.94ms. Allocated memory is still 167.8MB. Free memory was 51.6MB in the beginning and 51.6MB in the end (delta: 21.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L813] 0 pthread_t t2177; [L814] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L815] 0 pthread_t t2178; [L816] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177=-1, t2178=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L817] 0 pthread_t t2179; [L818] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177=-1, t2178=0, t2179=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L751] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L768] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L785] 3 __unbuffered_p2_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L788] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177=-1, t2178=0, t2179=1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177=-1, t2178=0, t2179=1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177=-1, t2178=0, t2179=1, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L17] 0 __assert_fail ("0", "safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=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: 811]: 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 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: 816]: 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: 818]: 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, 66 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: 9.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 394 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 368 mSDsluCounter, 150 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 138 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1121 IncrementalHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 12 mSDtfsCounter, 1121 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 207 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=5, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 184 ConstructedInterpolants, 0 QuantifiedInterpolants, 1014 SizeOfPredicates, 27 NumberOfNonLiveVariables, 956 ConjunctsInSsa, 72 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-12-02 15:12:56,935 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07d611cb-cb4c-477e-8e8b-ac8e5bcf0d93/bin/uautomizer-verify-84ZbGMXZE1/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