./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/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_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/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_240c5004-1757-42e1-afe3-383dcde300aa/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 473191b5f1326a38296af26dcd2c7f553c42833f82b512e9fb358484309bc769 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 10:57:13,456 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 10:57:13,510 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-12-02 10:57:13,514 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 10:57:13,514 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 10:57:13,534 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 10:57:13,534 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 10:57:13,534 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 10:57:13,535 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 10:57:13,535 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 10:57:13,535 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 10:57:13,535 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 10:57:13,535 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 10:57:13,536 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 10:57:13,536 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 10:57:13,536 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 10:57:13,536 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 10:57:13,536 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 10:57:13,536 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 10:57:13,536 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 10:57:13,536 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-02 10:57:13,536 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-02 10:57:13,537 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-02 10:57:13,537 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 10:57:13,537 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-12-02 10:57:13,537 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-02 10:57:13,537 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 10:57:13,537 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 10:57:13,537 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 10:57:13,537 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 10:57:13,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 10:57:13,537 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 10:57:13,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 10:57:13,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 10:57:13,538 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 10:57:13,538 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 10:57:13,538 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 10:57:13,538 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 10:57:13,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 10:57:13,538 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 10:57:13,538 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 10:57:13,538 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 10:57:13,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 10:57:13,539 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 10:57:13,539 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 10:57:13,539 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 10:57:13,539 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 10:57:13,539 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_240c5004-1757-42e1-afe3-383dcde300aa/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 -> 473191b5f1326a38296af26dcd2c7f553c42833f82b512e9fb358484309bc769 [2024-12-02 10:57:13,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 10:57:13,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 10:57:13,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 10:57:13,755 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 10:57:13,755 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 10:57:13,757 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-12-02 10:57:16,386 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/data/0b0db1645/a57c3c5b60b4428dbe0e16d19a9935f4/FLAGb917f416d [2024-12-02 10:57:16,631 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 10:57:16,632 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/sv-benchmarks/c/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-12-02 10:57:16,644 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/data/0b0db1645/a57c3c5b60b4428dbe0e16d19a9935f4/FLAGb917f416d [2024-12-02 10:57:16,658 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/data/0b0db1645/a57c3c5b60b4428dbe0e16d19a9935f4 [2024-12-02 10:57:16,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 10:57:16,661 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 10:57:16,662 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 10:57:16,662 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 10:57:16,667 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 10:57:16,667 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:57:16" (1/1) ... [2024-12-02 10:57:16,668 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5800a907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:57:16, skipping insertion in model container [2024-12-02 10:57:16,668 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:57:16" (1/1) ... [2024-12-02 10:57:16,699 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 10:57:16,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 10:57:16,972 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 10:57:17,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 10:57:17,059 INFO L204 MainTranslator]: Completed translation [2024-12-02 10:57:17,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:57:17 WrapperNode [2024-12-02 10:57:17,060 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 10:57:17,061 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 10:57:17,061 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 10:57:17,061 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 10:57:17,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:57:17" (1/1) ... [2024-12-02 10:57:17,076 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:57:17" (1/1) ... [2024-12-02 10:57:17,094 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 156 [2024-12-02 10:57:17,094 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 10:57:17,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 10:57:17,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 10:57:17,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 10:57:17,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:57:17" (1/1) ... [2024-12-02 10:57:17,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:57:17" (1/1) ... [2024-12-02 10:57:17,106 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:57:17" (1/1) ... [2024-12-02 10:57:17,122 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 10:57:17,122 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:57:17" (1/1) ... [2024-12-02 10:57:17,122 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:57:17" (1/1) ... [2024-12-02 10:57:17,130 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:57:17" (1/1) ... [2024-12-02 10:57:17,131 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:57:17" (1/1) ... [2024-12-02 10:57:17,133 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:57:17" (1/1) ... [2024-12-02 10:57:17,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:57:17" (1/1) ... [2024-12-02 10:57:17,136 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:57:17" (1/1) ... [2024-12-02 10:57:17,138 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 10:57:17,139 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 10:57:17,139 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 10:57:17,140 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 10:57:17,140 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:57:17" (1/1) ... [2024-12-02 10:57:17,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 10:57:17,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:57:17,169 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 10:57:17,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 10:57:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-12-02 10:57:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 10:57:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-12-02 10:57:17,190 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-12-02 10:57:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-12-02 10:57:17,190 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-12-02 10:57:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-12-02 10:57:17,190 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-12-02 10:57:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-12-02 10:57:17,190 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-12-02 10:57:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 10:57:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-12-02 10:57:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 10:57:17,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 10:57:17,192 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 10:57:17,300 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 10:57:17,302 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 10:57:17,578 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-02 10:57:17,578 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 10:57:17,779 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 10:57:17,780 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-12-02 10:57:17,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:57:17 BoogieIcfgContainer [2024-12-02 10:57:17,780 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 10:57:17,782 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 10:57:17,782 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 10:57:17,787 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 10:57:17,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 10:57:16" (1/3) ... [2024-12-02 10:57:17,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c19e342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:57:17, skipping insertion in model container [2024-12-02 10:57:17,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:57:17" (2/3) ... [2024-12-02 10:57:17,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c19e342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:57:17, skipping insertion in model container [2024-12-02 10:57:17,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:57:17" (3/3) ... [2024-12-02 10:57:17,789 INFO L128 eAbstractionObserver]: Analyzing ICFG mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-12-02 10:57:17,804 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 10:57:17,806 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i that has 5 procedures, 54 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-12-02 10:57:17,806 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-02 10:57:17,861 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-12-02 10:57:17,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 126 flow [2024-12-02 10:57:17,929 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2024-12-02 10:57:17,931 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 10:57:17,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 113 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2024-12-02 10:57:17,935 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 126 flow [2024-12-02 10:57:17,938 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 114 flow [2024-12-02 10:57:17,946 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 10:57:17,959 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;@36c984c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 10:57:17,959 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-12-02 10:57:17,970 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-12-02 10:57:17,970 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-12-02 10:57:17,970 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 10:57:17,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:57:17,971 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:57:17,971 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-12-02 10:57:17,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:57:17,977 INFO L85 PathProgramCache]: Analyzing trace with hash 463918960, now seen corresponding path program 1 times [2024-12-02 10:57:17,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:57:17,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341952829] [2024-12-02 10:57:17,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:57:17,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:57:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:57:18,401 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 10:57:18,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:57:18,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341952829] [2024-12-02 10:57:18,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341952829] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:57:18,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:57:18,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 10:57:18,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711098408] [2024-12-02 10:57:18,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:57:18,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:57:18,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:57:18,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:57:18,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:57:18,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2024-12-02 10:57:18,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:57:18,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:57:18,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2024-12-02 10:57:18,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:57:18,926 INFO L124 PetriNetUnfolderBase]: 1047/2051 cut-off events. [2024-12-02 10:57:18,926 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 10:57:18,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3611 conditions, 2051 events. 1047/2051 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 15600 event pairs, 219 based on Foata normal form. 96/2117 useless extension candidates. Maximal degree in co-relation 3599. Up to 1153 conditions per place. [2024-12-02 10:57:18,944 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 31 selfloop transitions, 2 changer transitions 2/59 dead transitions. [2024-12-02 10:57:18,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 59 transitions, 200 flow [2024-12-02 10:57:18,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:57:18,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 10:57:18,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2024-12-02 10:57:18,957 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7515151515151515 [2024-12-02 10:57:18,959 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 124 transitions. [2024-12-02 10:57:18,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 59 transitions, 200 flow [2024-12-02 10:57:18,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 59 transitions, 196 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-12-02 10:57:18,966 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2024-12-02 10:57:18,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-12-02 10:57:18,972 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2024-12-02 10:57:18,972 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2024-12-02 10:57:18,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:57:18,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:57:18,972 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 10:57:18,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 10:57:18,973 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-12-02 10:57:18,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:57:18,973 INFO L85 PathProgramCache]: Analyzing trace with hash 784436385, now seen corresponding path program 1 times [2024-12-02 10:57:18,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:57:18,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736801514] [2024-12-02 10:57:18,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:57:18,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:57:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:57:19,072 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 10:57:19,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:57:19,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736801514] [2024-12-02 10:57:19,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736801514] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:57:19,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:57:19,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 10:57:19,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713259265] [2024-12-02 10:57:19,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:57:19,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:57:19,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:57:19,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:57:19,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:57:19,076 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2024-12-02 10:57:19,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:57:19,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:57:19,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2024-12-02 10:57:19,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:57:19,442 INFO L124 PetriNetUnfolderBase]: 931/1635 cut-off events. [2024-12-02 10:57:19,442 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2024-12-02 10:57:19,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3125 conditions, 1635 events. 931/1635 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 11592 event pairs, 931 based on Foata normal form. 48/1617 useless extension candidates. Maximal degree in co-relation 3115. Up to 1352 conditions per place. [2024-12-02 10:57:19,456 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 20 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2024-12-02 10:57:19,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 146 flow [2024-12-02 10:57:19,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:57:19,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 10:57:19,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-12-02 10:57:19,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2024-12-02 10:57:19,458 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 104 transitions. [2024-12-02 10:57:19,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 146 flow [2024-12-02 10:57:19,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 10:57:19,461 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 98 flow [2024-12-02 10:57:19,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2024-12-02 10:57:19,461 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2024-12-02 10:57:19,461 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 98 flow [2024-12-02 10:57:19,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:57:19,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:57:19,462 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 10:57:19,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 10:57:19,462 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-12-02 10:57:19,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:57:19,463 INFO L85 PathProgramCache]: Analyzing trace with hash 784437702, now seen corresponding path program 1 times [2024-12-02 10:57:19,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:57:19,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393630945] [2024-12-02 10:57:19,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:57:19,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:57:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:57:20,159 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 10:57:20,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:57:20,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393630945] [2024-12-02 10:57:20,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393630945] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:57:20,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:57:20,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 10:57:20,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367587483] [2024-12-02 10:57:20,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:57:20,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 10:57:20,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:57:20,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 10:57:20,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:57:20,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-12-02 10:57:20,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 98 flow. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 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 10:57:20,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:57:20,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-12-02 10:57:20,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:57:22,650 INFO L124 PetriNetUnfolderBase]: 15429/23658 cut-off events. [2024-12-02 10:57:22,651 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 10:57:22,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44954 conditions, 23658 events. 15429/23658 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1222. Compared 182452 event pairs, 731 based on Foata normal form. 0/23102 useless extension candidates. Maximal degree in co-relation 44948. Up to 8503 conditions per place. [2024-12-02 10:57:22,741 INFO L140 encePairwiseOnDemand]: 40/55 looper letters, 55 selfloop transitions, 13 changer transitions 107/191 dead transitions. [2024-12-02 10:57:22,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 191 transitions, 752 flow [2024-12-02 10:57:22,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-02 10:57:22,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-12-02 10:57:22,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 430 transitions. [2024-12-02 10:57:22,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2024-12-02 10:57:22,745 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 98 flow. Second operand 12 states and 430 transitions. [2024-12-02 10:57:22,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 191 transitions, 752 flow [2024-12-02 10:57:22,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 191 transitions, 751 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 10:57:22,750 INFO L231 Difference]: Finished difference. Result has 76 places, 55 transitions, 249 flow [2024-12-02 10:57:22,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=249, PETRI_PLACES=76, PETRI_TRANSITIONS=55} [2024-12-02 10:57:22,751 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 14 predicate places. [2024-12-02 10:57:22,751 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 55 transitions, 249 flow [2024-12-02 10:57:22,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 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 10:57:22,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:57:22,751 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:57:22,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 10:57:22,752 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-12-02 10:57:22,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:57:22,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1904923771, now seen corresponding path program 1 times [2024-12-02 10:57:22,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:57:22,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862408656] [2024-12-02 10:57:22,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:57:22,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:57:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:57:22,926 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 10:57:22,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:57:22,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862408656] [2024-12-02 10:57:22,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862408656] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:57:22,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:57:22,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 10:57:22,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988125213] [2024-12-02 10:57:22,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:57:22,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 10:57:22,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:57:22,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 10:57:22,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 10:57:22,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2024-12-02 10:57:22,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 55 transitions, 249 flow. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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 10:57:22,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:57:22,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2024-12-02 10:57:22,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:57:24,223 INFO L124 PetriNetUnfolderBase]: 7720/13564 cut-off events. [2024-12-02 10:57:24,223 INFO L125 PetriNetUnfolderBase]: For 23613/24527 co-relation queries the response was YES. [2024-12-02 10:57:24,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42497 conditions, 13564 events. 7720/13564 cut-off events. For 23613/24527 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 117345 event pairs, 2032 based on Foata normal form. 543/13135 useless extension candidates. Maximal degree in co-relation 42479. Up to 5354 conditions per place. [2024-12-02 10:57:24,308 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 51 selfloop transitions, 8 changer transitions 14/101 dead transitions. [2024-12-02 10:57:24,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 101 transitions, 641 flow [2024-12-02 10:57:24,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 10:57:24,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-12-02 10:57:24,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 240 transitions. [2024-12-02 10:57:24,310 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6233766233766234 [2024-12-02 10:57:24,310 INFO L175 Difference]: Start difference. First operand has 76 places, 55 transitions, 249 flow. Second operand 7 states and 240 transitions. [2024-12-02 10:57:24,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 101 transitions, 641 flow [2024-12-02 10:57:24,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 101 transitions, 597 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-12-02 10:57:24,384 INFO L231 Difference]: Finished difference. Result has 72 places, 60 transitions, 297 flow [2024-12-02 10:57:24,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=297, PETRI_PLACES=72, PETRI_TRANSITIONS=60} [2024-12-02 10:57:24,385 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 10 predicate places. [2024-12-02 10:57:24,385 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 60 transitions, 297 flow [2024-12-02 10:57:24,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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 10:57:24,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:57:24,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] [2024-12-02 10:57:24,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 10:57:24,386 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-12-02 10:57:24,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:57:24,386 INFO L85 PathProgramCache]: Analyzing trace with hash 2041038594, now seen corresponding path program 1 times [2024-12-02 10:57:24,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:57:24,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058832978] [2024-12-02 10:57:24,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:57:24,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:57:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:57:24,743 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 10:57:24,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:57:24,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058832978] [2024-12-02 10:57:24,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058832978] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:57:24,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:57:24,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 10:57:24,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114172936] [2024-12-02 10:57:24,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:57:24,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 10:57:24,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:57:24,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 10:57:24,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 10:57:24,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2024-12-02 10:57:24,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 60 transitions, 297 flow. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 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 10:57:24,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:57:24,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2024-12-02 10:57:24,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:57:26,763 INFO L124 PetriNetUnfolderBase]: 10884/18884 cut-off events. [2024-12-02 10:57:26,763 INFO L125 PetriNetUnfolderBase]: For 32710/33285 co-relation queries the response was YES. [2024-12-02 10:57:26,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58601 conditions, 18884 events. 10884/18884 cut-off events. For 32710/33285 co-relation queries the response was YES. Maximal size of possible extension queue 1139. Compared 167607 event pairs, 2546 based on Foata normal form. 430/18447 useless extension candidates. Maximal degree in co-relation 58582. Up to 9957 conditions per place. [2024-12-02 10:57:26,868 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 65 selfloop transitions, 15 changer transitions 26/134 dead transitions. [2024-12-02 10:57:26,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 134 transitions, 940 flow [2024-12-02 10:57:26,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 10:57:26,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-12-02 10:57:26,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 246 transitions. [2024-12-02 10:57:26,870 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.638961038961039 [2024-12-02 10:57:26,870 INFO L175 Difference]: Start difference. First operand has 72 places, 60 transitions, 297 flow. Second operand 7 states and 246 transitions. [2024-12-02 10:57:26,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 134 transitions, 940 flow [2024-12-02 10:57:26,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 134 transitions, 940 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-12-02 10:57:26,972 INFO L231 Difference]: Finished difference. Result has 82 places, 74 transitions, 495 flow [2024-12-02 10:57:26,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=495, PETRI_PLACES=82, PETRI_TRANSITIONS=74} [2024-12-02 10:57:26,972 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 20 predicate places. [2024-12-02 10:57:26,972 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 74 transitions, 495 flow [2024-12-02 10:57:26,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 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 10:57:26,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:57:26,973 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 10:57:26,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 10:57:26,973 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-12-02 10:57:26,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:57:26,973 INFO L85 PathProgramCache]: Analyzing trace with hash -595921469, now seen corresponding path program 1 times [2024-12-02 10:57:26,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:57:26,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440566965] [2024-12-02 10:57:26,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:57:26,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:57:26,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:57:27,352 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 10:57:27,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:57:27,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440566965] [2024-12-02 10:57:27,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440566965] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:57:27,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:57:27,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 10:57:27,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801380738] [2024-12-02 10:57:27,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:57:27,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 10:57:27,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:57:27,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 10:57:27,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:57:27,371 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-12-02 10:57:27,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 74 transitions, 495 flow. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 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 10:57:27,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:57:27,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-12-02 10:57:27,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:57:30,567 INFO L124 PetriNetUnfolderBase]: 18350/30631 cut-off events. [2024-12-02 10:57:30,567 INFO L125 PetriNetUnfolderBase]: For 81164/81236 co-relation queries the response was YES. [2024-12-02 10:57:30,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103526 conditions, 30631 events. 18350/30631 cut-off events. For 81164/81236 co-relation queries the response was YES. Maximal size of possible extension queue 1805. Compared 278412 event pairs, 3178 based on Foata normal form. 352/30594 useless extension candidates. Maximal degree in co-relation 103501. Up to 9775 conditions per place. [2024-12-02 10:57:30,740 INFO L140 encePairwiseOnDemand]: 41/55 looper letters, 64 selfloop transitions, 21 changer transitions 109/210 dead transitions. [2024-12-02 10:57:30,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 210 transitions, 1781 flow [2024-12-02 10:57:30,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 10:57:30,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-12-02 10:57:30,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 344 transitions. [2024-12-02 10:57:30,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6254545454545455 [2024-12-02 10:57:30,742 INFO L175 Difference]: Start difference. First operand has 82 places, 74 transitions, 495 flow. Second operand 10 states and 344 transitions. [2024-12-02 10:57:30,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 210 transitions, 1781 flow [2024-12-02 10:57:31,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 210 transitions, 1765 flow, removed 8 selfloop flow, removed 0 redundant places. [2024-12-02 10:57:31,163 INFO L231 Difference]: Finished difference. Result has 100 places, 71 transitions, 537 flow [2024-12-02 10:57:31,163 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=537, PETRI_PLACES=100, PETRI_TRANSITIONS=71} [2024-12-02 10:57:31,163 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 38 predicate places. [2024-12-02 10:57:31,163 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 71 transitions, 537 flow [2024-12-02 10:57:31,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 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 10:57:31,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:57:31,164 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] [2024-12-02 10:57:31,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 10:57:31,164 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-12-02 10:57:31,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:57:31,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1154209379, now seen corresponding path program 1 times [2024-12-02 10:57:31,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:57:31,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556866942] [2024-12-02 10:57:31,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:57:31,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:57:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:57:31,745 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 10:57:31,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:57:31,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556866942] [2024-12-02 10:57:31,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556866942] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:57:31,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:57:31,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 10:57:31,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910885460] [2024-12-02 10:57:31,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:57:31,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 10:57:31,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:57:31,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 10:57:31,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-12-02 10:57:31,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2024-12-02 10:57:31,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 71 transitions, 537 flow. Second operand has 7 states, 7 states have (on average 28.142857142857142) internal successors, (197), 7 states have internal predecessors, (197), 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 10:57:31,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:57:31,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2024-12-02 10:57:31,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:57:33,994 INFO L124 PetriNetUnfolderBase]: 10987/19907 cut-off events. [2024-12-02 10:57:33,994 INFO L125 PetriNetUnfolderBase]: For 94268/95803 co-relation queries the response was YES. [2024-12-02 10:57:34,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73852 conditions, 19907 events. 10987/19907 cut-off events. For 94268/95803 co-relation queries the response was YES. Maximal size of possible extension queue 1086. Compared 182409 event pairs, 2228 based on Foata normal form. 704/19769 useless extension candidates. Maximal degree in co-relation 73816. Up to 9586 conditions per place. [2024-12-02 10:57:34,189 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 71 selfloop transitions, 32 changer transitions 26/168 dead transitions. [2024-12-02 10:57:34,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 168 transitions, 1473 flow [2024-12-02 10:57:34,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-12-02 10:57:34,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-12-02 10:57:34,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 372 transitions. [2024-12-02 10:57:34,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6148760330578512 [2024-12-02 10:57:34,191 INFO L175 Difference]: Start difference. First operand has 100 places, 71 transitions, 537 flow. Second operand 11 states and 372 transitions. [2024-12-02 10:57:34,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 168 transitions, 1473 flow [2024-12-02 10:57:34,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 168 transitions, 1415 flow, removed 25 selfloop flow, removed 9 redundant places. [2024-12-02 10:57:34,502 INFO L231 Difference]: Finished difference. Result has 92 places, 105 transitions, 923 flow [2024-12-02 10:57:34,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=923, PETRI_PLACES=92, PETRI_TRANSITIONS=105} [2024-12-02 10:57:34,503 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 30 predicate places. [2024-12-02 10:57:34,503 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 105 transitions, 923 flow [2024-12-02 10:57:34,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.142857142857142) internal successors, (197), 7 states have internal predecessors, (197), 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 10:57:34,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:57:34,503 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 10:57:34,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 10:57:34,504 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-12-02 10:57:34,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:57:34,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1097935110, now seen corresponding path program 1 times [2024-12-02 10:57:34,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:57:34,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99682743] [2024-12-02 10:57:34,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:57:34,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:57:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:57:34,978 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 10:57:34,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:57:34,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99682743] [2024-12-02 10:57:34,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99682743] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:57:34,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:57:34,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 10:57:34,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590740512] [2024-12-02 10:57:34,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:57:34,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 10:57:34,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:57:34,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 10:57:34,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-12-02 10:57:35,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 55 [2024-12-02 10:57:35,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 105 transitions, 923 flow. Second operand has 9 states, 9 states have (on average 24.11111111111111) internal successors, (217), 9 states have internal predecessors, (217), 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 10:57:35,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:57:35,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 55 [2024-12-02 10:57:35,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:57:37,662 INFO L124 PetriNetUnfolderBase]: 16253/27149 cut-off events. [2024-12-02 10:57:37,662 INFO L125 PetriNetUnfolderBase]: For 127763/128567 co-relation queries the response was YES. [2024-12-02 10:57:37,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111228 conditions, 27149 events. 16253/27149 cut-off events. For 127763/128567 co-relation queries the response was YES. Maximal size of possible extension queue 1473. Compared 237584 event pairs, 3930 based on Foata normal form. 775/27046 useless extension candidates. Maximal degree in co-relation 111194. Up to 16155 conditions per place. [2024-12-02 10:57:37,846 INFO L140 encePairwiseOnDemand]: 43/55 looper letters, 103 selfloop transitions, 35 changer transitions 79/241 dead transitions. [2024-12-02 10:57:37,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 241 transitions, 2633 flow [2024-12-02 10:57:37,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 10:57:37,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-12-02 10:57:37,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 318 transitions. [2024-12-02 10:57:37,849 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5781818181818181 [2024-12-02 10:57:37,849 INFO L175 Difference]: Start difference. First operand has 92 places, 105 transitions, 923 flow. Second operand 10 states and 318 transitions. [2024-12-02 10:57:37,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 241 transitions, 2633 flow [2024-12-02 10:57:38,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 241 transitions, 2529 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-12-02 10:57:38,406 INFO L231 Difference]: Finished difference. Result has 106 places, 117 transitions, 1221 flow [2024-12-02 10:57:38,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=879, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1221, PETRI_PLACES=106, PETRI_TRANSITIONS=117} [2024-12-02 10:57:38,406 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 44 predicate places. [2024-12-02 10:57:38,406 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 117 transitions, 1221 flow [2024-12-02 10:57:38,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 24.11111111111111) internal successors, (217), 9 states have internal predecessors, (217), 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 10:57:38,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:57:38,407 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 10:57:38,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 10:57:38,407 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-12-02 10:57:38,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:57:38,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1569027798, now seen corresponding path program 2 times [2024-12-02 10:57:38,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:57:38,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269008688] [2024-12-02 10:57:38,408 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 10:57:38,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:57:38,442 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 10:57:38,442 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 10:57:38,548 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 10:57:38,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:57:38,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269008688] [2024-12-02 10:57:38,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269008688] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:57:38,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:57:38,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 10:57:38,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863867263] [2024-12-02 10:57:38,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:57:38,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:57:38,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:57:38,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:57:38,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 10:57:38,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-12-02 10:57:38,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 117 transitions, 1221 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:57:38,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:57:38,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-12-02 10:57:38,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:57:44,675 INFO L124 PetriNetUnfolderBase]: 35009/52268 cut-off events. [2024-12-02 10:57:44,675 INFO L125 PetriNetUnfolderBase]: For 352973/372435 co-relation queries the response was YES. [2024-12-02 10:57:44,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219599 conditions, 52268 events. 35009/52268 cut-off events. For 352973/372435 co-relation queries the response was YES. Maximal size of possible extension queue 2451. Compared 411782 event pairs, 6280 based on Foata normal form. 8015/57439 useless extension candidates. Maximal degree in co-relation 219558. Up to 29172 conditions per place. [2024-12-02 10:57:45,079 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 151 selfloop transitions, 6 changer transitions 1/202 dead transitions. [2024-12-02 10:57:45,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 202 transitions, 2579 flow [2024-12-02 10:57:45,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 10:57:45,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 10:57:45,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2024-12-02 10:57:45,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6636363636363637 [2024-12-02 10:57:45,080 INFO L175 Difference]: Start difference. First operand has 106 places, 117 transitions, 1221 flow. Second operand 4 states and 146 transitions. [2024-12-02 10:57:45,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 202 transitions, 2579 flow [2024-12-02 10:57:46,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 202 transitions, 2442 flow, removed 68 selfloop flow, removed 7 redundant places. [2024-12-02 10:57:46,760 INFO L231 Difference]: Finished difference. Result has 94 places, 120 transitions, 1190 flow [2024-12-02 10:57:46,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1160, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1190, PETRI_PLACES=94, PETRI_TRANSITIONS=120} [2024-12-02 10:57:46,760 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 32 predicate places. [2024-12-02 10:57:46,761 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 120 transitions, 1190 flow [2024-12-02 10:57:46,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:57:46,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:57:46,761 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] [2024-12-02 10:57:46,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 10:57:46,761 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-12-02 10:57:46,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:57:46,762 INFO L85 PathProgramCache]: Analyzing trace with hash -693483769, now seen corresponding path program 1 times [2024-12-02 10:57:46,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:57:46,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60286704] [2024-12-02 10:57:46,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:57:46,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:57:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:57:47,079 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 10:57:47,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:57:47,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60286704] [2024-12-02 10:57:47,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60286704] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:57:47,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:57:47,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 10:57:47,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585325538] [2024-12-02 10:57:47,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:57:47,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 10:57:47,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:57:47,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 10:57:47,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-02 10:57:47,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-12-02 10:57:47,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 120 transitions, 1190 flow. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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 10:57:47,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:57:47,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-12-02 10:57:47,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:57:51,878 INFO L124 PetriNetUnfolderBase]: 28229/42432 cut-off events. [2024-12-02 10:57:51,878 INFO L125 PetriNetUnfolderBase]: For 217120/235841 co-relation queries the response was YES. [2024-12-02 10:57:52,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176333 conditions, 42432 events. 28229/42432 cut-off events. For 217120/235841 co-relation queries the response was YES. Maximal size of possible extension queue 2032. Compared 326006 event pairs, 3106 based on Foata normal form. 7085/47280 useless extension candidates. Maximal degree in co-relation 176295. Up to 16797 conditions per place. [2024-12-02 10:57:52,252 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 183 selfloop transitions, 10 changer transitions 6/243 dead transitions. [2024-12-02 10:57:52,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 243 transitions, 2981 flow [2024-12-02 10:57:52,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 10:57:52,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-12-02 10:57:52,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 186 transitions. [2024-12-02 10:57:52,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6763636363636364 [2024-12-02 10:57:52,254 INFO L175 Difference]: Start difference. First operand has 94 places, 120 transitions, 1190 flow. Second operand 5 states and 186 transitions. [2024-12-02 10:57:52,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 243 transitions, 2981 flow [2024-12-02 10:57:52,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 243 transitions, 2974 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-12-02 10:57:52,624 INFO L231 Difference]: Finished difference. Result has 99 places, 120 transitions, 1177 flow [2024-12-02 10:57:52,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1110, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1177, PETRI_PLACES=99, PETRI_TRANSITIONS=120} [2024-12-02 10:57:52,625 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 37 predicate places. [2024-12-02 10:57:52,625 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 120 transitions, 1177 flow [2024-12-02 10:57:52,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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 10:57:52,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:57:52,625 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:57:52,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 10:57:52,626 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-12-02 10:57:52,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:57:52,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1667591127, now seen corresponding path program 1 times [2024-12-02 10:57:52,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:57:52,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045502527] [2024-12-02 10:57:52,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:57:52,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:57:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:57:52,892 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 10:57:52,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:57:52,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045502527] [2024-12-02 10:57:52,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045502527] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:57:52,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:57:52,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 10:57:52,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065424099] [2024-12-02 10:57:52,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:57:52,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 10:57:52,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:57:52,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 10:57:52,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 10:57:52,895 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2024-12-02 10:57:52,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 120 transitions, 1177 flow. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 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 10:57:52,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:57:52,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2024-12-02 10:57:52,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:57:58,356 INFO L124 PetriNetUnfolderBase]: 26082/44766 cut-off events. [2024-12-02 10:57:58,356 INFO L125 PetriNetUnfolderBase]: For 204588/217572 co-relation queries the response was YES. [2024-12-02 10:57:58,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186853 conditions, 44766 events. 26082/44766 cut-off events. For 204588/217572 co-relation queries the response was YES. Maximal size of possible extension queue 2556. Compared 425436 event pairs, 9436 based on Foata normal form. 4018/44658 useless extension candidates. Maximal degree in co-relation 186812. Up to 15622 conditions per place. [2024-12-02 10:57:58,724 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 119 selfloop transitions, 15 changer transitions 28/209 dead transitions. [2024-12-02 10:57:58,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 209 transitions, 2428 flow [2024-12-02 10:57:58,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 10:57:58,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-12-02 10:57:58,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 248 transitions. [2024-12-02 10:57:58,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6441558441558441 [2024-12-02 10:57:58,726 INFO L175 Difference]: Start difference. First operand has 99 places, 120 transitions, 1177 flow. Second operand 7 states and 248 transitions. [2024-12-02 10:57:58,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 209 transitions, 2428 flow [2024-12-02 10:57:59,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 209 transitions, 2409 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-12-02 10:57:59,152 INFO L231 Difference]: Finished difference. Result has 106 places, 126 transitions, 1288 flow [2024-12-02 10:57:59,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1158, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1288, PETRI_PLACES=106, PETRI_TRANSITIONS=126} [2024-12-02 10:57:59,152 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 44 predicate places. [2024-12-02 10:57:59,152 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 126 transitions, 1288 flow [2024-12-02 10:57:59,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 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 10:57:59,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:57:59,153 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:57:59,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 10:57:59,153 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-12-02 10:57:59,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:57:59,153 INFO L85 PathProgramCache]: Analyzing trace with hash 902212767, now seen corresponding path program 1 times [2024-12-02 10:57:59,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:57:59,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143808737] [2024-12-02 10:57:59,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:57:59,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:57:59,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:57:59,849 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 10:57:59,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:57:59,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143808737] [2024-12-02 10:57:59,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143808737] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:57:59,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:57:59,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 10:57:59,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921688528] [2024-12-02 10:57:59,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:57:59,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 10:57:59,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:57:59,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 10:57:59,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-12-02 10:57:59,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2024-12-02 10:57:59,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 126 transitions, 1288 flow. Second operand has 9 states, 9 states have (on average 27.88888888888889) internal successors, (251), 9 states have internal predecessors, (251), 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 10:57:59,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:57:59,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2024-12-02 10:57:59,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:58:07,245 INFO L124 PetriNetUnfolderBase]: 34214/60923 cut-off events. [2024-12-02 10:58:07,245 INFO L125 PetriNetUnfolderBase]: For 255735/269891 co-relation queries the response was YES. [2024-12-02 10:58:07,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247370 conditions, 60923 events. 34214/60923 cut-off events. For 255735/269891 co-relation queries the response was YES. Maximal size of possible extension queue 3886. Compared 629219 event pairs, 8163 based on Foata normal form. 2239/58022 useless extension candidates. Maximal degree in co-relation 247327. Up to 25945 conditions per place. [2024-12-02 10:58:07,731 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 84 selfloop transitions, 48 changer transitions 21/211 dead transitions. [2024-12-02 10:58:07,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 211 transitions, 2375 flow [2024-12-02 10:58:07,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 10:58:07,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-12-02 10:58:07,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 344 transitions. [2024-12-02 10:58:07,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6254545454545455 [2024-12-02 10:58:07,733 INFO L175 Difference]: Start difference. First operand has 106 places, 126 transitions, 1288 flow. Second operand 10 states and 344 transitions. [2024-12-02 10:58:07,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 211 transitions, 2375 flow [2024-12-02 10:58:08,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 211 transitions, 2342 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-12-02 10:58:08,618 INFO L231 Difference]: Finished difference. Result has 121 places, 148 transitions, 1771 flow [2024-12-02 10:58:08,618 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1267, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1771, PETRI_PLACES=121, PETRI_TRANSITIONS=148} [2024-12-02 10:58:08,618 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 59 predicate places. [2024-12-02 10:58:08,618 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 148 transitions, 1771 flow [2024-12-02 10:58:08,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.88888888888889) internal successors, (251), 9 states have internal predecessors, (251), 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 10:58:08,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:58:08,619 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:58:08,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 10:58:08,619 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-12-02 10:58:08,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:58:08,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1566485005, now seen corresponding path program 2 times [2024-12-02 10:58:08,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:58:08,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791398443] [2024-12-02 10:58:08,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 10:58:08,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:58:08,652 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 10:58:08,652 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 10:58:08,766 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 10:58:08,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:58:08,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791398443] [2024-12-02 10:58:08,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791398443] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:58:08,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:58:08,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 10:58:08,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098356777] [2024-12-02 10:58:08,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:58:08,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 10:58:08,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:58:08,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 10:58:08,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:58:08,772 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-12-02 10:58:08,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 148 transitions, 1771 flow. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 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 10:58:08,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:58:08,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-12-02 10:58:08,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:58:17,011 INFO L124 PetriNetUnfolderBase]: 45648/67850 cut-off events. [2024-12-02 10:58:17,011 INFO L125 PetriNetUnfolderBase]: For 516782/557171 co-relation queries the response was YES. [2024-12-02 10:58:17,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315704 conditions, 67850 events. 45648/67850 cut-off events. For 516782/557171 co-relation queries the response was YES. Maximal size of possible extension queue 4193. Compared 554036 event pairs, 2928 based on Foata normal form. 9578/73982 useless extension candidates. Maximal degree in co-relation 315653. Up to 23968 conditions per place. [2024-12-02 10:58:17,503 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 170 selfloop transitions, 14 changer transitions 69/296 dead transitions. [2024-12-02 10:58:17,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 296 transitions, 4295 flow [2024-12-02 10:58:17,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 10:58:17,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 10:58:17,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 224 transitions. [2024-12-02 10:58:17,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6787878787878788 [2024-12-02 10:58:17,504 INFO L175 Difference]: Start difference. First operand has 121 places, 148 transitions, 1771 flow. Second operand 6 states and 224 transitions. [2024-12-02 10:58:17,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 296 transitions, 4295 flow [2024-12-02 10:58:18,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 296 transitions, 3966 flow, removed 151 selfloop flow, removed 3 redundant places. [2024-12-02 10:58:18,812 INFO L231 Difference]: Finished difference. Result has 125 places, 121 transitions, 1259 flow [2024-12-02 10:58:18,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1504, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1259, PETRI_PLACES=125, PETRI_TRANSITIONS=121} [2024-12-02 10:58:18,813 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 63 predicate places. [2024-12-02 10:58:18,813 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 121 transitions, 1259 flow [2024-12-02 10:58:18,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 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 10:58:18,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:58:18,813 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:58:18,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 10:58:18,813 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-12-02 10:58:18,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:58:18,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1315070912, now seen corresponding path program 1 times [2024-12-02 10:58:18,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:58:18,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738982098] [2024-12-02 10:58:18,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:58:18,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:58:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:58:19,207 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 10:58:19,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:58:19,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738982098] [2024-12-02 10:58:19,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738982098] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:58:19,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:58:19,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 10:58:19,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934926174] [2024-12-02 10:58:19,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:58:19,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 10:58:19,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:58:19,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 10:58:19,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-12-02 10:58:19,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-12-02 10:58:19,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 121 transitions, 1259 flow. Second operand has 7 states, 7 states have (on average 26.0) internal successors, (182), 7 states have internal predecessors, (182), 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 10:58:19,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:58:19,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-12-02 10:58:19,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:58:25,914 INFO L124 PetriNetUnfolderBase]: 38449/58221 cut-off events. [2024-12-02 10:58:25,914 INFO L125 PetriNetUnfolderBase]: For 389980/427174 co-relation queries the response was YES. [2024-12-02 10:58:26,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273362 conditions, 58221 events. 38449/58221 cut-off events. For 389980/427174 co-relation queries the response was YES. Maximal size of possible extension queue 4177. Compared 494503 event pairs, 2812 based on Foata normal form. 4374/59477 useless extension candidates. Maximal degree in co-relation 273322. Up to 23130 conditions per place. [2024-12-02 10:58:26,348 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 142 selfloop transitions, 18 changer transitions 35/232 dead transitions. [2024-12-02 10:58:26,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 232 transitions, 2888 flow [2024-12-02 10:58:26,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 10:58:26,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-12-02 10:58:26,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 246 transitions. [2024-12-02 10:58:26,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.638961038961039 [2024-12-02 10:58:26,350 INFO L175 Difference]: Start difference. First operand has 125 places, 121 transitions, 1259 flow. Second operand 7 states and 246 transitions. [2024-12-02 10:58:26,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 232 transitions, 2888 flow [2024-12-02 10:58:29,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 232 transitions, 2632 flow, removed 85 selfloop flow, removed 18 redundant places. [2024-12-02 10:58:29,422 INFO L231 Difference]: Finished difference. Result has 107 places, 107 transitions, 1016 flow [2024-12-02 10:58:29,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1074, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1016, PETRI_PLACES=107, PETRI_TRANSITIONS=107} [2024-12-02 10:58:29,422 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 45 predicate places. [2024-12-02 10:58:29,422 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 107 transitions, 1016 flow [2024-12-02 10:58:29,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.0) internal successors, (182), 7 states have internal predecessors, (182), 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 10:58:29,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:58:29,423 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:58:29,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 10:58:29,423 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-12-02 10:58:29,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:58:29,423 INFO L85 PathProgramCache]: Analyzing trace with hash 473414029, now seen corresponding path program 1 times [2024-12-02 10:58:29,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:58:29,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411541024] [2024-12-02 10:58:29,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:58:29,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:58:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:58:30,114 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 10:58:30,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:58:30,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411541024] [2024-12-02 10:58:30,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411541024] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:58:30,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:58:30,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 10:58:30,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413031344] [2024-12-02 10:58:30,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:58:30,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 10:58:30,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:58:30,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 10:58:30,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-12-02 10:58:30,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 55 [2024-12-02 10:58:30,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 107 transitions, 1016 flow. Second operand has 10 states, 10 states have (on average 21.5) internal successors, (215), 10 states have internal predecessors, (215), 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 10:58:30,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:58:30,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 55 [2024-12-02 10:58:30,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:58:33,994 INFO L124 PetriNetUnfolderBase]: 20678/36346 cut-off events. [2024-12-02 10:58:33,994 INFO L125 PetriNetUnfolderBase]: For 121452/132022 co-relation queries the response was YES. [2024-12-02 10:58:34,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136236 conditions, 36346 events. 20678/36346 cut-off events. For 121452/132022 co-relation queries the response was YES. Maximal size of possible extension queue 3035. Compared 356387 event pairs, 3249 based on Foata normal form. 647/33549 useless extension candidates. Maximal degree in co-relation 136209. Up to 9255 conditions per place. [2024-12-02 10:58:34,184 INFO L140 encePairwiseOnDemand]: 40/55 looper letters, 38 selfloop transitions, 10 changer transitions 199/277 dead transitions. [2024-12-02 10:58:34,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 277 transitions, 2857 flow [2024-12-02 10:58:34,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 10:58:34,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-12-02 10:58:34,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 422 transitions. [2024-12-02 10:58:34,186 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.548051948051948 [2024-12-02 10:58:34,186 INFO L175 Difference]: Start difference. First operand has 107 places, 107 transitions, 1016 flow. Second operand 14 states and 422 transitions. [2024-12-02 10:58:34,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 277 transitions, 2857 flow [2024-12-02 10:58:35,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 277 transitions, 2566 flow, removed 125 selfloop flow, removed 7 redundant places. [2024-12-02 10:58:35,560 INFO L231 Difference]: Finished difference. Result has 119 places, 70 transitions, 499 flow [2024-12-02 10:58:35,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=883, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=499, PETRI_PLACES=119, PETRI_TRANSITIONS=70} [2024-12-02 10:58:35,561 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 57 predicate places. [2024-12-02 10:58:35,561 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 70 transitions, 499 flow [2024-12-02 10:58:35,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.5) internal successors, (215), 10 states have internal predecessors, (215), 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 10:58:35,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:58:35,561 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:58:35,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 10:58:35,561 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-12-02 10:58:35,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:58:35,562 INFO L85 PathProgramCache]: Analyzing trace with hash -558100671, now seen corresponding path program 2 times [2024-12-02 10:58:35,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:58:35,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844637895] [2024-12-02 10:58:35,562 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 10:58:35,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:58:35,582 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 10:58:35,583 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 10:58:36,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 10:58:36,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 10:58:36,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844637895] [2024-12-02 10:58:36,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844637895] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:58:36,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:58:36,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-12-02 10:58:36,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150197059] [2024-12-02 10:58:36,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:58:36,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-02 10:58:36,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 10:58:36,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-02 10:58:36,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-12-02 10:58:36,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2024-12-02 10:58:36,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 70 transitions, 499 flow. Second operand has 10 states, 10 states have (on average 27.8) internal successors, (278), 10 states have internal predecessors, (278), 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 10:58:36,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:58:36,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2024-12-02 10:58:36,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:58:37,170 INFO L124 PetriNetUnfolderBase]: 2834/5444 cut-off events. [2024-12-02 10:58:37,170 INFO L125 PetriNetUnfolderBase]: For 9079/9907 co-relation queries the response was YES. [2024-12-02 10:58:37,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16922 conditions, 5444 events. 2834/5444 cut-off events. For 9079/9907 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 44313 event pairs, 492 based on Foata normal form. 74/4778 useless extension candidates. Maximal degree in co-relation 16892. Up to 1730 conditions per place. [2024-12-02 10:58:37,197 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 31 selfloop transitions, 8 changer transitions 12/92 dead transitions. [2024-12-02 10:58:37,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 92 transitions, 669 flow [2024-12-02 10:58:37,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 10:58:37,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-12-02 10:58:37,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 256 transitions. [2024-12-02 10:58:37,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5818181818181818 [2024-12-02 10:58:37,198 INFO L175 Difference]: Start difference. First operand has 119 places, 70 transitions, 499 flow. Second operand 8 states and 256 transitions. [2024-12-02 10:58:37,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 92 transitions, 669 flow [2024-12-02 10:58:37,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 92 transitions, 581 flow, removed 13 selfloop flow, removed 18 redundant places. [2024-12-02 10:58:37,265 INFO L231 Difference]: Finished difference. Result has 99 places, 70 transitions, 442 flow [2024-12-02 10:58:37,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=442, PETRI_PLACES=99, PETRI_TRANSITIONS=70} [2024-12-02 10:58:37,266 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 37 predicate places. [2024-12-02 10:58:37,266 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 70 transitions, 442 flow [2024-12-02 10:58:37,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.8) internal successors, (278), 10 states have internal predecessors, (278), 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 10:58:37,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:58:37,266 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:58:37,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-02 10:58:37,266 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-12-02 10:58:37,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:58:37,266 INFO L85 PathProgramCache]: Analyzing trace with hash -197418365, now seen corresponding path program 3 times [2024-12-02 10:58:37,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 10:58:37,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611382035] [2024-12-02 10:58:37,267 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 10:58:37,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:58:37,294 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-12-02 10:58:37,294 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-12-02 10:58:37,294 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 10:58:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 10:58:37,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 10:58:37,374 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 10:58:37,375 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-12-02 10:58:37,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-12-02 10:58:37,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-12-02 10:58:37,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-12-02 10:58:37,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-12-02 10:58:37,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-12-02 10:58:37,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-12-02 10:58:37,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-12-02 10:58:37,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-02 10:58:37,378 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:58:37,449 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-12-02 10:58:37,449 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 10:58:37,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 10:58:37 BasicIcfg [2024-12-02 10:58:37,454 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 10:58:37,455 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 10:58:37,455 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 10:58:37,455 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 10:58:37,456 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:57:17" (3/4) ... [2024-12-02 10:58:37,458 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-12-02 10:58:37,459 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 10:58:37,459 INFO L158 Benchmark]: Toolchain (without parser) took 80798.29ms. Allocated memory was 142.6MB in the beginning and 10.9GB in the end (delta: 10.8GB). Free memory was 115.6MB in the beginning and 5.7GB in the end (delta: -5.6GB). Peak memory consumption was 5.2GB. Max. memory is 16.1GB. [2024-12-02 10:58:37,460 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 142.6MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 10:58:37,460 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.90ms. Allocated memory is still 142.6MB. Free memory was 115.6MB in the beginning and 92.5MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-02 10:58:37,460 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.90ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 89.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 10:58:37,460 INFO L158 Benchmark]: Boogie Preprocessor took 43.81ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 86.7MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 10:58:37,461 INFO L158 Benchmark]: RCFGBuilder took 640.74ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 96.2MB in the end (delta: -9.5MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. [2024-12-02 10:58:37,461 INFO L158 Benchmark]: TraceAbstraction took 79672.14ms. Allocated memory was 142.6MB in the beginning and 10.9GB in the end (delta: 10.8GB). Free memory was 95.5MB in the beginning and 5.7GB in the end (delta: -5.6GB). Peak memory consumption was 5.2GB. Max. memory is 16.1GB. [2024-12-02 10:58:37,461 INFO L158 Benchmark]: Witness Printer took 3.75ms. Allocated memory is still 10.9GB. Free memory was 5.7GB in the beginning and 5.7GB in the end (delta: 97.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 10:58:37,463 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.26ms. Allocated memory is still 142.6MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 397.90ms. Allocated memory is still 142.6MB. Free memory was 115.6MB in the beginning and 92.5MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.90ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 89.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.81ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 86.7MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 640.74ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 96.2MB in the end (delta: -9.5MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. * TraceAbstraction took 79672.14ms. Allocated memory was 142.6MB in the beginning and 10.9GB in the end (delta: 10.8GB). Free memory was 95.5MB in the beginning and 5.7GB in the end (delta: -5.6GB). Peak memory consumption was 5.2GB. Max. memory is 16.1GB. * Witness Printer took 3.75ms. Allocated memory is still 10.9GB. Free memory was 5.7GB in the beginning and 5.7GB in the end (delta: 97.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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1253; [L845] FCALL, FORK 0 pthread_create(&t1253, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 0 pthread_t t1254; [L847] FCALL, FORK 0 pthread_create(&t1254, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253=-1, t1254=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1255; [L849] FCALL, FORK 0 pthread_create(&t1255, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253=-1, t1254=0, t1255=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1256; [L851] FCALL, FORK 0 pthread_create(&t1256, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253=-1, t1254=0, t1255=1, t1256=2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L804] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L804] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L813] 4 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L816] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L819] 4 __unbuffered_p3_EBX = b VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L750] 1 b = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L765] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L783] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L786] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1253=-1, t1254=0, t1255=1, t1256=2, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1253=-1, t1254=0, t1255=1, t1256=2, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L869] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L870] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L871] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L872] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L874] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1253=-1, t1254=0, t1255=1, t1256=2, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L17] 0 __assert_fail ("0", "mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 847]: 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: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 89 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 79.5s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 72.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1093 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1044 mSDsluCounter, 589 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 500 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2716 IncrementalHoareTripleChecker+Invalid, 2833 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 89 mSDtfsCounter, 2716 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1771occurred in iteration=12, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 459 NumberOfCodeBlocks, 459 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 404 ConstructedInterpolants, 0 QuantifiedInterpolants, 2554 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 10:58:37,482 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/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 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_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/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_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/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_240c5004-1757-42e1-afe3-383dcde300aa/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 473191b5f1326a38296af26dcd2c7f553c42833f82b512e9fb358484309bc769 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 10:58:40,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 10:58:40,082 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-12-02 10:58:40,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 10:58:40,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 10:58:40,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 10:58:40,110 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 10:58:40,111 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 10:58:40,111 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 10:58:40,111 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 10:58:40,111 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 10:58:40,111 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 10:58:40,111 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 10:58:40,111 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 10:58:40,112 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 10:58:40,112 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 10:58:40,112 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 10:58:40,112 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 10:58:40,112 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 10:58:40,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 10:58:40,112 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-02 10:58:40,112 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-02 10:58:40,112 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-02 10:58:40,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 10:58:40,113 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-12-02 10:58:40,113 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-12-02 10:58:40,113 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-12-02 10:58:40,113 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-02 10:58:40,113 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 10:58:40,113 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 10:58:40,113 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 10:58:40,113 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 10:58:40,113 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 10:58:40,113 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 10:58:40,113 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 10:58:40,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 10:58:40,114 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 10:58:40,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 10:58:40,114 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 10:58:40,114 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 10:58:40,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 10:58:40,114 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 10:58:40,114 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 10:58:40,114 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-12-02 10:58:40,114 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-12-02 10:58:40,114 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 10:58:40,115 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 10:58:40,115 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 10:58:40,115 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 10:58:40,115 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_240c5004-1757-42e1-afe3-383dcde300aa/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 -> 473191b5f1326a38296af26dcd2c7f553c42833f82b512e9fb358484309bc769 [2024-12-02 10:58:40,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 10:58:40,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 10:58:40,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 10:58:40,354 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 10:58:40,355 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 10:58:40,356 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-12-02 10:58:43,112 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/data/884ef24d5/93b8694057da44fb82e2f1f0db569e7b/FLAGf697bc953 [2024-12-02 10:58:43,347 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 10:58:43,348 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/sv-benchmarks/c/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-12-02 10:58:43,360 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/data/884ef24d5/93b8694057da44fb82e2f1f0db569e7b/FLAGf697bc953 [2024-12-02 10:58:43,373 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/data/884ef24d5/93b8694057da44fb82e2f1f0db569e7b [2024-12-02 10:58:43,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 10:58:43,376 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 10:58:43,377 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 10:58:43,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 10:58:43,382 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 10:58:43,382 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:58:43" (1/1) ... [2024-12-02 10:58:43,383 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b0ee136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:58:43, skipping insertion in model container [2024-12-02 10:58:43,383 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:58:43" (1/1) ... [2024-12-02 10:58:43,413 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 10:58:43,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 10:58:43,687 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 10:58:43,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 10:58:43,770 INFO L204 MainTranslator]: Completed translation [2024-12-02 10:58:43,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:58:43 WrapperNode [2024-12-02 10:58:43,771 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 10:58:43,772 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 10:58:43,772 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 10:58:43,772 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 10:58:43,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:58:43" (1/1) ... [2024-12-02 10:58:43,790 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:58:43" (1/1) ... [2024-12-02 10:58:43,814 INFO L138 Inliner]: procedures = 177, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 157 [2024-12-02 10:58:43,815 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 10:58:43,815 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 10:58:43,815 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 10:58:43,815 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 10:58:43,824 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:58:43" (1/1) ... [2024-12-02 10:58:43,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:58:43" (1/1) ... [2024-12-02 10:58:43,828 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:58:43" (1/1) ... [2024-12-02 10:58:43,843 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 10:58:43,843 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:58:43" (1/1) ... [2024-12-02 10:58:43,843 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:58:43" (1/1) ... [2024-12-02 10:58:43,852 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:58:43" (1/1) ... [2024-12-02 10:58:43,853 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:58:43" (1/1) ... [2024-12-02 10:58:43,855 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:58:43" (1/1) ... [2024-12-02 10:58:43,857 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:58:43" (1/1) ... [2024-12-02 10:58:43,859 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:58:43" (1/1) ... [2024-12-02 10:58:43,862 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 10:58:43,863 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 10:58:43,863 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 10:58:43,863 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 10:58:43,864 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:58:43" (1/1) ... [2024-12-02 10:58:43,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 10:58:43,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:58:43,897 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 10:58:43,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 10:58:43,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-12-02 10:58:43,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 10:58:43,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-12-02 10:58:43,921 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-12-02 10:58:43,921 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-12-02 10:58:43,921 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-12-02 10:58:43,921 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-12-02 10:58:43,921 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-12-02 10:58:43,921 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-12-02 10:58:43,921 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-12-02 10:58:43,921 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-12-02 10:58:43,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-12-02 10:58:43,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 10:58:43,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 10:58:43,923 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 10:58:44,046 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 10:58:44,048 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 10:58:44,341 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-02 10:58:44,341 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 10:58:44,519 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 10:58:44,519 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-12-02 10:58:44,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:58:44 BoogieIcfgContainer [2024-12-02 10:58:44,520 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 10:58:44,523 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 10:58:44,523 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 10:58:44,526 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 10:58:44,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 10:58:43" (1/3) ... [2024-12-02 10:58:44,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da5140b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:58:44, skipping insertion in model container [2024-12-02 10:58:44,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:58:43" (2/3) ... [2024-12-02 10:58:44,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da5140b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:58:44, skipping insertion in model container [2024-12-02 10:58:44,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:58:44" (3/3) ... [2024-12-02 10:58:44,528 INFO L128 eAbstractionObserver]: Analyzing ICFG mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-12-02 10:58:44,539 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 10:58:44,540 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i that has 5 procedures, 54 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-12-02 10:58:44,540 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-02 10:58:44,603 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-12-02 10:58:44,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 126 flow [2024-12-02 10:58:44,669 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2024-12-02 10:58:44,671 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 10:58:44,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 113 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2024-12-02 10:58:44,674 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 126 flow [2024-12-02 10:58:44,678 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 114 flow [2024-12-02 10:58:44,684 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 10:58:44,693 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;@2289cb92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 10:58:44,693 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-12-02 10:58:44,703 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-12-02 10:58:44,703 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-12-02 10:58:44,703 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 10:58:44,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:58:44,704 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:58:44,704 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-12-02 10:58:44,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:58:44,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1775777968, now seen corresponding path program 1 times [2024-12-02 10:58:44,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 10:58:44,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1672807141] [2024-12-02 10:58:44,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:58:44,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:58:44,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:58:44,720 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:58:44,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 10:58:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:58:44,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-02 10:58:44,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:58:44,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 10:58:44,875 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 10:58:44,876 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 10:58:44,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672807141] [2024-12-02 10:58:44,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672807141] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:58:44,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:58:44,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 10:58:44,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526804100] [2024-12-02 10:58:44,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:58:44,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:58:44,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 10:58:44,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:58:44,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:58:44,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2024-12-02 10:58:44,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:58:44,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:58:44,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2024-12-02 10:58:44,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:58:45,416 INFO L124 PetriNetUnfolderBase]: 1047/2051 cut-off events. [2024-12-02 10:58:45,416 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 10:58:45,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3611 conditions, 2051 events. 1047/2051 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 15651 event pairs, 219 based on Foata normal form. 96/2117 useless extension candidates. Maximal degree in co-relation 3599. Up to 1153 conditions per place. [2024-12-02 10:58:45,436 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 31 selfloop transitions, 2 changer transitions 2/59 dead transitions. [2024-12-02 10:58:45,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 59 transitions, 200 flow [2024-12-02 10:58:45,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:58:45,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 10:58:45,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2024-12-02 10:58:45,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7515151515151515 [2024-12-02 10:58:45,450 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 124 transitions. [2024-12-02 10:58:45,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 59 transitions, 200 flow [2024-12-02 10:58:45,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 59 transitions, 196 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-12-02 10:58:45,458 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2024-12-02 10:58:45,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-12-02 10:58:45,464 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2024-12-02 10:58:45,464 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2024-12-02 10:58:45,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:58:45,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:58:45,465 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 10:58:45,478 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-12-02 10:58:45,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:58:45,665 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-12-02 10:58:45,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:58:45,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1863289507, now seen corresponding path program 1 times [2024-12-02 10:58:45,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 10:58:45,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [905511024] [2024-12-02 10:58:45,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:58:45,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:58:45,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:58:45,669 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:58:45,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 10:58:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:58:45,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-12-02 10:58:45,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:58:45,806 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 10:58:45,806 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 10:58:45,806 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 10:58:45,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905511024] [2024-12-02 10:58:45,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905511024] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:58:45,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:58:45,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-12-02 10:58:45,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693057089] [2024-12-02 10:58:45,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:58:45,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 10:58:45,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 10:58:45,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 10:58:45,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 10:58:45,810 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2024-12-02 10:58:45,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:58:45,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:58:45,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2024-12-02 10:58:45,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:58:46,063 INFO L124 PetriNetUnfolderBase]: 931/1635 cut-off events. [2024-12-02 10:58:46,063 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2024-12-02 10:58:46,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3125 conditions, 1635 events. 931/1635 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 11690 event pairs, 931 based on Foata normal form. 48/1617 useless extension candidates. Maximal degree in co-relation 3115. Up to 1352 conditions per place. [2024-12-02 10:58:46,070 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 20 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2024-12-02 10:58:46,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 146 flow [2024-12-02 10:58:46,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 10:58:46,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-12-02 10:58:46,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-12-02 10:58:46,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2024-12-02 10:58:46,072 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 104 transitions. [2024-12-02 10:58:46,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 146 flow [2024-12-02 10:58:46,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-12-02 10:58:46,074 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 98 flow [2024-12-02 10:58:46,075 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2024-12-02 10:58:46,075 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2024-12-02 10:58:46,076 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 98 flow [2024-12-02 10:58:46,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:58:46,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:58:46,076 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 10:58:46,083 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-02 10:58:46,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:58:46,277 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-12-02 10:58:46,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:58:46,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1863290824, now seen corresponding path program 1 times [2024-12-02 10:58:46,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 10:58:46,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1632087331] [2024-12-02 10:58:46,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:58:46,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:58:46,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:58:46,280 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:58:46,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 10:58:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:58:46,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-02 10:58:46,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:58:46,418 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 10:58:46,418 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 10:58:46,418 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 10:58:46,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632087331] [2024-12-02 10:58:46,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632087331] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:58:46,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:58:46,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 10:58:46,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070019661] [2024-12-02 10:58:46,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:58:46,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 10:58:46,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 10:58:46,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:58:46,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 10:58:46,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-12-02 10:58:46,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:58:46,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:58:46,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-12-02 10:58:46,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:58:47,124 INFO L124 PetriNetUnfolderBase]: 4352/6574 cut-off events. [2024-12-02 10:58:47,124 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-12-02 10:58:47,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12709 conditions, 6574 events. 4352/6574 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 43816 event pairs, 536 based on Foata normal form. 180/6736 useless extension candidates. Maximal degree in co-relation 12703. Up to 4015 conditions per place. [2024-12-02 10:58:47,152 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 45 selfloop transitions, 6 changer transitions 1/70 dead transitions. [2024-12-02 10:58:47,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 70 transitions, 260 flow [2024-12-02 10:58:47,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 10:58:47,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-12-02 10:58:47,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2024-12-02 10:58:47,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6636363636363637 [2024-12-02 10:58:47,154 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 98 flow. Second operand 4 states and 146 transitions. [2024-12-02 10:58:47,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 70 transitions, 260 flow [2024-12-02 10:58:47,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 70 transitions, 259 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-12-02 10:58:47,156 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 139 flow [2024-12-02 10:58:47,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2024-12-02 10:58:47,157 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2024-12-02 10:58:47,157 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 139 flow [2024-12-02 10:58:47,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:58:47,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:58:47,157 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 10:58:47,168 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-12-02 10:58:47,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:58:47,358 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-12-02 10:58:47,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:58:47,359 INFO L85 PathProgramCache]: Analyzing trace with hash 366433789, now seen corresponding path program 1 times [2024-12-02 10:58:47,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 10:58:47,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2134672930] [2024-12-02 10:58:47,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:58:47,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:58:47,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:58:47,361 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:58:47,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 10:58:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:58:47,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-02 10:58:47,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:58:47,502 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 10:58:47,502 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 10:58:47,502 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 10:58:47,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134672930] [2024-12-02 10:58:47,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134672930] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:58:47,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:58:47,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 10:58:47,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083538800] [2024-12-02 10:58:47,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:58:47,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 10:58:47,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 10:58:47,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 10:58:47,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 10:58:47,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-12-02 10:58:47,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 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 10:58:47,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:58:47,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-12-02 10:58:47,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:58:48,162 INFO L124 PetriNetUnfolderBase]: 3648/5558 cut-off events. [2024-12-02 10:58:48,162 INFO L125 PetriNetUnfolderBase]: For 1509/1509 co-relation queries the response was YES. [2024-12-02 10:58:48,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12822 conditions, 5558 events. 3648/5558 cut-off events. For 1509/1509 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 35935 event pairs, 192 based on Foata normal form. 174/5716 useless extension candidates. Maximal degree in co-relation 12813. Up to 3097 conditions per place. [2024-12-02 10:58:48,203 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 57 selfloop transitions, 10 changer transitions 1/86 dead transitions. [2024-12-02 10:58:48,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 86 transitions, 380 flow [2024-12-02 10:58:48,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 10:58:48,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-12-02 10:58:48,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 185 transitions. [2024-12-02 10:58:48,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6727272727272727 [2024-12-02 10:58:48,206 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 139 flow. Second operand 5 states and 185 transitions. [2024-12-02 10:58:48,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 86 transitions, 380 flow [2024-12-02 10:58:48,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 86 transitions, 369 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-12-02 10:58:48,210 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 191 flow [2024-12-02 10:58:48,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2024-12-02 10:58:48,211 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 1 predicate places. [2024-12-02 10:58:48,212 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 191 flow [2024-12-02 10:58:48,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 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 10:58:48,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:58:48,212 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:58:48,221 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-02 10:58:48,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:58:48,412 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-12-02 10:58:48,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:58:48,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1129816430, now seen corresponding path program 1 times [2024-12-02 10:58:48,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 10:58:48,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [585568181] [2024-12-02 10:58:48,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:58:48,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:58:48,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:58:48,415 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:58:48,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 10:58:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:58:48,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-02 10:58:48,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:58:48,589 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 10:58:48,589 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 10:58:48,589 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 10:58:48,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585568181] [2024-12-02 10:58:48,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585568181] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:58:48,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:58:48,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 10:58:48,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962203719] [2024-12-02 10:58:48,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:58:48,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 10:58:48,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 10:58:48,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 10:58:48,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:58:48,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-12-02 10:58:48,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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 10:58:48,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:58:48,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-12-02 10:58:48,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:58:49,247 INFO L124 PetriNetUnfolderBase]: 2373/3637 cut-off events. [2024-12-02 10:58:49,247 INFO L125 PetriNetUnfolderBase]: For 2865/2865 co-relation queries the response was YES. [2024-12-02 10:58:49,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9448 conditions, 3637 events. 2373/3637 cut-off events. For 2865/2865 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 20852 event pairs, 69 based on Foata normal form. 140/3762 useless extension candidates. Maximal degree in co-relation 9437. Up to 1465 conditions per place. [2024-12-02 10:58:49,266 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 67 selfloop transitions, 14 changer transitions 1/100 dead transitions. [2024-12-02 10:58:49,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 100 transitions, 499 flow [2024-12-02 10:58:49,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 10:58:49,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 10:58:49,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 222 transitions. [2024-12-02 10:58:49,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6727272727272727 [2024-12-02 10:58:49,268 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 191 flow. Second operand 6 states and 222 transitions. [2024-12-02 10:58:49,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 100 transitions, 499 flow [2024-12-02 10:58:49,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 100 transitions, 469 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-12-02 10:58:49,276 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 241 flow [2024-12-02 10:58:49,276 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=241, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2024-12-02 10:58:49,277 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2024-12-02 10:58:49,277 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 241 flow [2024-12-02 10:58:49,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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 10:58:49,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:58:49,277 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:58:49,285 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-02 10:58:49,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:58:49,478 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-12-02 10:58:49,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:58:49,478 INFO L85 PathProgramCache]: Analyzing trace with hash -920526489, now seen corresponding path program 1 times [2024-12-02 10:58:49,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 10:58:49,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1725246852] [2024-12-02 10:58:49,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:58:49,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:58:49,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:58:49,480 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:58:49,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 10:58:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:58:49,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-02 10:58:49,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:58:49,644 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 10:58:49,644 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 10:58:49,644 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 10:58:49,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725246852] [2024-12-02 10:58:49,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725246852] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:58:49,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:58:49,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 10:58:49,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565807626] [2024-12-02 10:58:49,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:58:49,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 10:58:49,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 10:58:49,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 10:58:49,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 10:58:49,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-12-02 10:58:49,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 241 flow. Second operand has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 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 10:58:49,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:58:49,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-12-02 10:58:49,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:58:50,045 INFO L124 PetriNetUnfolderBase]: 1385/2077 cut-off events. [2024-12-02 10:58:50,045 INFO L125 PetriNetUnfolderBase]: For 3115/3115 co-relation queries the response was YES. [2024-12-02 10:58:50,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6137 conditions, 2077 events. 1385/2077 cut-off events. For 3115/3115 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 9880 event pairs, 39 based on Foata normal form. 72/2134 useless extension candidates. Maximal degree in co-relation 6125. Up to 668 conditions per place. [2024-12-02 10:58:50,073 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 61 selfloop transitions, 18 changer transitions 1/98 dead transitions. [2024-12-02 10:58:50,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 98 transitions, 501 flow [2024-12-02 10:58:50,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-02 10:58:50,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-12-02 10:58:50,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 243 transitions. [2024-12-02 10:58:50,075 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6311688311688312 [2024-12-02 10:58:50,075 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 241 flow. Second operand 7 states and 243 transitions. [2024-12-02 10:58:50,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 98 transitions, 501 flow [2024-12-02 10:58:50,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 98 transitions, 455 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-12-02 10:58:50,085 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 251 flow [2024-12-02 10:58:50,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=251, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2024-12-02 10:58:50,086 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 7 predicate places. [2024-12-02 10:58:50,086 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 251 flow [2024-12-02 10:58:50,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 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 10:58:50,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:58:50,087 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:58:50,095 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-12-02 10:58:50,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:58:50,287 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-12-02 10:58:50,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:58:50,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1095667279, now seen corresponding path program 1 times [2024-12-02 10:58:50,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 10:58:50,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1216900690] [2024-12-02 10:58:50,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:58:50,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:58:50,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:58:50,290 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:58:50,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 10:58:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:58:50,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-12-02 10:58:50,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:58:50,502 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 10:58:50,502 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 10:58:50,502 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 10:58:50,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216900690] [2024-12-02 10:58:50,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216900690] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:58:50,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:58:50,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 10:58:50,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035920153] [2024-12-02 10:58:50,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:58:50,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 10:58:50,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 10:58:50,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 10:58:50,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:58:50,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2024-12-02 10:58:50,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 251 flow. Second operand has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 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 10:58:50,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:58:50,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2024-12-02 10:58:50,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:58:50,829 INFO L124 PetriNetUnfolderBase]: 1677/2964 cut-off events. [2024-12-02 10:58:50,829 INFO L125 PetriNetUnfolderBase]: For 1439/1523 co-relation queries the response was YES. [2024-12-02 10:58:50,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6940 conditions, 2964 events. 1677/2964 cut-off events. For 1439/1523 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 18588 event pairs, 670 based on Foata normal form. 16/2770 useless extension candidates. Maximal degree in co-relation 6927. Up to 1206 conditions per place. [2024-12-02 10:58:50,839 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 33 selfloop transitions, 2 changer transitions 19/86 dead transitions. [2024-12-02 10:58:50,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 86 transitions, 437 flow [2024-12-02 10:58:50,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 10:58:50,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 10:58:50,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 205 transitions. [2024-12-02 10:58:50,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2024-12-02 10:58:50,841 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 251 flow. Second operand 6 states and 205 transitions. [2024-12-02 10:58:50,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 86 transitions, 437 flow [2024-12-02 10:58:50,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 86 transitions, 328 flow, removed 22 selfloop flow, removed 10 redundant places. [2024-12-02 10:58:50,852 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 173 flow [2024-12-02 10:58:50,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=173, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2024-12-02 10:58:50,853 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 6 predicate places. [2024-12-02 10:58:50,853 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 173 flow [2024-12-02 10:58:50,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 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 10:58:50,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:58:50,853 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:58:50,862 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-02 10:58:51,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:58:51,053 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-12-02 10:58:51,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:58:51,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1730278273, now seen corresponding path program 2 times [2024-12-02 10:58:51,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 10:58:51,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [888897658] [2024-12-02 10:58:51,054 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-02 10:58:51,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:58:51,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:58:51,056 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:58:51,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-02 10:58:51,138 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-12-02 10:58:51,138 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 10:58:51,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-12-02 10:58:51,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:58:51,256 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 10:58:51,256 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 10:58:51,257 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 10:58:51,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888897658] [2024-12-02 10:58:51,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888897658] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:58:51,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:58:51,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-12-02 10:58:51,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925237307] [2024-12-02 10:58:51,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:58:51,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-12-02 10:58:51,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 10:58:51,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-12-02 10:58:51,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-12-02 10:58:51,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-12-02 10:58:51,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 173 flow. Second operand has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:58:51,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:58:51,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-12-02 10:58:51,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:58:51,970 INFO L124 PetriNetUnfolderBase]: 4953/7115 cut-off events. [2024-12-02 10:58:51,970 INFO L125 PetriNetUnfolderBase]: For 1171/1229 co-relation queries the response was YES. [2024-12-02 10:58:51,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16425 conditions, 7115 events. 4953/7115 cut-off events. For 1171/1229 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 41172 event pairs, 899 based on Foata normal form. 24/6965 useless extension candidates. Maximal degree in co-relation 16414. Up to 3758 conditions per place. [2024-12-02 10:58:51,988 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 58 selfloop transitions, 10 changer transitions 59/144 dead transitions. [2024-12-02 10:58:51,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 144 transitions, 674 flow [2024-12-02 10:58:51,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-02 10:58:51,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-12-02 10:58:51,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 319 transitions. [2024-12-02 10:58:51,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.58 [2024-12-02 10:58:51,990 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 173 flow. Second operand 10 states and 319 transitions. [2024-12-02 10:58:51,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 144 transitions, 674 flow [2024-12-02 10:58:51,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 144 transitions, 662 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-12-02 10:58:51,993 INFO L231 Difference]: Finished difference. Result has 76 places, 61 transitions, 221 flow [2024-12-02 10:58:51,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=221, PETRI_PLACES=76, PETRI_TRANSITIONS=61} [2024-12-02 10:58:51,994 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 14 predicate places. [2024-12-02 10:58:51,994 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 61 transitions, 221 flow [2024-12-02 10:58:51,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:58:51,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:58:51,995 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:58:52,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-12-02 10:58:52,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:58:52,195 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-12-02 10:58:52,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:58:52,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1000590603, now seen corresponding path program 3 times [2024-12-02 10:58:52,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 10:58:52,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [441482313] [2024-12-02 10:58:52,196 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-02 10:58:52,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:58:52,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:58:52,198 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:58:52,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-02 10:58:52,284 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-12-02 10:58:52,285 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-02 10:58:52,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-12-02 10:58:52,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:58:52,347 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 10:58:52,347 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 10:58:52,347 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 10:58:52,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441482313] [2024-12-02 10:58:52,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441482313] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 10:58:52,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 10:58:52,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 10:58:52,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773998770] [2024-12-02 10:58:52,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 10:58:52,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 10:58:52,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 10:58:52,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 10:58:52,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-12-02 10:58:52,357 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2024-12-02 10:58:52,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 61 transitions, 221 flow. Second operand has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 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 10:58:52,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-12-02 10:58:52,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2024-12-02 10:58:52,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-12-02 10:58:52,992 INFO L124 PetriNetUnfolderBase]: 3635/6380 cut-off events. [2024-12-02 10:58:52,992 INFO L125 PetriNetUnfolderBase]: For 544/559 co-relation queries the response was YES. [2024-12-02 10:58:53,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12900 conditions, 6380 events. 3635/6380 cut-off events. For 544/559 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 48158 event pairs, 1636 based on Foata normal form. 19/5652 useless extension candidates. Maximal degree in co-relation 12885. Up to 2598 conditions per place. [2024-12-02 10:58:53,016 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 29 selfloop transitions, 2 changer transitions 26/93 dead transitions. [2024-12-02 10:58:53,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 93 transitions, 412 flow [2024-12-02 10:58:53,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 10:58:53,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-12-02 10:58:53,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 207 transitions. [2024-12-02 10:58:53,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6272727272727273 [2024-12-02 10:58:53,018 INFO L175 Difference]: Start difference. First operand has 76 places, 61 transitions, 221 flow. Second operand 6 states and 207 transitions. [2024-12-02 10:58:53,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 93 transitions, 412 flow [2024-12-02 10:58:53,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 93 transitions, 390 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-12-02 10:58:53,026 INFO L231 Difference]: Finished difference. Result has 75 places, 61 transitions, 218 flow [2024-12-02 10:58:53,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=218, PETRI_PLACES=75, PETRI_TRANSITIONS=61} [2024-12-02 10:58:53,027 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 13 predicate places. [2024-12-02 10:58:53,027 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 61 transitions, 218 flow [2024-12-02 10:58:53,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 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 10:58:53,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-12-02 10:58:53,027 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 10:58:53,034 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-12-02 10:58:53,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:58:53,228 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-12-02 10:58:53,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:58:53,229 INFO L85 PathProgramCache]: Analyzing trace with hash 2104216301, now seen corresponding path program 4 times [2024-12-02 10:58:53,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 10:58:53,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1514659423] [2024-12-02 10:58:53,229 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-12-02 10:58:53,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:58:53,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:58:53,231 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:58:53,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-02 10:58:53,317 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-12-02 10:58:53,317 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-12-02 10:58:53,317 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 10:58:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 10:58:53,403 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-12-02 10:58:53,403 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 10:58:53,404 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-12-02 10:58:53,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-12-02 10:58:53,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-12-02 10:58:53,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-12-02 10:58:53,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-12-02 10:58:53,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-12-02 10:58:53,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-12-02 10:58:53,406 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-12-02 10:58:53,413 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-12-02 10:58:53,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:58:53,607 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2024-12-02 10:58:53,692 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-12-02 10:58:53,692 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 10:58:53,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 10:58:53 BasicIcfg [2024-12-02 10:58:53,697 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 10:58:53,698 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 10:58:53,698 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 10:58:53,698 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 10:58:53,698 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:58:44" (3/4) ... [2024-12-02 10:58:53,700 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-12-02 10:58:53,700 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 10:58:53,701 INFO L158 Benchmark]: Toolchain (without parser) took 10324.42ms. Allocated memory was 92.3MB in the beginning and 595.6MB in the end (delta: 503.3MB). Free memory was 67.8MB in the beginning and 244.2MB in the end (delta: -176.4MB). Peak memory consumption was 327.2MB. Max. memory is 16.1GB. [2024-12-02 10:58:53,701 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 10:58:53,701 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.69ms. Allocated memory is still 92.3MB. Free memory was 67.6MB in the beginning and 44.2MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-02 10:58:53,702 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.16ms. Allocated memory is still 92.3MB. Free memory was 44.2MB in the beginning and 41.7MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 10:58:53,702 INFO L158 Benchmark]: Boogie Preprocessor took 47.40ms. Allocated memory is still 92.3MB. Free memory was 41.7MB in the beginning and 38.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 10:58:53,702 INFO L158 Benchmark]: RCFGBuilder took 657.41ms. Allocated memory is still 92.3MB. Free memory was 38.7MB in the beginning and 32.3MB in the end (delta: 6.4MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2024-12-02 10:58:53,702 INFO L158 Benchmark]: TraceAbstraction took 9174.62ms. Allocated memory was 92.3MB in the beginning and 595.6MB in the end (delta: 503.3MB). Free memory was 31.4MB in the beginning and 244.2MB in the end (delta: -212.8MB). Peak memory consumption was 288.0MB. Max. memory is 16.1GB. [2024-12-02 10:58:53,703 INFO L158 Benchmark]: Witness Printer took 2.60ms. Allocated memory is still 595.6MB. Free memory was 244.2MB in the beginning and 244.2MB in the end (delta: 44.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 10:58:53,704 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.30ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.69ms. Allocated memory is still 92.3MB. Free memory was 67.6MB in the beginning and 44.2MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.16ms. Allocated memory is still 92.3MB. Free memory was 44.2MB in the beginning and 41.7MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.40ms. Allocated memory is still 92.3MB. Free memory was 41.7MB in the beginning and 38.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 657.41ms. Allocated memory is still 92.3MB. Free memory was 38.7MB in the beginning and 32.3MB in the end (delta: 6.4MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * TraceAbstraction took 9174.62ms. Allocated memory was 92.3MB in the beginning and 595.6MB in the end (delta: 503.3MB). Free memory was 31.4MB in the beginning and 244.2MB in the end (delta: -212.8MB). Peak memory consumption was 288.0MB. Max. memory is 16.1GB. * Witness Printer took 2.60ms. Allocated memory is still 595.6MB. Free memory was 244.2MB in the beginning and 244.2MB in the end (delta: 44.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1253; [L845] FCALL, FORK 0 pthread_create(&t1253, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 0 pthread_t t1254; [L847] FCALL, FORK 0 pthread_create(&t1254, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253=-3, t1254=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1255; [L849] FCALL, FORK 0 pthread_create(&t1255, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253=-3, t1254=-2, t1255=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1256; [L851] FCALL, FORK 0 pthread_create(&t1256, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1253=-3, t1254=-2, t1255=-1, t1256=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L804] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L804] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L813] 4 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L816] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L819] 4 __unbuffered_p3_EBX = b VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L750] 1 b = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L765] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L783] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L786] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1253=-3, t1254=-2, t1255=-1, t1256=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1253=-3, t1254=-2, t1255=-1, t1256=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L869] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L870] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L871] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L872] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L874] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1253=-3, t1254=-2, t1255=-1, t1256=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L17] 0 __assert_fail ("0", "mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 847]: 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: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 89 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 504 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 469 mSDsluCounter, 129 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 101 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1509 IncrementalHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 28 mSDtfsCounter, 1509 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 252 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=251occurred in iteration=6, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 281 NumberOfCodeBlocks, 281 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 233 ConstructedInterpolants, 0 QuantifiedInterpolants, 573 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1096 ConjunctsInSsa, 52 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 10:58:53,719 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_240c5004-1757-42e1-afe3-383dcde300aa/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