./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.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 6a39929e45dd639f23e29d64b9f64559e1eb8cd260c4b1939e3197ae6524cdca --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:28:04,288 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:28:04,348 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:28:04,355 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:28:04,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:28:04,397 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:28:04,398 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:28:04,398 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:28:04,399 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:28:04,399 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:28:04,400 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:28:04,400 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:28:04,401 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:28:04,401 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:28:04,401 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:28:04,403 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:28:04,404 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:28:04,404 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:28:04,404 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:28:04,405 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:28:04,405 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:28:04,406 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:28:04,406 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:28:04,406 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:28:04,407 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:28:04,407 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:28:04,407 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:28:04,408 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:28:04,408 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:28:04,409 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:28:04,409 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:28:04,409 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:28:04,409 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:28:04,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:28:04,410 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:28:04,410 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:28:04,411 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:28:04,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:28:04,411 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:28:04,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:28:04,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:28:04,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:28:04,413 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 -> 6a39929e45dd639f23e29d64b9f64559e1eb8cd260c4b1939e3197ae6524cdca [2024-11-09 10:28:04,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:28:04,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:28:04,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:28:04,719 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:28:04,719 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:28:04,721 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-09 10:28:06,201 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:28:06,449 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:28:06,450 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-09 10:28:06,470 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9f0ee6d6/08e39001a6a94ae8a1211643dde88ad5/FLAGbbc3c471c [2024-11-09 10:28:06,486 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9f0ee6d6/08e39001a6a94ae8a1211643dde88ad5 [2024-11-09 10:28:06,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:28:06,490 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:28:06,492 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:28:06,492 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:28:06,498 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:28:06,499 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:28:06" (1/1) ... [2024-11-09 10:28:06,500 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27722278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:06, skipping insertion in model container [2024-11-09 10:28:06,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:28:06" (1/1) ... [2024-11-09 10:28:06,550 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:28:06,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:28:07,008 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:28:07,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:28:07,118 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:28:07,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:07 WrapperNode [2024-11-09 10:28:07,119 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:28:07,121 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:28:07,121 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:28:07,121 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:28:07,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:07" (1/1) ... [2024-11-09 10:28:07,152 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:07" (1/1) ... [2024-11-09 10:28:07,180 INFO L138 Inliner]: procedures = 174, calls = 36, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 108 [2024-11-09 10:28:07,181 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:28:07,182 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:28:07,182 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:28:07,182 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:28:07,196 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:07" (1/1) ... [2024-11-09 10:28:07,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:07" (1/1) ... [2024-11-09 10:28:07,200 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:07" (1/1) ... [2024-11-09 10:28:07,233 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-09 10:28:07,233 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:07" (1/1) ... [2024-11-09 10:28:07,234 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:07" (1/1) ... [2024-11-09 10:28:07,247 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:07" (1/1) ... [2024-11-09 10:28:07,249 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:07" (1/1) ... [2024-11-09 10:28:07,254 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:07" (1/1) ... [2024-11-09 10:28:07,255 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:07" (1/1) ... [2024-11-09 10:28:07,262 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:28:07,263 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:28:07,263 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:28:07,264 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:28:07,264 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:07" (1/1) ... [2024-11-09 10:28:07,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:28:07,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:28:07,302 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-09 10:28:07,309 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-09 10:28:07,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 10:28:07,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:28:07,358 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-09 10:28:07,359 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-09 10:28:07,359 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-09 10:28:07,359 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-09 10:28:07,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:28:07,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 10:28:07,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:28:07,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:28:07,361 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:28:07,494 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:28:07,497 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:28:07,794 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:28:07,794 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:28:08,013 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:28:08,013 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 10:28:08,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:28:08 BoogieIcfgContainer [2024-11-09 10:28:08,014 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:28:08,016 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:28:08,017 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:28:08,020 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:28:08,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:28:06" (1/3) ... [2024-11-09 10:28:08,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1528e435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:28:08, skipping insertion in model container [2024-11-09 10:28:08,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:07" (2/3) ... [2024-11-09 10:28:08,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1528e435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:28:08, skipping insertion in model container [2024-11-09 10:28:08,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:28:08" (3/3) ... [2024-11-09 10:28:08,024 INFO L112 eAbstractionObserver]: Analyzing ICFG mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-09 10:28:08,042 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:28:08,042 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-09 10:28:08,043 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:28:08,096 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:28:08,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 36 transitions, 80 flow [2024-11-09 10:28:08,161 INFO L124 PetriNetUnfolderBase]: 2/34 cut-off events. [2024-11-09 10:28:08,162 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:28:08,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 34 events. 2/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2024-11-09 10:28:08,167 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 36 transitions, 80 flow [2024-11-09 10:28:08,171 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 34 transitions, 74 flow [2024-11-09 10:28:08,183 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:28:08,188 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;@5c232b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:28:08,189 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-09 10:28:08,193 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:28:08,193 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-09 10:28:08,195 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:28:08,195 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:28:08,196 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-09 10:28:08,196 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-09 10:28:08,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:28:08,201 INFO L85 PathProgramCache]: Analyzing trace with hash 10640791, now seen corresponding path program 1 times [2024-11-09 10:28:08,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:28:08,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693481599] [2024-11-09 10:28:08,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:28:08,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:28:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:28:08,655 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-09 10:28:08,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:28:08,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693481599] [2024-11-09 10:28:08,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693481599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:28:08,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:28:08,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:28:08,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398576561] [2024-11-09 10:28:08,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:28:08,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:28:08,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:28:08,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:28:08,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:28:08,706 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 36 [2024-11-09 10:28:08,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-09 10:28:08,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:28:08,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 36 [2024-11-09 10:28:08,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:28:08,928 INFO L124 PetriNetUnfolderBase]: 183/391 cut-off events. [2024-11-09 10:28:08,929 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 10:28:08,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 391 events. 183/391 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1950 event pairs, 69 based on Foata normal form. 32/418 useless extension candidates. Maximal degree in co-relation 715. Up to 265 conditions per place. [2024-11-09 10:28:08,935 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 25 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2024-11-09 10:28:08,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 151 flow [2024-11-09 10:28:08,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:28:08,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:28:08,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-11-09 10:28:08,948 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7314814814814815 [2024-11-09 10:28:08,950 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 74 flow. Second operand 3 states and 79 transitions. [2024-11-09 10:28:08,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 151 flow [2024-11-09 10:28:08,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:28:08,955 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 66 flow [2024-11-09 10:28:08,957 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2024-11-09 10:28:08,962 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2024-11-09 10:28:08,962 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 66 flow [2024-11-09 10:28:08,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-09 10:28:08,963 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:28:08,963 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:28:08,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:28:08,963 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-09 10:28:08,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:28:08,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1957487972, now seen corresponding path program 1 times [2024-11-09 10:28:08,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:28:08,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541447934] [2024-11-09 10:28:08,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:28:08,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:28:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:28:09,045 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-09 10:28:09,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:28:09,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541447934] [2024-11-09 10:28:09,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541447934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:28:09,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:28:09,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:28:09,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567089211] [2024-11-09 10:28:09,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:28:09,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:28:09,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:28:09,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:28:09,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:28:09,062 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 36 [2024-11-09 10:28:09,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-09 10:28:09,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:28:09,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 36 [2024-11-09 10:28:09,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:28:09,169 INFO L124 PetriNetUnfolderBase]: 159/375 cut-off events. [2024-11-09 10:28:09,169 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-09 10:28:09,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 375 events. 159/375 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2024 event pairs, 159 based on Foata normal form. 16/376 useless extension candidates. Maximal degree in co-relation 689. Up to 280 conditions per place. [2024-11-09 10:28:09,174 INFO L140 encePairwiseOnDemand]: 34/36 looper letters, 14 selfloop transitions, 1 changer transitions 1/28 dead transitions. [2024-11-09 10:28:09,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 28 transitions, 96 flow [2024-11-09 10:28:09,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:28:09,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:28:09,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2024-11-09 10:28:09,178 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5462962962962963 [2024-11-09 10:28:09,178 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 66 flow. Second operand 3 states and 59 transitions. [2024-11-09 10:28:09,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 28 transitions, 96 flow [2024-11-09 10:28:09,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 28 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:28:09,180 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 60 flow [2024-11-09 10:28:09,180 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2024-11-09 10:28:09,181 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, -4 predicate places. [2024-11-09 10:28:09,181 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 60 flow [2024-11-09 10:28:09,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-09 10:28:09,182 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:28:09,182 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:28:09,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:28:09,183 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-09 10:28:09,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:28:09,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1957486724, now seen corresponding path program 1 times [2024-11-09 10:28:09,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:28:09,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769764406] [2024-11-09 10:28:09,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:28:09,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:28:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:28:09,424 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-09 10:28:09,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:28:09,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769764406] [2024-11-09 10:28:09,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769764406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:28:09,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:28:09,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:28:09,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943271159] [2024-11-09 10:28:09,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:28:09,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:28:09,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:28:09,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:28:09,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:28:09,446 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-11-09 10:28:09,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 60 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-09 10:28:09,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:28:09,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-11-09 10:28:09,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:28:09,758 INFO L124 PetriNetUnfolderBase]: 385/790 cut-off events. [2024-11-09 10:28:09,759 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:28:09,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1469 conditions, 790 events. 385/790 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4448 event pairs, 148 based on Foata normal form. 0/764 useless extension candidates. Maximal degree in co-relation 1463. Up to 415 conditions per place. [2024-11-09 10:28:09,763 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 23 selfloop transitions, 3 changer transitions 36/70 dead transitions. [2024-11-09 10:28:09,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 70 transitions, 272 flow [2024-11-09 10:28:09,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:28:09,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 10:28:09,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-11-09 10:28:09,766 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-11-09 10:28:09,766 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 60 flow. Second operand 8 states and 152 transitions. [2024-11-09 10:28:09,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 70 transitions, 272 flow [2024-11-09 10:28:09,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 70 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:28:09,768 INFO L231 Difference]: Finished difference. Result has 45 places, 28 transitions, 92 flow [2024-11-09 10:28:09,769 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=92, PETRI_PLACES=45, PETRI_TRANSITIONS=28} [2024-11-09 10:28:09,769 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 6 predicate places. [2024-11-09 10:28:09,770 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 92 flow [2024-11-09 10:28:09,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-09 10:28:09,770 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:28:09,770 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:28:09,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:28:09,771 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-09 10:28:09,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:28:09,771 INFO L85 PathProgramCache]: Analyzing trace with hash 634922395, now seen corresponding path program 1 times [2024-11-09 10:28:09,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:28:09,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291732909] [2024-11-09 10:28:09,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:28:09,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:28:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:28:09,974 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-09 10:28:09,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:28:09,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291732909] [2024-11-09 10:28:09,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291732909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:28:09,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:28:09,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:28:09,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647285029] [2024-11-09 10:28:09,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:28:09,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:28:09,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:28:09,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:28:09,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:28:09,985 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-11-09 10:28:09,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 28 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:28:09,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:28:09,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-11-09 10:28:09,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:28:10,228 INFO L124 PetriNetUnfolderBase]: 281/583 cut-off events. [2024-11-09 10:28:10,228 INFO L125 PetriNetUnfolderBase]: For 246/246 co-relation queries the response was YES. [2024-11-09 10:28:10,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1334 conditions, 583 events. 281/583 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3092 event pairs, 66 based on Foata normal form. 28/597 useless extension candidates. Maximal degree in co-relation 1322. Up to 330 conditions per place. [2024-11-09 10:28:10,233 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 21 selfloop transitions, 2 changer transitions 23/57 dead transitions. [2024-11-09 10:28:10,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 57 transitions, 252 flow [2024-11-09 10:28:10,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:28:10,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 10:28:10,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-11-09 10:28:10,237 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-11-09 10:28:10,237 INFO L175 Difference]: Start difference. First operand has 45 places, 28 transitions, 92 flow. Second operand 7 states and 132 transitions. [2024-11-09 10:28:10,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 57 transitions, 252 flow [2024-11-09 10:28:10,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 239 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-11-09 10:28:10,245 INFO L231 Difference]: Finished difference. Result has 47 places, 28 transitions, 99 flow [2024-11-09 10:28:10,246 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=99, PETRI_PLACES=47, PETRI_TRANSITIONS=28} [2024-11-09 10:28:10,247 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 8 predicate places. [2024-11-09 10:28:10,247 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 28 transitions, 99 flow [2024-11-09 10:28:10,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:28:10,248 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:28:10,248 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:28:10,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:28:10,249 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-09 10:28:10,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:28:10,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1449193497, now seen corresponding path program 1 times [2024-11-09 10:28:10,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:28:10,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523546981] [2024-11-09 10:28:10,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:28:10,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:28:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:28:10,415 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-09 10:28:10,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:28:10,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523546981] [2024-11-09 10:28:10,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523546981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:28:10,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:28:10,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:28:10,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965154356] [2024-11-09 10:28:10,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:28:10,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:28:10,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:28:10,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:28:10,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:28:10,427 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-11-09 10:28:10,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 28 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-09 10:28:10,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:28:10,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-11-09 10:28:10,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:28:10,575 INFO L124 PetriNetUnfolderBase]: 216/471 cut-off events. [2024-11-09 10:28:10,575 INFO L125 PetriNetUnfolderBase]: For 203/205 co-relation queries the response was YES. [2024-11-09 10:28:10,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 471 events. 216/471 cut-off events. For 203/205 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2208 event pairs, 42 based on Foata normal form. 29/486 useless extension candidates. Maximal degree in co-relation 1058. Up to 206 conditions per place. [2024-11-09 10:28:10,578 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 32 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2024-11-09 10:28:10,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 46 transitions, 209 flow [2024-11-09 10:28:10,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:28:10,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:28:10,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2024-11-09 10:28:10,580 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5972222222222222 [2024-11-09 10:28:10,580 INFO L175 Difference]: Start difference. First operand has 47 places, 28 transitions, 99 flow. Second operand 4 states and 86 transitions. [2024-11-09 10:28:10,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 46 transitions, 209 flow [2024-11-09 10:28:10,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 46 transitions, 195 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-11-09 10:28:10,583 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 115 flow [2024-11-09 10:28:10,583 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2024-11-09 10:28:10,584 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2024-11-09 10:28:10,584 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 115 flow [2024-11-09 10:28:10,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-09 10:28:10,585 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:28:10,585 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:28:10,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:28:10,585 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-09 10:28:10,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:28:10,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1335401403, now seen corresponding path program 1 times [2024-11-09 10:28:10,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:28:10,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481663588] [2024-11-09 10:28:10,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:28:10,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:28:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:28:10,819 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-09 10:28:10,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:28:10,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481663588] [2024-11-09 10:28:10,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481663588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:28:10,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:28:10,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:28:10,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353814162] [2024-11-09 10:28:10,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:28:10,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:28:10,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:28:10,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:28:10,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:28:10,833 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-11-09 10:28:10,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:28:10,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:28:10,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-11-09 10:28:10,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:28:10,967 INFO L124 PetriNetUnfolderBase]: 134/295 cut-off events. [2024-11-09 10:28:10,968 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2024-11-09 10:28:10,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 295 events. 134/295 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1157 event pairs, 43 based on Foata normal form. 18/298 useless extension candidates. Maximal degree in co-relation 719. Up to 117 conditions per place. [2024-11-09 10:28:10,970 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 28 selfloop transitions, 6 changer transitions 0/44 dead transitions. [2024-11-09 10:28:10,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 214 flow [2024-11-09 10:28:10,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:28:10,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:28:10,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2024-11-09 10:28:10,972 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-11-09 10:28:10,972 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 115 flow. Second operand 5 states and 96 transitions. [2024-11-09 10:28:10,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 214 flow [2024-11-09 10:28:10,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 197 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-11-09 10:28:10,974 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 128 flow [2024-11-09 10:28:10,974 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2024-11-09 10:28:10,975 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 5 predicate places. [2024-11-09 10:28:10,975 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 128 flow [2024-11-09 10:28:10,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:28:10,976 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:28:10,976 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:28:10,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:28:10,976 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-09 10:28:10,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:28:10,977 INFO L85 PathProgramCache]: Analyzing trace with hash 631256748, now seen corresponding path program 1 times [2024-11-09 10:28:10,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:28:10,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757116873] [2024-11-09 10:28:10,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:28:10,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:28:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:28:11,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-09 10:28:11,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:28:11,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757116873] [2024-11-09 10:28:11,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757116873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:28:11,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:28:11,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 10:28:11,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143329554] [2024-11-09 10:28:11,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:28:11,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 10:28:11,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:28:11,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 10:28:11,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:28:11,947 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2024-11-09 10:28:11,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 128 flow. Second operand has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:28:11,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:28:11,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2024-11-09 10:28:11,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:28:12,240 INFO L124 PetriNetUnfolderBase]: 111/295 cut-off events. [2024-11-09 10:28:12,241 INFO L125 PetriNetUnfolderBase]: For 238/256 co-relation queries the response was YES. [2024-11-09 10:28:12,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 295 events. 111/295 cut-off events. For 238/256 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1339 event pairs, 19 based on Foata normal form. 6/277 useless extension candidates. Maximal degree in co-relation 724. Up to 63 conditions per place. [2024-11-09 10:28:12,242 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 22 selfloop transitions, 4 changer transitions 17/59 dead transitions. [2024-11-09 10:28:12,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 280 flow [2024-11-09 10:28:12,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 10:28:12,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 10:28:12,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-11-09 10:28:12,244 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49691358024691357 [2024-11-09 10:28:12,244 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 128 flow. Second operand 9 states and 161 transitions. [2024-11-09 10:28:12,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 280 flow [2024-11-09 10:28:12,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 59 transitions, 271 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-09 10:28:12,247 INFO L231 Difference]: Finished difference. Result has 54 places, 32 transitions, 137 flow [2024-11-09 10:28:12,247 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=137, PETRI_PLACES=54, PETRI_TRANSITIONS=32} [2024-11-09 10:28:12,250 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 15 predicate places. [2024-11-09 10:28:12,250 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 32 transitions, 137 flow [2024-11-09 10:28:12,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:28:12,250 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:28:12,250 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:28:12,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:28:12,251 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-09 10:28:12,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:28:12,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1452268588, now seen corresponding path program 2 times [2024-11-09 10:28:12,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:28:12,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313680877] [2024-11-09 10:28:12,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:28:12,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:28:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:28:12,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:28:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:28:12,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:28:12,480 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:28:12,481 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-11-09 10:28:12,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-09 10:28:12,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-11-09 10:28:12,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-09 10:28:12,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-09 10:28:12,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-11-09 10:28:12,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:28:12,485 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-11-09 10:28:12,552 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:28:12,552 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:28:12,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:28:12 BasicIcfg [2024-11-09 10:28:12,561 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:28:12,564 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:28:12,564 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:28:12,564 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:28:12,565 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:28:08" (3/4) ... [2024-11-09 10:28:12,567 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:28:12,568 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:28:12,569 INFO L158 Benchmark]: Toolchain (without parser) took 6078.69ms. Allocated memory was 184.5MB in the beginning and 274.7MB in the end (delta: 90.2MB). Free memory was 132.0MB in the beginning and 156.5MB in the end (delta: -24.5MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. [2024-11-09 10:28:12,569 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 184.5MB. Free memory is still 152.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:28:12,569 INFO L158 Benchmark]: CACSL2BoogieTranslator took 627.54ms. Allocated memory is still 184.5MB. Free memory was 131.7MB in the beginning and 106.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 10:28:12,570 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.62ms. Allocated memory is still 184.5MB. Free memory was 106.4MB in the beginning and 103.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 10:28:12,570 INFO L158 Benchmark]: Boogie Preprocessor took 80.70ms. Allocated memory is still 184.5MB. Free memory was 103.7MB in the beginning and 100.6MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:28:12,571 INFO L158 Benchmark]: RCFGBuilder took 750.68ms. Allocated memory was 184.5MB in the beginning and 228.6MB in the end (delta: 44.0MB). Free memory was 100.6MB in the beginning and 181.0MB in the end (delta: -80.4MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. [2024-11-09 10:28:12,572 INFO L158 Benchmark]: TraceAbstraction took 4545.06ms. Allocated memory was 228.6MB in the beginning and 274.7MB in the end (delta: 46.1MB). Free memory was 181.0MB in the beginning and 156.5MB in the end (delta: 24.5MB). Peak memory consumption was 71.7MB. Max. memory is 16.1GB. [2024-11-09 10:28:12,572 INFO L158 Benchmark]: Witness Printer took 4.36ms. Allocated memory is still 274.7MB. Free memory is still 156.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:28:12,574 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.20ms. Allocated memory is still 184.5MB. Free memory is still 152.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 627.54ms. Allocated memory is still 184.5MB. Free memory was 131.7MB in the beginning and 106.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.62ms. Allocated memory is still 184.5MB. Free memory was 106.4MB in the beginning and 103.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.70ms. Allocated memory is still 184.5MB. Free memory was 103.7MB in the beginning and 100.6MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 750.68ms. Allocated memory was 184.5MB in the beginning and 228.6MB in the end (delta: 44.0MB). Free memory was 100.6MB in the beginning and 181.0MB in the end (delta: -80.4MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4545.06ms. Allocated memory was 228.6MB in the beginning and 274.7MB in the end (delta: 46.1MB). Free memory was 181.0MB in the beginning and 156.5MB in the end (delta: 24.5MB). Peak memory consumption was 71.7MB. Max. memory is 16.1GB. * Witness Printer took 4.36ms. Allocated memory is still 274.7MB. Free memory is still 156.5MB. 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t585; [L811] FCALL, FORK 0 pthread_create(&t585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t585=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L812] 0 pthread_t t586; [L813] FCALL, FORK 0 pthread_create(&t586, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t585=-2, t586=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L738] 1 y$w_buff1 = y$w_buff0 [L739] 1 y$w_buff0 = 1 [L740] 1 y$w_buff1_used = y$w_buff0_used [L741] 1 y$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L746] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L749] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L766] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L769] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EBX = y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L788] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L790] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L791] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L792] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L752] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L756] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t585=-2, t586=-1, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L817] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L817] RET 0 assume_abort_if_not(main$tmp_guard0) [L819] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L820] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L821] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L822] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L823] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t585=-2, t586=-1, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L826] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t585=-2, t586=-1, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L828] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L17] 0 __assert_fail ("0", "mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 808]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that 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: 813]: 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 5 procedures, 53 locations, 6 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: 4.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 195 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 174 mSDsluCounter, 57 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 565 IncrementalHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 21 mSDtfsCounter, 565 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=7, InterpolantAutomatonStates: 39, 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.9s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 373 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-09 10:28:12,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /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/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.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 6a39929e45dd639f23e29d64b9f64559e1eb8cd260c4b1939e3197ae6524cdca --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:28:14,847 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:28:14,919 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:28:14,927 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:28:14,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:28:14,966 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:28:14,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:28:14,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:28:14,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:28:14,969 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:28:14,969 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:28:14,970 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:28:14,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:28:14,971 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:28:14,973 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:28:14,973 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:28:14,974 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:28:14,974 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:28:14,974 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:28:14,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:28:14,975 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:28:14,979 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:28:14,979 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:28:14,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:28:14,980 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:28:14,980 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:28:14,980 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:28:14,981 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:28:14,981 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:28:14,981 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:28:14,981 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:28:14,982 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:28:14,982 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:28:14,982 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:28:14,983 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:28:14,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:28:14,983 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:28:14,983 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:28:14,984 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:28:14,984 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:28:14,984 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:28:14,985 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:28:14,985 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:28:14,985 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:28:14,985 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 -> 6a39929e45dd639f23e29d64b9f64559e1eb8cd260c4b1939e3197ae6524cdca [2024-11-09 10:28:15,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:28:15,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:28:15,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:28:15,331 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:28:15,332 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:28:15,333 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-09 10:28:16,853 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:28:17,156 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:28:17,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-09 10:28:17,182 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2258a9b4/270aa23c0294420ebaf3167018a3bfc9/FLAG75bee1e6f [2024-11-09 10:28:17,209 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2258a9b4/270aa23c0294420ebaf3167018a3bfc9 [2024-11-09 10:28:17,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:28:17,213 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:28:17,215 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:28:17,215 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:28:17,219 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:28:17,220 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:28:17" (1/1) ... [2024-11-09 10:28:17,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f67107e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:17, skipping insertion in model container [2024-11-09 10:28:17,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:28:17" (1/1) ... [2024-11-09 10:28:17,267 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:28:17,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:28:17,684 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:28:17,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:28:17,797 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:28:17,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:17 WrapperNode [2024-11-09 10:28:17,797 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:28:17,798 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:28:17,798 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:28:17,799 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:28:17,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:17" (1/1) ... [2024-11-09 10:28:17,830 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:17" (1/1) ... [2024-11-09 10:28:17,863 INFO L138 Inliner]: procedures = 175, calls = 36, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 109 [2024-11-09 10:28:17,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:28:17,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:28:17,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:28:17,865 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:28:17,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:17" (1/1) ... [2024-11-09 10:28:17,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:17" (1/1) ... [2024-11-09 10:28:17,882 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:17" (1/1) ... [2024-11-09 10:28:17,909 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-09 10:28:17,910 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:17" (1/1) ... [2024-11-09 10:28:17,910 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:17" (1/1) ... [2024-11-09 10:28:17,927 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:17" (1/1) ... [2024-11-09 10:28:17,933 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:17" (1/1) ... [2024-11-09 10:28:17,936 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:17" (1/1) ... [2024-11-09 10:28:17,941 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:17" (1/1) ... [2024-11-09 10:28:17,944 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:28:17,948 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:28:17,948 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:28:17,948 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:28:17,949 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:17" (1/1) ... [2024-11-09 10:28:17,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:28:17,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:28:17,986 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-09 10:28:17,993 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-09 10:28:18,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 10:28:18,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:28:18,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:28:18,032 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-09 10:28:18,032 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-09 10:28:18,032 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-09 10:28:18,033 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-09 10:28:18,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 10:28:18,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:28:18,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:28:18,034 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:28:18,213 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:28:18,215 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:28:18,551 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:28:18,552 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:28:18,815 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:28:18,815 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 10:28:18,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:28:18 BoogieIcfgContainer [2024-11-09 10:28:18,816 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:28:18,817 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:28:18,817 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:28:18,822 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:28:18,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:28:17" (1/3) ... [2024-11-09 10:28:18,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c496f90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:28:18, skipping insertion in model container [2024-11-09 10:28:18,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:28:17" (2/3) ... [2024-11-09 10:28:18,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c496f90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:28:18, skipping insertion in model container [2024-11-09 10:28:18,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:28:18" (3/3) ... [2024-11-09 10:28:18,827 INFO L112 eAbstractionObserver]: Analyzing ICFG mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-09 10:28:18,845 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:28:18,847 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-09 10:28:18,847 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:28:18,911 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:28:18,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 36 transitions, 80 flow [2024-11-09 10:28:18,983 INFO L124 PetriNetUnfolderBase]: 2/34 cut-off events. [2024-11-09 10:28:18,983 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:28:18,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 34 events. 2/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2024-11-09 10:28:18,988 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 36 transitions, 80 flow [2024-11-09 10:28:18,991 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 34 transitions, 74 flow [2024-11-09 10:28:19,002 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:28:19,012 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;@5938f6e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:28:19,013 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-09 10:28:19,017 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:28:19,017 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-09 10:28:19,018 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:28:19,018 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:28:19,019 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-09 10:28:19,020 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-09 10:28:19,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:28:19,026 INFO L85 PathProgramCache]: Analyzing trace with hash 10702359, now seen corresponding path program 1 times [2024-11-09 10:28:19,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:28:19,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759348129] [2024-11-09 10:28:19,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:28:19,040 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-09 10:28:19,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:28:19,044 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-09 10:28:19,045 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-09 10:28:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:28:19,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:28:19,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:28:19,167 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-09 10:28:19,168 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:28:19,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:28:19,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759348129] [2024-11-09 10:28:19,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759348129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:28:19,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:28:19,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:28:19,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706452965] [2024-11-09 10:28:19,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:28:19,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:28:19,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:28:19,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:28:19,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:28:19,216 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 36 [2024-11-09 10:28:19,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-09 10:28:19,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:28:19,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 36 [2024-11-09 10:28:19,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:28:19,406 INFO L124 PetriNetUnfolderBase]: 183/391 cut-off events. [2024-11-09 10:28:19,406 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 10:28:19,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 391 events. 183/391 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1950 event pairs, 69 based on Foata normal form. 32/418 useless extension candidates. Maximal degree in co-relation 715. Up to 265 conditions per place. [2024-11-09 10:28:19,413 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 25 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2024-11-09 10:28:19,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 151 flow [2024-11-09 10:28:19,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:28:19,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:28:19,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-11-09 10:28:19,426 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7314814814814815 [2024-11-09 10:28:19,428 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 74 flow. Second operand 3 states and 79 transitions. [2024-11-09 10:28:19,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 151 flow [2024-11-09 10:28:19,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:28:19,432 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 66 flow [2024-11-09 10:28:19,434 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2024-11-09 10:28:19,438 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2024-11-09 10:28:19,441 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 66 flow [2024-11-09 10:28:19,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-09 10:28:19,448 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:28:19,449 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:28:19,453 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 (2)] Ended with exit code 0 [2024-11-09 10:28:19,651 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-09 10:28:19,652 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-09 10:28:19,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:28:19,653 INFO L85 PathProgramCache]: Analyzing trace with hash -273204962, now seen corresponding path program 1 times [2024-11-09 10:28:19,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:28:19,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [16264592] [2024-11-09 10:28:19,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:28:19,654 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-09 10:28:19,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:28:19,656 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-09 10:28:19,657 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-09 10:28:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:28:19,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:28:19,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:28:19,791 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-09 10:28:19,792 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:28:19,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:28:19,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [16264592] [2024-11-09 10:28:19,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [16264592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:28:19,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:28:19,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:28:19,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790422442] [2024-11-09 10:28:19,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:28:19,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:28:19,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:28:19,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:28:19,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:28:19,802 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-11-09 10:28:19,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-09 10:28:19,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:28:19,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-11-09 10:28:19,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:28:19,980 INFO L124 PetriNetUnfolderBase]: 220/493 cut-off events. [2024-11-09 10:28:19,981 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-11-09 10:28:19,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 493 events. 220/493 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2503 event pairs, 38 based on Foata normal form. 25/506 useless extension candidates. Maximal degree in co-relation 930. Up to 229 conditions per place. [2024-11-09 10:28:19,988 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 32 selfloop transitions, 4 changer transitions 1/47 dead transitions. [2024-11-09 10:28:19,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 182 flow [2024-11-09 10:28:19,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:28:19,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:28:19,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2024-11-09 10:28:19,991 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2024-11-09 10:28:19,991 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 66 flow. Second operand 4 states and 87 transitions. [2024-11-09 10:28:19,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 182 flow [2024-11-09 10:28:19,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:28:19,993 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 88 flow [2024-11-09 10:28:19,993 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=88, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2024-11-09 10:28:19,994 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 0 predicate places. [2024-11-09 10:28:19,994 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 88 flow [2024-11-09 10:28:19,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-09 10:28:19,995 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:28:19,995 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-09 10:28:20,001 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-09 10:28:20,195 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-09 10:28:20,196 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-09 10:28:20,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:28:20,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1886724739, now seen corresponding path program 1 times [2024-11-09 10:28:20,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:28:20,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913986988] [2024-11-09 10:28:20,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:28:20,198 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-09 10:28:20,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:28:20,200 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-09 10:28:20,203 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-09 10:28:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:28:20,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:28:20,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:28:20,322 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-09 10:28:20,323 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:28:20,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:28:20,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913986988] [2024-11-09 10:28:20,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913986988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:28:20,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:28:20,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:28:20,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972525901] [2024-11-09 10:28:20,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:28:20,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:28:20,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:28:20,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:28:20,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:28:20,333 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-11-09 10:28:20,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:28:20,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:28:20,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-11-09 10:28:20,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:28:20,473 INFO L124 PetriNetUnfolderBase]: 106/238 cut-off events. [2024-11-09 10:28:20,474 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-11-09 10:28:20,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 238 events. 106/238 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 832 event pairs, 26 based on Foata normal form. 16/245 useless extension candidates. Maximal degree in co-relation 531. Up to 86 conditions per place. [2024-11-09 10:28:20,480 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 27 selfloop transitions, 6 changer transitions 1/44 dead transitions. [2024-11-09 10:28:20,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 44 transitions, 187 flow [2024-11-09 10:28:20,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:28:20,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:28:20,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2024-11-09 10:28:20,484 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-11-09 10:28:20,484 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 88 flow. Second operand 5 states and 96 transitions. [2024-11-09 10:28:20,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 44 transitions, 187 flow [2024-11-09 10:28:20,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 44 transitions, 178 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-09 10:28:20,489 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 104 flow [2024-11-09 10:28:20,489 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=104, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2024-11-09 10:28:20,489 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2024-11-09 10:28:20,490 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 104 flow [2024-11-09 10:28:20,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:28:20,490 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:28:20,490 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:28:20,496 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 (4)] Ended with exit code 0 [2024-11-09 10:28:20,690 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-09 10:28:20,691 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-09 10:28:20,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:28:20,692 INFO L85 PathProgramCache]: Analyzing trace with hash 206443724, now seen corresponding path program 1 times [2024-11-09 10:28:20,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:28:20,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [189795249] [2024-11-09 10:28:20,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:28:20,693 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-09 10:28:20,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:28:20,694 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-09 10:28:20,695 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-09 10:28:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:28:20,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:28:20,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:28:20,823 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-09 10:28:20,823 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:28:20,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:28:20,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [189795249] [2024-11-09 10:28:20,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [189795249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:28:20,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:28:20,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:28:20,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687764741] [2024-11-09 10:28:20,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:28:20,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:28:20,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:28:20,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:28:20,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:28:20,829 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 36 [2024-11-09 10:28:20,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-09 10:28:20,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:28:20,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 36 [2024-11-09 10:28:20,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:28:20,880 INFO L124 PetriNetUnfolderBase]: 62/168 cut-off events. [2024-11-09 10:28:20,881 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-11-09 10:28:20,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 168 events. 62/168 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 566 event pairs, 60 based on Foata normal form. 4/163 useless extension candidates. Maximal degree in co-relation 350. Up to 123 conditions per place. [2024-11-09 10:28:20,882 INFO L140 encePairwiseOnDemand]: 34/36 looper letters, 14 selfloop transitions, 1 changer transitions 1/30 dead transitions. [2024-11-09 10:28:20,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 134 flow [2024-11-09 10:28:20,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:28:20,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:28:20,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2024-11-09 10:28:20,883 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5462962962962963 [2024-11-09 10:28:20,883 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 104 flow. Second operand 3 states and 59 transitions. [2024-11-09 10:28:20,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 134 flow [2024-11-09 10:28:20,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 30 transitions, 106 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-11-09 10:28:20,885 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 74 flow [2024-11-09 10:28:20,885 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2024-11-09 10:28:20,886 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2024-11-09 10:28:20,886 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 74 flow [2024-11-09 10:28:20,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-09 10:28:20,887 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:28:20,887 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:28:20,893 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 (5)] Ended with exit code 0 [2024-11-09 10:28:21,087 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-09 10:28:21,088 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-09 10:28:21,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:28:21,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1179935238, now seen corresponding path program 1 times [2024-11-09 10:28:21,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:28:21,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288029336] [2024-11-09 10:28:21,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:28:21,089 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-09 10:28:21,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:28:21,090 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-09 10:28:21,091 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-09 10:28:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:28:21,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 10:28:21,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:28:21,412 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-09 10:28:21,412 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:28:21,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:28:21,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288029336] [2024-11-09 10:28:21,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1288029336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:28:21,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:28:21,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 10:28:21,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122732771] [2024-11-09 10:28:21,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:28:21,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 10:28:21,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:28:21,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 10:28:21,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:28:21,428 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 36 [2024-11-09 10:28:21,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 74 flow. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 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-09 10:28:21,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:28:21,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 36 [2024-11-09 10:28:21,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:28:21,668 INFO L124 PetriNetUnfolderBase]: 91/231 cut-off events. [2024-11-09 10:28:21,669 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:28:21,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 231 events. 91/231 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 862 event pairs, 17 based on Foata normal form. 4/226 useless extension candidates. Maximal degree in co-relation 443. Up to 51 conditions per place. [2024-11-09 10:28:21,670 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 22 selfloop transitions, 4 changer transitions 17/56 dead transitions. [2024-11-09 10:28:21,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 218 flow [2024-11-09 10:28:21,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 10:28:21,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 10:28:21,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-11-09 10:28:21,672 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5246913580246914 [2024-11-09 10:28:21,673 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 74 flow. Second operand 9 states and 170 transitions. [2024-11-09 10:28:21,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 218 flow [2024-11-09 10:28:21,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 56 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:28:21,674 INFO L231 Difference]: Finished difference. Result has 48 places, 29 transitions, 91 flow [2024-11-09 10:28:21,675 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=91, PETRI_PLACES=48, PETRI_TRANSITIONS=29} [2024-11-09 10:28:21,675 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2024-11-09 10:28:21,676 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 29 transitions, 91 flow [2024-11-09 10:28:21,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 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-09 10:28:21,676 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:28:21,676 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:28:21,682 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 (6)] Forceful destruction successful, exit code 0 [2024-11-09 10:28:21,877 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-09 10:28:21,878 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-09 10:28:21,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:28:21,878 INFO L85 PathProgramCache]: Analyzing trace with hash -989591964, now seen corresponding path program 2 times [2024-11-09 10:28:21,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:28:21,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786536162] [2024-11-09 10:28:21,879 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:28:21,879 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-09 10:28:21,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:28:21,881 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-09 10:28:21,882 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-09 10:28:21,952 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 10:28:21,952 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:28:21,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:28:21,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:28:22,040 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-09 10:28:22,041 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:28:22,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:28:22,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [786536162] [2024-11-09 10:28:22,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [786536162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:28:22,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:28:22,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:28:22,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241376128] [2024-11-09 10:28:22,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:28:22,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:28:22,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:28:22,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:28:22,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:28:22,068 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-11-09 10:28:22,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 29 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-09 10:28:22,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:28:22,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-11-09 10:28:22,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:28:22,204 INFO L124 PetriNetUnfolderBase]: 124/302 cut-off events. [2024-11-09 10:28:22,205 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-11-09 10:28:22,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 302 events. 124/302 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1246 event pairs, 70 based on Foata normal form. 4/291 useless extension candidates. Maximal degree in co-relation 661. Up to 136 conditions per place. [2024-11-09 10:28:22,208 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 19 selfloop transitions, 2 changer transitions 14/46 dead transitions. [2024-11-09 10:28:22,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 209 flow [2024-11-09 10:28:22,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:28:22,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:28:22,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2024-11-09 10:28:22,210 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-11-09 10:28:22,210 INFO L175 Difference]: Start difference. First operand has 48 places, 29 transitions, 91 flow. Second operand 5 states and 96 transitions. [2024-11-09 10:28:22,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 209 flow [2024-11-09 10:28:22,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 46 transitions, 187 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-11-09 10:28:22,215 INFO L231 Difference]: Finished difference. Result has 44 places, 29 transitions, 89 flow [2024-11-09 10:28:22,216 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=89, PETRI_PLACES=44, PETRI_TRANSITIONS=29} [2024-11-09 10:28:22,216 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 5 predicate places. [2024-11-09 10:28:22,217 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 29 transitions, 89 flow [2024-11-09 10:28:22,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-09 10:28:22,217 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:28:22,217 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:28:22,223 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-09 10:28:22,417 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-09 10:28:22,418 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2024-11-09 10:28:22,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:28:22,419 INFO L85 PathProgramCache]: Analyzing trace with hash 2133046620, now seen corresponding path program 3 times [2024-11-09 10:28:22,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:28:22,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [158469693] [2024-11-09 10:28:22,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:28:22,419 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-09 10:28:22,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:28:22,421 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-09 10:28:22,422 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-09 10:28:22,501 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-09 10:28:22,502 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-09 10:28:22,502 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:28:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:28:22,588 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 10:28:22,588 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:28:22,589 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-11-09 10:28:22,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-09 10:28:22,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-11-09 10:28:22,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-09 10:28:22,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-09 10:28:22,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2024-11-09 10:28:22,598 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-09 10:28:22,792 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-09 10:28:22,793 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2024-11-09 10:28:22,870 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:28:22,870 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:28:22,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:28:22 BasicIcfg [2024-11-09 10:28:22,878 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:28:22,878 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:28:22,878 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:28:22,879 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:28:22,879 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:28:18" (3/4) ... [2024-11-09 10:28:22,881 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:28:22,881 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:28:22,882 INFO L158 Benchmark]: Toolchain (without parser) took 5669.28ms. Allocated memory was 65.0MB in the beginning and 117.4MB in the end (delta: 52.4MB). Free memory was 45.6MB in the beginning and 85.4MB in the end (delta: -39.8MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2024-11-09 10:28:22,882 INFO L158 Benchmark]: CDTParser took 0.89ms. Allocated memory is still 52.4MB. Free memory is still 35.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:28:22,883 INFO L158 Benchmark]: CACSL2BoogieTranslator took 583.01ms. Allocated memory is still 65.0MB. Free memory was 45.4MB in the beginning and 36.5MB in the end (delta: 8.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 10:28:22,883 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.63ms. Allocated memory is still 65.0MB. Free memory was 36.5MB in the beginning and 33.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:28:22,884 INFO L158 Benchmark]: Boogie Preprocessor took 82.67ms. Allocated memory is still 65.0MB. Free memory was 33.9MB in the beginning and 30.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 10:28:22,884 INFO L158 Benchmark]: RCFGBuilder took 867.69ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 30.5MB in the beginning and 38.2MB in the end (delta: -7.6MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2024-11-09 10:28:22,884 INFO L158 Benchmark]: TraceAbstraction took 4060.37ms. Allocated memory was 79.7MB in the beginning and 117.4MB in the end (delta: 37.7MB). Free memory was 37.7MB in the beginning and 85.4MB in the end (delta: -47.7MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. [2024-11-09 10:28:22,885 INFO L158 Benchmark]: Witness Printer took 3.15ms. Allocated memory is still 117.4MB. Free memory is still 85.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:28:22,887 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.89ms. Allocated memory is still 52.4MB. Free memory is still 35.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 583.01ms. Allocated memory is still 65.0MB. Free memory was 45.4MB in the beginning and 36.5MB in the end (delta: 8.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.63ms. Allocated memory is still 65.0MB. Free memory was 36.5MB in the beginning and 33.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.67ms. Allocated memory is still 65.0MB. Free memory was 33.9MB in the beginning and 30.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 867.69ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 30.5MB in the beginning and 38.2MB in the end (delta: -7.6MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4060.37ms. Allocated memory was 79.7MB in the beginning and 117.4MB in the end (delta: 37.7MB). Free memory was 37.7MB in the beginning and 85.4MB in the end (delta: -47.7MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. * Witness Printer took 3.15ms. Allocated memory is still 117.4MB. Free memory is still 85.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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t585; [L811] FCALL, FORK 0 pthread_create(&t585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t585=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L738] 1 y$w_buff1 = y$w_buff0 [L739] 1 y$w_buff0 = 1 [L740] 1 y$w_buff1_used = y$w_buff0_used [L741] 1 y$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L746] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L812] 0 pthread_t t586; [L813] FCALL, FORK 0 pthread_create(&t586, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t585=0, t586=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L749] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L766] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L769] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EBX = y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L788] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L790] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L791] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L792] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L752] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L756] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t585=0, t586=1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L817] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L817] RET 0 assume_abort_if_not(main$tmp_guard0) [L819] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L820] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L821] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L822] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L823] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t585=0, t586=1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L826] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t585=0, t586=1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L828] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L17] 0 __assert_fail ("0", "mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 808]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 813]: 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: 811]: 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 5 procedures, 53 locations, 6 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: 3.8s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 148 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 131 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 490 IncrementalHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 16 mSDtfsCounter, 490 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=3, InterpolantAutomatonStates: 29, 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.5s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 343 SizeOfPredicates, 8 NumberOfNonLiveVariables, 529 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-09 10:28:22,915 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