./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:26:25,928 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:26:25,998 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:26:26,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:26:26,004 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:26:26,024 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:26:26,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:26:26,025 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:26:26,026 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:26:26,026 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:26:26,026 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:26:26,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:26:26,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:26:26,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:26:26,027 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:26:26,027 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:26:26,028 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:26:26,028 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:26:26,028 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:26:26,029 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:26:26,029 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:26:26,032 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:26:26,032 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:26:26,032 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:26:26,032 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:26:26,033 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:26:26,033 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:26:26,033 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:26:26,033 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:26:26,034 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:26:26,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:26:26,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:26:26,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:26:26,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:26:26,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:26:26,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:26:26,035 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:26:26,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:26:26,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:26:26,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:26:26,036 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:26:26,040 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:26:26,040 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 [2024-11-19 09:26:26,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:26:26,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:26:26,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:26:26,271 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:26:26,272 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:26:26,272 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-11-19 09:26:27,467 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:26:27,663 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:26:27,664 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-11-19 09:26:27,683 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5ad61b87/e2803157e627481d975e8d0e815f32da/FLAGcb36ee5e5 [2024-11-19 09:26:28,020 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5ad61b87/e2803157e627481d975e8d0e815f32da [2024-11-19 09:26:28,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:26:28,023 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:26:28,025 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:26:28,025 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:26:28,029 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:26:28,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:26:28" (1/1) ... [2024-11-19 09:26:28,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@712d606b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:28, skipping insertion in model container [2024-11-19 09:26:28,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:26:28" (1/1) ... [2024-11-19 09:26:28,066 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:26:28,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:26:28,431 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:26:28,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:26:28,521 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:26:28,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:28 WrapperNode [2024-11-19 09:26:28,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:26:28,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:26:28,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:26:28,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:26:28,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:28" (1/1) ... [2024-11-19 09:26:28,543 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:28" (1/1) ... [2024-11-19 09:26:28,565 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 128 [2024-11-19 09:26:28,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:26:28,566 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:26:28,566 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:26:28,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:26:28,576 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:28" (1/1) ... [2024-11-19 09:26:28,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:28" (1/1) ... [2024-11-19 09:26:28,579 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:28" (1/1) ... [2024-11-19 09:26:28,597 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 09:26:28,597 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:28" (1/1) ... [2024-11-19 09:26:28,597 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:28" (1/1) ... [2024-11-19 09:26:28,602 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:28" (1/1) ... [2024-11-19 09:26:28,604 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:28" (1/1) ... [2024-11-19 09:26:28,611 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:28" (1/1) ... [2024-11-19 09:26:28,612 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:28" (1/1) ... [2024-11-19 09:26:28,614 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:26:28,616 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:26:28,616 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:26:28,616 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:26:28,616 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:28" (1/1) ... [2024-11-19 09:26:28,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:26:28,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:26:28,644 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:26:28,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:26:28,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 09:26:28,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:26:28,680 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-19 09:26:28,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-19 09:26:28,680 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-19 09:26:28,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-19 09:26:28,680 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-19 09:26:28,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-19 09:26:28,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:26:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 09:26:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:26:28,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:26:28,682 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:26:28,794 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:26:28,795 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:26:29,030 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:26:29,030 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:26:29,180 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:26:29,181 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 09:26:29,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:26:29 BoogieIcfgContainer [2024-11-19 09:26:29,182 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:26:29,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:26:29,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:26:29,186 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:26:29,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:26:28" (1/3) ... [2024-11-19 09:26:29,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fdf28ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:26:29, skipping insertion in model container [2024-11-19 09:26:29,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:28" (2/3) ... [2024-11-19 09:26:29,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fdf28ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:26:29, skipping insertion in model container [2024-11-19 09:26:29,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:26:29" (3/3) ... [2024-11-19 09:26:29,189 INFO L112 eAbstractionObserver]: Analyzing ICFG mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-11-19 09:26:29,201 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:26:29,202 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-19 09:26:29,202 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:26:29,248 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 09:26:29,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 106 flow [2024-11-19 09:26:29,320 INFO L124 PetriNetUnfolderBase]: 2/44 cut-off events. [2024-11-19 09:26:29,321 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:26:29,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 2/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2024-11-19 09:26:29,326 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 47 transitions, 106 flow [2024-11-19 09:26:29,328 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 44 transitions, 97 flow [2024-11-19 09:26:29,338 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:26:29,344 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;@5994844e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:26:29,344 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-19 09:26:29,347 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:26:29,347 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-19 09:26:29,347 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:26:29,347 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:26:29,347 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-19 09:26:29,348 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:26:29,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:26:29,352 INFO L85 PathProgramCache]: Analyzing trace with hash 12370397, now seen corresponding path program 1 times [2024-11-19 09:26:29,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:26:29,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812806499] [2024-11-19 09:26:29,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:26:29,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:26:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:26:29,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:26:29,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:26:29,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812806499] [2024-11-19 09:26:29,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812806499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:26:29,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:26:29,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:26:29,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676401172] [2024-11-19 09:26:29,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:26:29,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:26:29,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:26:29,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:26:29,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:26:29,746 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-11-19 09:26:29,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:29,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:26:29,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-11-19 09:26:29,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:26:30,119 INFO L124 PetriNetUnfolderBase]: 825/1738 cut-off events. [2024-11-19 09:26:30,120 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-19 09:26:30,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3019 conditions, 1738 events. 825/1738 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12413 event pairs, 129 based on Foata normal form. 96/1816 useless extension candidates. Maximal degree in co-relation 3008. Up to 1009 conditions per place. [2024-11-19 09:26:30,134 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 33 selfloop transitions, 2 changer transitions 2/56 dead transitions. [2024-11-19 09:26:30,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 56 transitions, 201 flow [2024-11-19 09:26:30,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:26:30,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:26:30,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-11-19 09:26:30,144 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7659574468085106 [2024-11-19 09:26:30,145 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 97 flow. Second operand 3 states and 108 transitions. [2024-11-19 09:26:30,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 56 transitions, 201 flow [2024-11-19 09:26:30,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 56 transitions, 196 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:26:30,152 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 88 flow [2024-11-19 09:26:30,153 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-11-19 09:26:30,156 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2024-11-19 09:26:30,157 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 88 flow [2024-11-19 09:26:30,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:30,158 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:26:30,158 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:26:30,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:26:30,158 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:26:30,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:26:30,159 INFO L85 PathProgramCache]: Analyzing trace with hash -796805383, now seen corresponding path program 1 times [2024-11-19 09:26:30,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:26:30,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716836971] [2024-11-19 09:26:30,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:26:30,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:26:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:26:30,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:26:30,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:26:30,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716836971] [2024-11-19 09:26:30,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716836971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:26:30,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:26:30,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:26:30,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980219950] [2024-11-19 09:26:30,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:26:30,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:26:30,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:26:30,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:26:30,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:26:30,227 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-11-19 09:26:30,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:30,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:26:30,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-11-19 09:26:30,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:26:30,410 INFO L124 PetriNetUnfolderBase]: 721/1387 cut-off events. [2024-11-19 09:26:30,410 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2024-11-19 09:26:30,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2607 conditions, 1387 events. 721/1387 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9149 event pairs, 721 based on Foata normal form. 48/1378 useless extension candidates. Maximal degree in co-relation 2597. Up to 1090 conditions per place. [2024-11-19 09:26:30,416 INFO L140 encePairwiseOnDemand]: 45/47 looper letters, 18 selfloop transitions, 1 changer transitions 1/38 dead transitions. [2024-11-19 09:26:30,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 126 flow [2024-11-19 09:26:30,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:26:30,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:26:30,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-11-19 09:26:30,419 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2024-11-19 09:26:30,419 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 88 flow. Second operand 3 states and 84 transitions. [2024-11-19 09:26:30,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 126 flow [2024-11-19 09:26:30,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 38 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:26:30,421 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 82 flow [2024-11-19 09:26:30,422 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-11-19 09:26:30,422 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2024-11-19 09:26:30,422 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 82 flow [2024-11-19 09:26:30,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:30,423 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:26:30,423 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:26:30,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 09:26:30,424 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:26:30,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:26:30,424 INFO L85 PathProgramCache]: Analyzing trace with hash -796803957, now seen corresponding path program 1 times [2024-11-19 09:26:30,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:26:30,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666374283] [2024-11-19 09:26:30,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:26:30,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:26:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:26:30,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:26:30,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:26:30,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666374283] [2024-11-19 09:26:30,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666374283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:26:30,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:26:30,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:26:30,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692889627] [2024-11-19 09:26:30,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:26:30,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:26:30,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:26:30,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:26:30,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:26:30,625 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-11-19 09:26:30,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:30,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:26:30,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-11-19 09:26:30,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:26:31,060 INFO L124 PetriNetUnfolderBase]: 1879/3205 cut-off events. [2024-11-19 09:26:31,060 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:26:31,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6035 conditions, 3205 events. 1879/3205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 21651 event pairs, 557 based on Foata normal form. 0/3116 useless extension candidates. Maximal degree in co-relation 6029. Up to 1766 conditions per place. [2024-11-19 09:26:31,071 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 29 selfloop transitions, 3 changer transitions 46/92 dead transitions. [2024-11-19 09:26:31,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 92 transitions, 350 flow [2024-11-19 09:26:31,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:26:31,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:26:31,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 224 transitions. [2024-11-19 09:26:31,073 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2024-11-19 09:26:31,073 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 82 flow. Second operand 8 states and 224 transitions. [2024-11-19 09:26:31,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 92 transitions, 350 flow [2024-11-19 09:26:31,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 92 transitions, 349 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:26:31,075 INFO L231 Difference]: Finished difference. Result has 57 places, 38 transitions, 114 flow [2024-11-19 09:26:31,075 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=114, PETRI_PLACES=57, PETRI_TRANSITIONS=38} [2024-11-19 09:26:31,076 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2024-11-19 09:26:31,076 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 38 transitions, 114 flow [2024-11-19 09:26:31,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:31,076 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:26:31,077 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:26:31,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 09:26:31,077 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:26:31,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:26:31,078 INFO L85 PathProgramCache]: Analyzing trace with hash 564387754, now seen corresponding path program 1 times [2024-11-19 09:26:31,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:26:31,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519883872] [2024-11-19 09:26:31,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:26:31,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:26:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:26:31,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:26:31,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:26:31,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519883872] [2024-11-19 09:26:31,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519883872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:26:31,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:26:31,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:26:31,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717202104] [2024-11-19 09:26:31,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:26:31,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:26:31,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:26:31,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:26:31,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:26:31,261 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2024-11-19 09:26:31,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 38 transitions, 114 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:31,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:26:31,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2024-11-19 09:26:31,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:26:32,111 INFO L124 PetriNetUnfolderBase]: 3887/6308 cut-off events. [2024-11-19 09:26:32,112 INFO L125 PetriNetUnfolderBase]: For 3063/3063 co-relation queries the response was YES. [2024-11-19 09:26:32,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14618 conditions, 6308 events. 3887/6308 cut-off events. For 3063/3063 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 41910 event pairs, 631 based on Foata normal form. 210/6496 useless extension candidates. Maximal degree in co-relation 14606. Up to 2367 conditions per place. [2024-11-19 09:26:32,139 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 47 selfloop transitions, 6 changer transitions 67/131 dead transitions. [2024-11-19 09:26:32,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 131 transitions, 606 flow [2024-11-19 09:26:32,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:26:32,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 09:26:32,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 271 transitions. [2024-11-19 09:26:32,142 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5765957446808511 [2024-11-19 09:26:32,142 INFO L175 Difference]: Start difference. First operand has 57 places, 38 transitions, 114 flow. Second operand 10 states and 271 transitions. [2024-11-19 09:26:32,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 131 transitions, 606 flow [2024-11-19 09:26:32,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 131 transitions, 583 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-11-19 09:26:32,177 INFO L231 Difference]: Finished difference. Result has 66 places, 42 transitions, 183 flow [2024-11-19 09:26:32,177 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=183, PETRI_PLACES=66, PETRI_TRANSITIONS=42} [2024-11-19 09:26:32,179 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2024-11-19 09:26:32,179 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 42 transitions, 183 flow [2024-11-19 09:26:32,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:32,179 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:26:32,180 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:26:32,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 09:26:32,180 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:26:32,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:26:32,181 INFO L85 PathProgramCache]: Analyzing trace with hash 641308894, now seen corresponding path program 1 times [2024-11-19 09:26:32,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:26:32,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70931552] [2024-11-19 09:26:32,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:26:32,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:26:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:26:32,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:26:32,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:26:32,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70931552] [2024-11-19 09:26:32,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70931552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:26:32,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:26:32,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:26:32,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055022273] [2024-11-19 09:26:32,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:26:32,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:26:32,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:26:32,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:26:32,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:26:32,308 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-11-19 09:26:32,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 42 transitions, 183 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:32,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:26:32,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-11-19 09:26:32,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:26:33,010 INFO L124 PetriNetUnfolderBase]: 2431/4342 cut-off events. [2024-11-19 09:26:33,010 INFO L125 PetriNetUnfolderBase]: For 8434/8789 co-relation queries the response was YES. [2024-11-19 09:26:33,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12414 conditions, 4342 events. 2431/4342 cut-off events. For 8434/8789 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 31120 event pairs, 743 based on Foata normal form. 169/4361 useless extension candidates. Maximal degree in co-relation 12394. Up to 2117 conditions per place. [2024-11-19 09:26:33,035 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 33 selfloop transitions, 3 changer transitions 37/92 dead transitions. [2024-11-19 09:26:33,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 92 transitions, 525 flow [2024-11-19 09:26:33,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:26:33,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:26:33,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 199 transitions. [2024-11-19 09:26:33,037 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6048632218844985 [2024-11-19 09:26:33,037 INFO L175 Difference]: Start difference. First operand has 66 places, 42 transitions, 183 flow. Second operand 7 states and 199 transitions. [2024-11-19 09:26:33,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 92 transitions, 525 flow [2024-11-19 09:26:33,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 92 transitions, 501 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-11-19 09:26:33,057 INFO L231 Difference]: Finished difference. Result has 66 places, 42 transitions, 186 flow [2024-11-19 09:26:33,057 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=186, PETRI_PLACES=66, PETRI_TRANSITIONS=42} [2024-11-19 09:26:33,058 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2024-11-19 09:26:33,058 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 42 transitions, 186 flow [2024-11-19 09:26:33,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:33,059 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:26:33,059 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:26:33,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 09:26:33,059 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:26:33,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:26:33,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1432332543, now seen corresponding path program 1 times [2024-11-19 09:26:33,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:26:33,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705948668] [2024-11-19 09:26:33,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:26:33,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:26:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:26:33,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:26:33,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:26:33,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705948668] [2024-11-19 09:26:33,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705948668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:26:33,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:26:33,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:26:33,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776256920] [2024-11-19 09:26:33,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:26:33,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:26:33,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:26:33,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:26:33,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:26:33,180 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-11-19 09:26:33,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 42 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:33,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:26:33,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-11-19 09:26:33,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:26:33,755 INFO L124 PetriNetUnfolderBase]: 3816/6178 cut-off events. [2024-11-19 09:26:33,755 INFO L125 PetriNetUnfolderBase]: For 6622/6942 co-relation queries the response was YES. [2024-11-19 09:26:33,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15484 conditions, 6178 events. 3816/6178 cut-off events. For 6622/6942 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 39782 event pairs, 732 based on Foata normal form. 277/6198 useless extension candidates. Maximal degree in co-relation 15462. Up to 3206 conditions per place. [2024-11-19 09:26:33,788 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 46 selfloop transitions, 5 changer transitions 0/69 dead transitions. [2024-11-19 09:26:33,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 69 transitions, 366 flow [2024-11-19 09:26:33,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:26:33,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:26:33,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2024-11-19 09:26:33,789 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.648936170212766 [2024-11-19 09:26:33,790 INFO L175 Difference]: Start difference. First operand has 66 places, 42 transitions, 186 flow. Second operand 4 states and 122 transitions. [2024-11-19 09:26:33,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 69 transitions, 366 flow [2024-11-19 09:26:33,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 69 transitions, 352 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-11-19 09:26:33,802 INFO L231 Difference]: Finished difference. Result has 61 places, 46 transitions, 210 flow [2024-11-19 09:26:33,802 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=210, PETRI_PLACES=61, PETRI_TRANSITIONS=46} [2024-11-19 09:26:33,802 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2024-11-19 09:26:33,803 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 46 transitions, 210 flow [2024-11-19 09:26:33,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:33,803 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:26:33,803 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:26:33,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 09:26:33,803 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:26:33,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:26:33,804 INFO L85 PathProgramCache]: Analyzing trace with hash 533856218, now seen corresponding path program 1 times [2024-11-19 09:26:33,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:26:33,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474363938] [2024-11-19 09:26:33,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:26:33,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:26:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:26:33,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:26:33,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:26:33,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474363938] [2024-11-19 09:26:33,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474363938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:26:33,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:26:33,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:26:33,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397386081] [2024-11-19 09:26:33,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:26:33,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:26:33,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:26:33,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:26:33,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:26:33,966 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-11-19 09:26:33,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 46 transitions, 210 flow. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:33,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:26:33,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-11-19 09:26:33,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:26:34,553 INFO L124 PetriNetUnfolderBase]: 2706/4422 cut-off events. [2024-11-19 09:26:34,553 INFO L125 PetriNetUnfolderBase]: For 3866/4082 co-relation queries the response was YES. [2024-11-19 09:26:34,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11874 conditions, 4422 events. 2706/4422 cut-off events. For 3866/4082 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 26811 event pairs, 455 based on Foata normal form. 218/4432 useless extension candidates. Maximal degree in co-relation 11854. Up to 1313 conditions per place. [2024-11-19 09:26:34,578 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 59 selfloop transitions, 8 changer transitions 0/85 dead transitions. [2024-11-19 09:26:34,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 85 transitions, 473 flow [2024-11-19 09:26:34,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:26:34,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:26:34,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions. [2024-11-19 09:26:34,579 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6595744680851063 [2024-11-19 09:26:34,579 INFO L175 Difference]: Start difference. First operand has 61 places, 46 transitions, 210 flow. Second operand 5 states and 155 transitions. [2024-11-19 09:26:34,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 85 transitions, 473 flow [2024-11-19 09:26:34,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 85 transitions, 470 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:26:34,583 INFO L231 Difference]: Finished difference. Result has 66 places, 50 transitions, 262 flow [2024-11-19 09:26:34,583 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=262, PETRI_PLACES=66, PETRI_TRANSITIONS=50} [2024-11-19 09:26:34,584 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2024-11-19 09:26:34,584 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 50 transitions, 262 flow [2024-11-19 09:26:34,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:34,584 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:26:34,584 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:26:34,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 09:26:34,585 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:26:34,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:26:34,585 INFO L85 PathProgramCache]: Analyzing trace with hash 717608492, now seen corresponding path program 1 times [2024-11-19 09:26:34,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:26:34,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625308818] [2024-11-19 09:26:34,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:26:34,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:26:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:26:35,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:26:35,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:26:35,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625308818] [2024-11-19 09:26:35,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625308818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:26:35,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:26:35,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 09:26:35,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408342081] [2024-11-19 09:26:35,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:26:35,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:26:35,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:26:35,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:26:35,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:26:35,133 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-11-19 09:26:35,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 50 transitions, 262 flow. Second operand has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:35,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:26:35,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-11-19 09:26:35,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:26:35,771 INFO L124 PetriNetUnfolderBase]: 2675/5306 cut-off events. [2024-11-19 09:26:35,772 INFO L125 PetriNetUnfolderBase]: For 6750/8001 co-relation queries the response was YES. [2024-11-19 09:26:35,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14971 conditions, 5306 events. 2675/5306 cut-off events. For 6750/8001 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 42591 event pairs, 940 based on Foata normal form. 122/5004 useless extension candidates. Maximal degree in co-relation 14948. Up to 2187 conditions per place. [2024-11-19 09:26:35,800 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 51 selfloop transitions, 14 changer transitions 17/111 dead transitions. [2024-11-19 09:26:35,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 111 transitions, 652 flow [2024-11-19 09:26:35,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:26:35,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:26:35,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 240 transitions. [2024-11-19 09:26:35,802 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6382978723404256 [2024-11-19 09:26:35,802 INFO L175 Difference]: Start difference. First operand has 66 places, 50 transitions, 262 flow. Second operand 8 states and 240 transitions. [2024-11-19 09:26:35,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 111 transitions, 652 flow [2024-11-19 09:26:35,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 111 transitions, 640 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-19 09:26:35,807 INFO L231 Difference]: Finished difference. Result has 75 places, 65 transitions, 359 flow [2024-11-19 09:26:35,807 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=359, PETRI_PLACES=75, PETRI_TRANSITIONS=65} [2024-11-19 09:26:35,808 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2024-11-19 09:26:35,808 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 65 transitions, 359 flow [2024-11-19 09:26:35,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:35,808 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:26:35,808 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:26:35,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 09:26:35,809 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:26:35,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:26:35,809 INFO L85 PathProgramCache]: Analyzing trace with hash -851424660, now seen corresponding path program 2 times [2024-11-19 09:26:35,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:26:35,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318021741] [2024-11-19 09:26:35,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:26:35,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:26:35,861 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:26:35,862 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:26:35,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:26:35,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:26:35,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318021741] [2024-11-19 09:26:35,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318021741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:26:35,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:26:35,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:26:35,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014044337] [2024-11-19 09:26:35,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:26:35,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:26:35,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:26:35,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:26:35,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:26:35,999 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-11-19 09:26:35,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 359 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:35,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:26:35,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-11-19 09:26:35,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:26:36,583 INFO L124 PetriNetUnfolderBase]: 3906/6315 cut-off events. [2024-11-19 09:26:36,583 INFO L125 PetriNetUnfolderBase]: For 11507/12164 co-relation queries the response was YES. [2024-11-19 09:26:36,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20519 conditions, 6315 events. 3906/6315 cut-off events. For 11507/12164 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 41469 event pairs, 418 based on Foata normal form. 213/6238 useless extension candidates. Maximal degree in co-relation 20493. Up to 2370 conditions per place. [2024-11-19 09:26:36,611 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 70 selfloop transitions, 11 changer transitions 16/115 dead transitions. [2024-11-19 09:26:36,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 115 transitions, 781 flow [2024-11-19 09:26:36,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:26:36,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:26:36,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2024-11-19 09:26:36,616 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6028368794326241 [2024-11-19 09:26:36,616 INFO L175 Difference]: Start difference. First operand has 75 places, 65 transitions, 359 flow. Second operand 6 states and 170 transitions. [2024-11-19 09:26:36,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 115 transitions, 781 flow [2024-11-19 09:26:36,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 115 transitions, 731 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-11-19 09:26:36,625 INFO L231 Difference]: Finished difference. Result has 73 places, 59 transitions, 329 flow [2024-11-19 09:26:36,625 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=329, PETRI_PLACES=73, PETRI_TRANSITIONS=59} [2024-11-19 09:26:36,626 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places. [2024-11-19 09:26:36,626 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 59 transitions, 329 flow [2024-11-19 09:26:36,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:36,626 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:26:36,626 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:26:36,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 09:26:36,627 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:26:36,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:26:36,627 INFO L85 PathProgramCache]: Analyzing trace with hash 490316748, now seen corresponding path program 1 times [2024-11-19 09:26:36,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:26:36,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112331705] [2024-11-19 09:26:36,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:26:36,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:26:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:26:36,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:26:36,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:26:36,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112331705] [2024-11-19 09:26:36,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112331705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:26:36,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:26:36,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:26:36,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90472312] [2024-11-19 09:26:36,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:26:36,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:26:36,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:26:36,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:26:36,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:26:36,840 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-11-19 09:26:36,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 59 transitions, 329 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:36,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:26:36,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-11-19 09:26:36,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:26:37,291 INFO L124 PetriNetUnfolderBase]: 2450/4793 cut-off events. [2024-11-19 09:26:37,291 INFO L125 PetriNetUnfolderBase]: For 10900/12285 co-relation queries the response was YES. [2024-11-19 09:26:37,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15116 conditions, 4793 events. 2450/4793 cut-off events. For 10900/12285 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 38227 event pairs, 556 based on Foata normal form. 101/4365 useless extension candidates. Maximal degree in co-relation 15093. Up to 1647 conditions per place. [2024-11-19 09:26:37,315 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 32 selfloop transitions, 1 changer transitions 42/101 dead transitions. [2024-11-19 09:26:37,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 101 transitions, 668 flow [2024-11-19 09:26:37,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:26:37,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:26:37,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2024-11-19 09:26:37,317 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5709219858156028 [2024-11-19 09:26:37,317 INFO L175 Difference]: Start difference. First operand has 73 places, 59 transitions, 329 flow. Second operand 6 states and 161 transitions. [2024-11-19 09:26:37,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 101 transitions, 668 flow [2024-11-19 09:26:37,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 101 transitions, 606 flow, removed 25 selfloop flow, removed 5 redundant places. [2024-11-19 09:26:37,342 INFO L231 Difference]: Finished difference. Result has 75 places, 54 transitions, 273 flow [2024-11-19 09:26:37,343 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=273, PETRI_PLACES=75, PETRI_TRANSITIONS=54} [2024-11-19 09:26:37,343 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2024-11-19 09:26:37,343 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 54 transitions, 273 flow [2024-11-19 09:26:37,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:37,344 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:26:37,344 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:26:37,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 09:26:37,344 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:26:37,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:26:37,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1397910484, now seen corresponding path program 2 times [2024-11-19 09:26:37,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:26:37,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57460176] [2024-11-19 09:26:37,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:26:37,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:26:37,403 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:26:37,404 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 09:26:37,404 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:26:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:26:37,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 09:26:37,505 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:26:37,506 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-19 09:26:37,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-19 09:26:37,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-19 09:26:37,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-19 09:26:37,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-19 09:26:37,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-19 09:26:37,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-19 09:26:37,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 09:26:37,509 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:26:37,595 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:26:37,595 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:26:37,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:26:37 BasicIcfg [2024-11-19 09:26:37,602 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:26:37,603 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:26:37,603 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:26:37,603 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:26:37,603 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:26:29" (3/4) ... [2024-11-19 09:26:37,606 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 09:26:37,607 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:26:37,607 INFO L158 Benchmark]: Toolchain (without parser) took 9583.82ms. Allocated memory was 161.5MB in the beginning and 868.2MB in the end (delta: 706.7MB). Free memory was 92.9MB in the beginning and 768.4MB in the end (delta: -675.5MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. [2024-11-19 09:26:37,607 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 66.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:26:37,608 INFO L158 Benchmark]: CACSL2BoogieTranslator took 497.47ms. Allocated memory is still 161.5MB. Free memory was 92.7MB in the beginning and 117.7MB in the end (delta: -24.9MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2024-11-19 09:26:37,608 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.32ms. Allocated memory is still 161.5MB. Free memory was 117.7MB in the beginning and 114.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:26:37,608 INFO L158 Benchmark]: Boogie Preprocessor took 47.66ms. Allocated memory is still 161.5MB. Free memory was 114.9MB in the beginning and 111.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 09:26:37,608 INFO L158 Benchmark]: RCFGBuilder took 566.06ms. Allocated memory is still 161.5MB. Free memory was 111.4MB in the beginning and 58.9MB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-11-19 09:26:37,609 INFO L158 Benchmark]: TraceAbstraction took 8418.51ms. Allocated memory was 161.5MB in the beginning and 868.2MB in the end (delta: 706.7MB). Free memory was 58.3MB in the beginning and 768.4MB in the end (delta: -710.1MB). Peak memory consumption was 516.3MB. Max. memory is 16.1GB. [2024-11-19 09:26:37,612 INFO L158 Benchmark]: Witness Printer took 4.16ms. Allocated memory is still 868.2MB. Free memory is still 768.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:26:37,613 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.15ms. Allocated memory is still 104.9MB. Free memory is still 66.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 497.47ms. Allocated memory is still 161.5MB. Free memory was 92.7MB in the beginning and 117.7MB in the end (delta: -24.9MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.32ms. Allocated memory is still 161.5MB. Free memory was 117.7MB in the beginning and 114.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.66ms. Allocated memory is still 161.5MB. Free memory was 114.9MB in the beginning and 111.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 566.06ms. Allocated memory is still 161.5MB. Free memory was 111.4MB in the beginning and 58.9MB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8418.51ms. Allocated memory was 161.5MB in the beginning and 868.2MB in the end (delta: 706.7MB). Free memory was 58.3MB in the beginning and 768.4MB in the end (delta: -710.1MB). Peak memory consumption was 516.3MB. Max. memory is 16.1GB. * Witness Printer took 4.16ms. Allocated memory is still 868.2MB. Free memory is still 768.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t633; [L849] FCALL, FORK 0 pthread_create(&t633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t633=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L764] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L767] 1 __unbuffered_p0_EBX = y VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L850] 0 pthread_t t634; [L851] FCALL, FORK 0 pthread_create(&t634, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t633=-1, t634=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L852] 0 pthread_t t635; [L853] FCALL, FORK 0 pthread_create(&t635, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t633=-1, t634=0, t635=1, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L787] 2 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L804] 3 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L807] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L826] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633=-1, t634=0, t635=1, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633=-1, t634=0, t635=1, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L866] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633=-1, t634=0, t635=1, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] [L17] 0 __assert_fail ("0", "mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 74 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 469 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 442 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 65 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1271 IncrementalHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 37 mSDtfsCounter, 1271 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=359occurred in iteration=8, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 685 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 09:26:37,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:26:39,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:26:39,564 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 09:26:39,568 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:26:39,569 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:26:39,593 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:26:39,595 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:26:39,596 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:26:39,596 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:26:39,597 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:26:39,598 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:26:39,598 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:26:39,598 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:26:39,599 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:26:39,599 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:26:39,599 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:26:39,601 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:26:39,601 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:26:39,602 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:26:39,602 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:26:39,602 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:26:39,602 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:26:39,602 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:26:39,603 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:26:39,603 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:26:39,603 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 09:26:39,603 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:26:39,603 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 09:26:39,603 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:26:39,603 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:26:39,603 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:26:39,604 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:26:39,604 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:26:39,604 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:26:39,604 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:26:39,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:26:39,604 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:26:39,604 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:26:39,605 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 09:26:39,605 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 09:26:39,605 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:26:39,605 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:26:39,606 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:26:39,606 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:26:39,606 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 [2024-11-19 09:26:39,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:26:39,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:26:39,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:26:39,874 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:26:39,875 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:26:39,876 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-11-19 09:26:41,150 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:26:41,351 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:26:41,352 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-11-19 09:26:41,366 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db20abc5e/0f9331d231884f5499deab2d89d21614/FLAGb5fae7424 [2024-11-19 09:26:41,378 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db20abc5e/0f9331d231884f5499deab2d89d21614 [2024-11-19 09:26:41,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:26:41,382 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:26:41,384 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:26:41,384 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:26:41,388 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:26:41,389 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:26:41" (1/1) ... [2024-11-19 09:26:41,390 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74171eaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:41, skipping insertion in model container [2024-11-19 09:26:41,390 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:26:41" (1/1) ... [2024-11-19 09:26:41,435 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:26:41,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:26:41,776 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:26:41,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:26:41,871 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:26:41,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:41 WrapperNode [2024-11-19 09:26:41,872 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:26:41,873 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:26:41,873 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:26:41,873 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:26:41,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:41" (1/1) ... [2024-11-19 09:26:41,896 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:41" (1/1) ... [2024-11-19 09:26:41,913 INFO L138 Inliner]: procedures = 176, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 129 [2024-11-19 09:26:41,914 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:26:41,914 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:26:41,914 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:26:41,914 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:26:41,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:41" (1/1) ... [2024-11-19 09:26:41,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:41" (1/1) ... [2024-11-19 09:26:41,925 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:41" (1/1) ... [2024-11-19 09:26:41,943 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 09:26:41,947 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:41" (1/1) ... [2024-11-19 09:26:41,947 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:41" (1/1) ... [2024-11-19 09:26:41,958 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:41" (1/1) ... [2024-11-19 09:26:41,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:41" (1/1) ... [2024-11-19 09:26:41,961 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:41" (1/1) ... [2024-11-19 09:26:41,962 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:41" (1/1) ... [2024-11-19 09:26:41,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:26:41,967 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:26:41,967 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:26:41,967 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:26:41,968 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:41" (1/1) ... [2024-11-19 09:26:41,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:26:41,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:26:42,000 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:26:42,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:26:42,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 09:26:42,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:26:42,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 09:26:42,034 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-19 09:26:42,034 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-19 09:26:42,034 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-19 09:26:42,034 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-19 09:26:42,034 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-19 09:26:42,034 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-19 09:26:42,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 09:26:42,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:26:42,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:26:42,036 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:26:42,181 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:26:42,182 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:26:42,462 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:26:42,463 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:26:42,630 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:26:42,630 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 09:26:42,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:26:42 BoogieIcfgContainer [2024-11-19 09:26:42,631 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:26:42,633 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:26:42,633 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:26:42,635 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:26:42,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:26:41" (1/3) ... [2024-11-19 09:26:42,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ae4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:26:42, skipping insertion in model container [2024-11-19 09:26:42,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:26:41" (2/3) ... [2024-11-19 09:26:42,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ae4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:26:42, skipping insertion in model container [2024-11-19 09:26:42,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:26:42" (3/3) ... [2024-11-19 09:26:42,638 INFO L112 eAbstractionObserver]: Analyzing ICFG mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-11-19 09:26:42,650 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:26:42,651 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-19 09:26:42,651 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:26:42,706 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 09:26:42,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 106 flow [2024-11-19 09:26:42,759 INFO L124 PetriNetUnfolderBase]: 2/44 cut-off events. [2024-11-19 09:26:42,759 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:26:42,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 2/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2024-11-19 09:26:42,763 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 47 transitions, 106 flow [2024-11-19 09:26:42,767 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 44 transitions, 97 flow [2024-11-19 09:26:42,777 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:26:42,782 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;@49b28a71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:26:42,782 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-19 09:26:42,785 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:26:42,785 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-19 09:26:42,785 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:26:42,785 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:26:42,786 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-19 09:26:42,786 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:26:42,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:26:42,790 INFO L85 PathProgramCache]: Analyzing trace with hash 12431965, now seen corresponding path program 1 times [2024-11-19 09:26:42,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:26:42,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1593620364] [2024-11-19 09:26:42,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:26:42,801 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:26:42,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:26:42,804 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:26:42,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 09:26:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:26:42,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:26:42,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:26:42,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:26:42,943 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:26:42,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:26:42,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1593620364] [2024-11-19 09:26:42,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1593620364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:26:42,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:26:42,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:26:42,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208302080] [2024-11-19 09:26:42,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:26:42,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:26:42,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:26:42,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:26:42,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:26:42,983 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-11-19 09:26:42,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:42,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:26:42,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-11-19 09:26:42,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:26:43,309 INFO L124 PetriNetUnfolderBase]: 825/1738 cut-off events. [2024-11-19 09:26:43,309 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-19 09:26:43,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3019 conditions, 1738 events. 825/1738 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12413 event pairs, 129 based on Foata normal form. 96/1816 useless extension candidates. Maximal degree in co-relation 3008. Up to 1009 conditions per place. [2024-11-19 09:26:43,324 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 33 selfloop transitions, 2 changer transitions 2/56 dead transitions. [2024-11-19 09:26:43,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 56 transitions, 201 flow [2024-11-19 09:26:43,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:26:43,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:26:43,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-11-19 09:26:43,335 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7659574468085106 [2024-11-19 09:26:43,336 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 97 flow. Second operand 3 states and 108 transitions. [2024-11-19 09:26:43,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 56 transitions, 201 flow [2024-11-19 09:26:43,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 56 transitions, 196 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:26:43,341 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 88 flow [2024-11-19 09:26:43,342 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-11-19 09:26:43,345 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2024-11-19 09:26:43,345 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 88 flow [2024-11-19 09:26:43,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:43,345 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:26:43,345 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:26:43,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-19 09:26:43,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:26:43,549 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:26:43,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:26:43,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1403503301, now seen corresponding path program 1 times [2024-11-19 09:26:43,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:26:43,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [681045609] [2024-11-19 09:26:43,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:26:43,550 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:26:43,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:26:43,552 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:26:43,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 09:26:43,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:26:43,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:26:43,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:26:43,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:26:43,675 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:26:43,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:26:43,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [681045609] [2024-11-19 09:26:43,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [681045609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:26:43,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:26:43,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:26:43,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789627591] [2024-11-19 09:26:43,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:26:43,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:26:43,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:26:43,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:26:43,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:26:43,687 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-11-19 09:26:43,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:43,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:26:43,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-11-19 09:26:43,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:26:44,075 INFO L124 PetriNetUnfolderBase]: 1680/2964 cut-off events. [2024-11-19 09:26:44,075 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2024-11-19 09:26:44,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5697 conditions, 2964 events. 1680/2964 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 19439 event pairs, 188 based on Foata normal form. 100/3023 useless extension candidates. Maximal degree in co-relation 5687. Up to 1579 conditions per place. [2024-11-19 09:26:44,088 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 43 selfloop transitions, 5 changer transitions 1/64 dead transitions. [2024-11-19 09:26:44,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 64 transitions, 244 flow [2024-11-19 09:26:44,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:26:44,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:26:44,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2024-11-19 09:26:44,090 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6542553191489362 [2024-11-19 09:26:44,090 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 88 flow. Second operand 4 states and 123 transitions. [2024-11-19 09:26:44,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 64 transitions, 244 flow [2024-11-19 09:26:44,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 64 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:26:44,092 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 118 flow [2024-11-19 09:26:44,092 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2024-11-19 09:26:44,094 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2024-11-19 09:26:44,095 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 118 flow [2024-11-19 09:26:44,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:44,095 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:26:44,096 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:26:44,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 09:26:44,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:26:44,297 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:26:44,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:26:44,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1719678883, now seen corresponding path program 1 times [2024-11-19 09:26:44,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:26:44,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064805311] [2024-11-19 09:26:44,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:26:44,298 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:26:44,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:26:44,300 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:26:44,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 09:26:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:26:44,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:26:44,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:26:44,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:26:44,408 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:26:44,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:26:44,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2064805311] [2024-11-19 09:26:44,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2064805311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:26:44,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:26:44,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:26:44,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487197167] [2024-11-19 09:26:44,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:26:44,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:26:44,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:26:44,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:26:44,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:26:44,421 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-11-19 09:26:44,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:44,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:26:44,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-11-19 09:26:44,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:26:44,673 INFO L124 PetriNetUnfolderBase]: 1038/1842 cut-off events. [2024-11-19 09:26:44,673 INFO L125 PetriNetUnfolderBase]: For 435/435 co-relation queries the response was YES. [2024-11-19 09:26:44,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4075 conditions, 1842 events. 1038/1842 cut-off events. For 435/435 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 10573 event pairs, 100 based on Foata normal form. 82/1890 useless extension candidates. Maximal degree in co-relation 4063. Up to 697 conditions per place. [2024-11-19 09:26:44,681 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 54 selfloop transitions, 8 changer transitions 1/78 dead transitions. [2024-11-19 09:26:44,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 78 transitions, 337 flow [2024-11-19 09:26:44,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:26:44,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:26:44,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions. [2024-11-19 09:26:44,685 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6595744680851063 [2024-11-19 09:26:44,686 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 118 flow. Second operand 5 states and 155 transitions. [2024-11-19 09:26:44,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 78 transitions, 337 flow [2024-11-19 09:26:44,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 78 transitions, 327 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-19 09:26:44,689 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 158 flow [2024-11-19 09:26:44,690 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2024-11-19 09:26:44,690 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2024-11-19 09:26:44,691 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 158 flow [2024-11-19 09:26:44,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:44,691 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:26:44,692 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:26:44,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-19 09:26:44,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:26:44,892 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:26:44,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:26:44,893 INFO L85 PathProgramCache]: Analyzing trace with hash 991846514, now seen corresponding path program 1 times [2024-11-19 09:26:44,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:26:44,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333413128] [2024-11-19 09:26:44,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:26:44,894 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:26:44,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:26:44,897 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:26:44,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 09:26:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:26:44,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:26:44,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:26:45,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:26:45,090 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:26:45,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:26:45,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1333413128] [2024-11-19 09:26:45,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1333413128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:26:45,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:26:45,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:26:45,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875107944] [2024-11-19 09:26:45,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:26:45,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:26:45,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:26:45,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:26:45,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:26:45,096 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 47 [2024-11-19 09:26:45,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:45,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:26:45,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 47 [2024-11-19 09:26:45,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:26:45,344 INFO L124 PetriNetUnfolderBase]: 581/991 cut-off events. [2024-11-19 09:26:45,344 INFO L125 PetriNetUnfolderBase]: For 756/756 co-relation queries the response was YES. [2024-11-19 09:26:45,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2525 conditions, 991 events. 581/991 cut-off events. For 756/756 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4614 event pairs, 83 based on Foata normal form. 40/997 useless extension candidates. Maximal degree in co-relation 2511. Up to 308 conditions per place. [2024-11-19 09:26:45,350 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 47 selfloop transitions, 11 changer transitions 1/74 dead transitions. [2024-11-19 09:26:45,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 74 transitions, 344 flow [2024-11-19 09:26:45,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:26:45,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:26:45,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2024-11-19 09:26:45,352 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.599290780141844 [2024-11-19 09:26:45,352 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 158 flow. Second operand 6 states and 169 transitions. [2024-11-19 09:26:45,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 74 transitions, 344 flow [2024-11-19 09:26:45,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 74 transitions, 319 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-19 09:26:45,358 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 172 flow [2024-11-19 09:26:45,358 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2024-11-19 09:26:45,359 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2024-11-19 09:26:45,359 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 172 flow [2024-11-19 09:26:45,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:45,360 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:26:45,360 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:26:45,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-19 09:26:45,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:26:45,561 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:26:45,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:26:45,561 INFO L85 PathProgramCache]: Analyzing trace with hash 878072410, now seen corresponding path program 1 times [2024-11-19 09:26:45,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:26:45,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1129650657] [2024-11-19 09:26:45,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:26:45,562 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:26:45,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:26:45,563 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:26:45,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 09:26:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:26:45,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:26:45,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:26:45,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:26:45,687 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:26:45,687 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:26:45,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1129650657] [2024-11-19 09:26:45,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1129650657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:26:45,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:26:45,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:26:45,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654277499] [2024-11-19 09:26:45,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:26:45,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:26:45,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:26:45,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:26:45,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:26:45,690 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-11-19 09:26:45,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:45,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:26:45,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-11-19 09:26:45,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:26:45,779 INFO L124 PetriNetUnfolderBase]: 308/634 cut-off events. [2024-11-19 09:26:45,780 INFO L125 PetriNetUnfolderBase]: For 249/259 co-relation queries the response was YES. [2024-11-19 09:26:45,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1411 conditions, 634 events. 308/634 cut-off events. For 249/259 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3201 event pairs, 288 based on Foata normal form. 8/594 useless extension candidates. Maximal degree in co-relation 1396. Up to 481 conditions per place. [2024-11-19 09:26:45,784 INFO L140 encePairwiseOnDemand]: 45/47 looper letters, 18 selfloop transitions, 1 changer transitions 1/44 dead transitions. [2024-11-19 09:26:45,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 44 transitions, 210 flow [2024-11-19 09:26:45,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:26:45,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:26:45,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-11-19 09:26:45,785 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2024-11-19 09:26:45,785 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 172 flow. Second operand 3 states and 84 transitions. [2024-11-19 09:26:45,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 44 transitions, 210 flow [2024-11-19 09:26:45,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 44 transitions, 154 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-11-19 09:26:45,789 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 114 flow [2024-11-19 09:26:45,789 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2024-11-19 09:26:45,789 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2024-11-19 09:26:45,791 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 114 flow [2024-11-19 09:26:45,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:45,791 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:26:45,791 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:26:45,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 09:26:45,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:26:45,992 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:26:45,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:26:45,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1174556948, now seen corresponding path program 1 times [2024-11-19 09:26:45,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:26:45,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921887162] [2024-11-19 09:26:45,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:26:45,993 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:26:45,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:26:45,996 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:26:45,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 09:26:46,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:26:46,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 09:26:46,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:26:46,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:26:46,395 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:26:46,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:26:46,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921887162] [2024-11-19 09:26:46,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1921887162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:26:46,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:26:46,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 09:26:46,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617923541] [2024-11-19 09:26:46,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:26:46,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 09:26:46,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:26:46,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 09:26:46,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-19 09:26:46,408 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 47 [2024-11-19 09:26:46,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 114 flow. Second operand has 9 states, 9 states have (on average 22.88888888888889) internal successors, (206), 9 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:46,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:26:46,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 47 [2024-11-19 09:26:46,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:26:46,710 INFO L124 PetriNetUnfolderBase]: 438/945 cut-off events. [2024-11-19 09:26:46,710 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:26:46,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1776 conditions, 945 events. 438/945 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5181 event pairs, 68 based on Foata normal form. 8/915 useless extension candidates. Maximal degree in co-relation 1769. Up to 225 conditions per place. [2024-11-19 09:26:46,714 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 32 selfloop transitions, 4 changer transitions 24/83 dead transitions. [2024-11-19 09:26:46,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 83 transitions, 322 flow [2024-11-19 09:26:46,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:26:46,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:26:46,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 250 transitions. [2024-11-19 09:26:46,719 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5910165484633569 [2024-11-19 09:26:46,719 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 114 flow. Second operand 9 states and 250 transitions. [2024-11-19 09:26:46,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 83 transitions, 322 flow [2024-11-19 09:26:46,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 83 transitions, 321 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:26:46,721 INFO L231 Difference]: Finished difference. Result has 61 places, 43 transitions, 131 flow [2024-11-19 09:26:46,721 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=131, PETRI_PLACES=61, PETRI_TRANSITIONS=43} [2024-11-19 09:26:46,721 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2024-11-19 09:26:46,721 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 131 flow [2024-11-19 09:26:46,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.88888888888889) internal successors, (206), 9 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:46,722 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:26:46,722 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:26:46,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 09:26:46,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:26:46,923 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:26:46,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:26:46,923 INFO L85 PathProgramCache]: Analyzing trace with hash 150663980, now seen corresponding path program 2 times [2024-11-19 09:26:46,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:26:46,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [731326982] [2024-11-19 09:26:46,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:26:46,924 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:26:46,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:26:46,925 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:26:46,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 09:26:46,996 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:26:46,997 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:26:46,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:26:47,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:26:47,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:26:47,047 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:26:47,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:26:47,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [731326982] [2024-11-19 09:26:47,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [731326982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:26:47,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:26:47,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:26:47,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518762902] [2024-11-19 09:26:47,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:26:47,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:26:47,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:26:47,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:26:47,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:26:47,060 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-11-19 09:26:47,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 43 transitions, 131 flow. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 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-11-19 09:26:47,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:26:47,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-11-19 09:26:47,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:26:47,272 INFO L124 PetriNetUnfolderBase]: 699/1341 cut-off events. [2024-11-19 09:26:47,272 INFO L125 PetriNetUnfolderBase]: For 245/248 co-relation queries the response was YES. [2024-11-19 09:26:47,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2883 conditions, 1341 events. 699/1341 cut-off events. For 245/248 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 7331 event pairs, 152 based on Foata normal form. 8/1290 useless extension candidates. Maximal degree in co-relation 2871. Up to 569 conditions per place. [2024-11-19 09:26:47,279 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 29 selfloop transitions, 1 changer transitions 22/73 dead transitions. [2024-11-19 09:26:47,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 73 transitions, 318 flow [2024-11-19 09:26:47,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:26:47,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:26:47,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 167 transitions. [2024-11-19 09:26:47,280 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5921985815602837 [2024-11-19 09:26:47,280 INFO L175 Difference]: Start difference. First operand has 61 places, 43 transitions, 131 flow. Second operand 6 states and 167 transitions. [2024-11-19 09:26:47,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 73 transitions, 318 flow [2024-11-19 09:26:47,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 73 transitions, 292 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-11-19 09:26:47,283 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 128 flow [2024-11-19 09:26:47,283 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=128, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2024-11-19 09:26:47,284 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2024-11-19 09:26:47,284 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 128 flow [2024-11-19 09:26:47,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 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-11-19 09:26:47,284 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:26:47,285 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:26:47,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-19 09:26:47,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:26:47,486 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:26:47,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:26:47,486 INFO L85 PathProgramCache]: Analyzing trace with hash 764527220, now seen corresponding path program 3 times [2024-11-19 09:26:47,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:26:47,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [71988221] [2024-11-19 09:26:47,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:26:47,488 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:26:47,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:26:47,489 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:26:47,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 09:26:47,552 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 09:26:47,552 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:26:47,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:26:47,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:26:47,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:26:47,586 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:26:47,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:26:47,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [71988221] [2024-11-19 09:26:47,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [71988221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:26:47,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:26:47,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:26:47,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604126469] [2024-11-19 09:26:47,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:26:47,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:26:47,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:26:47,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:26:47,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:26:47,596 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-11-19 09:26:47,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:47,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:26:47,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-11-19 09:26:47,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:26:47,793 INFO L124 PetriNetUnfolderBase]: 779/1482 cut-off events. [2024-11-19 09:26:47,793 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2024-11-19 09:26:47,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3039 conditions, 1482 events. 779/1482 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 8298 event pairs, 280 based on Foata normal form. 8/1421 useless extension candidates. Maximal degree in co-relation 3027. Up to 582 conditions per place. [2024-11-19 09:26:47,799 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 25 selfloop transitions, 2 changer transitions 17/65 dead transitions. [2024-11-19 09:26:47,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 65 transitions, 270 flow [2024-11-19 09:26:47,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:26:47,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:26:47,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions. [2024-11-19 09:26:47,801 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2024-11-19 09:26:47,801 INFO L175 Difference]: Start difference. First operand has 59 places, 43 transitions, 128 flow. Second operand 5 states and 140 transitions. [2024-11-19 09:26:47,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 65 transitions, 270 flow [2024-11-19 09:26:47,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 65 transitions, 259 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-19 09:26:47,803 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 133 flow [2024-11-19 09:26:47,803 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=133, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2024-11-19 09:26:47,805 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2024-11-19 09:26:47,805 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 133 flow [2024-11-19 09:26:47,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:26:47,806 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:26:47,806 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:26:47,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-19 09:26:48,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:26:48,012 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-19 09:26:48,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:26:48,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1888489414, now seen corresponding path program 4 times [2024-11-19 09:26:48,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:26:48,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436485959] [2024-11-19 09:26:48,013 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:26:48,013 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:26:48,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:26:48,015 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:26:48,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 09:26:48,098 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:26:48,099 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 09:26:48,099 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:26:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:26:48,181 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-19 09:26:48,182 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:26:48,183 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-19 09:26:48,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-19 09:26:48,185 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-19 09:26:48,185 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-19 09:26:48,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-19 09:26:48,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-19 09:26:48,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-19 09:26:48,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-19 09:26:48,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:26:48,387 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-11-19 09:26:48,458 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:26:48,458 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:26:48,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:26:48 BasicIcfg [2024-11-19 09:26:48,465 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:26:48,465 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:26:48,465 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:26:48,465 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:26:48,466 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:26:42" (3/4) ... [2024-11-19 09:26:48,467 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 09:26:48,468 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:26:48,468 INFO L158 Benchmark]: Toolchain (without parser) took 7086.62ms. Allocated memory was 58.7MB in the beginning and 346.0MB in the end (delta: 287.3MB). Free memory was 31.0MB in the beginning and 229.8MB in the end (delta: -198.8MB). Peak memory consumption was 88.9MB. Max. memory is 16.1GB. [2024-11-19 09:26:48,468 INFO L158 Benchmark]: CDTParser took 0.71ms. Allocated memory is still 44.0MB. Free memory is still 20.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:26:48,469 INFO L158 Benchmark]: CACSL2BoogieTranslator took 488.12ms. Allocated memory was 58.7MB in the beginning and 73.4MB in the end (delta: 14.7MB). Free memory was 30.7MB in the beginning and 50.1MB in the end (delta: -19.4MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2024-11-19 09:26:48,469 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.74ms. Allocated memory is still 73.4MB. Free memory was 50.1MB in the beginning and 47.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:26:48,469 INFO L158 Benchmark]: Boogie Preprocessor took 52.33ms. Allocated memory is still 73.4MB. Free memory was 47.7MB in the beginning and 44.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 09:26:48,469 INFO L158 Benchmark]: RCFGBuilder took 664.45ms. Allocated memory is still 73.4MB. Free memory was 44.1MB in the beginning and 31.7MB in the end (delta: 12.4MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2024-11-19 09:26:48,469 INFO L158 Benchmark]: TraceAbstraction took 5831.94ms. Allocated memory was 73.4MB in the beginning and 346.0MB in the end (delta: 272.6MB). Free memory was 30.9MB in the beginning and 229.8MB in the end (delta: -198.9MB). Peak memory consumption was 74.7MB. Max. memory is 16.1GB. [2024-11-19 09:26:48,469 INFO L158 Benchmark]: Witness Printer took 2.71ms. Allocated memory is still 346.0MB. Free memory is still 229.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:26:48,470 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.71ms. Allocated memory is still 44.0MB. Free memory is still 20.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 488.12ms. Allocated memory was 58.7MB in the beginning and 73.4MB in the end (delta: 14.7MB). Free memory was 30.7MB in the beginning and 50.1MB in the end (delta: -19.4MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.74ms. Allocated memory is still 73.4MB. Free memory was 50.1MB in the beginning and 47.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.33ms. Allocated memory is still 73.4MB. Free memory was 47.7MB in the beginning and 44.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 664.45ms. Allocated memory is still 73.4MB. Free memory was 44.1MB in the beginning and 31.7MB in the end (delta: 12.4MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5831.94ms. Allocated memory was 73.4MB in the beginning and 346.0MB in the end (delta: 272.6MB). Free memory was 30.9MB in the beginning and 229.8MB in the end (delta: -198.9MB). Peak memory consumption was 74.7MB. Max. memory is 16.1GB. * Witness Printer took 2.71ms. Allocated memory is still 346.0MB. Free memory is still 229.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t633; [L849] FCALL, FORK 0 pthread_create(&t633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t633=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L850] 0 pthread_t t634; [L851] FCALL, FORK 0 pthread_create(&t634, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t633=0, t634=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t635; [L853] FCALL, FORK 0 pthread_create(&t635, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t633=0, t634=1, t635=2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L764] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L767] 1 __unbuffered_p0_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L787] 2 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L804] 3 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L807] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L826] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633=0, t634=1, t635=2, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633=0, t634=1, t635=2, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L866] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633=0, t634=1, t635=2, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L17] 0 __assert_fail ("0", "mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 74 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 327 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 307 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1060 IncrementalHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 2 mSDtfsCounter, 1060 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 204 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred in iteration=4, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 189 ConstructedInterpolants, 0 QuantifiedInterpolants, 733 SizeOfPredicates, 13 NumberOfNonLiveVariables, 890 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 09:26:48,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample