./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix039.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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/mix039.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 4df22382a468f75ea1bc6624bacd8789c0b9b9f8aa1bc2866cf2715dcbc507bc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 21:26:55,384 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:26:55,472 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 21:26:55,478 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:26:55,479 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:26:55,513 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:26:55,514 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:26:55,514 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:26:55,515 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:26:55,516 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:26:55,516 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:26:55,516 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:26:55,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:26:55,519 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:26:55,519 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:26:55,520 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:26:55,520 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:26:55,520 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:26:55,520 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:26:55,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:26:55,521 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:26:55,522 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:26:55,522 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:26:55,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:26:55,523 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:26:55,523 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:26:55,523 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:26:55,524 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:26:55,524 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:26:55,524 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:26:55,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:26:55,525 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:26:55,525 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:26:55,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:26:55,526 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:26:55,526 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:26:55,526 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 21:26:55,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 21:26:55,527 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:26:55,527 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:26:55,527 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:26:55,528 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:26:55,528 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 -> 4df22382a468f75ea1bc6624bacd8789c0b9b9f8aa1bc2866cf2715dcbc507bc [2024-11-22 21:26:55,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:26:55,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:26:55,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:26:55,839 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:26:55,839 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:26:55,841 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix039.opt.i [2024-11-22 21:26:57,321 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:26:57,635 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:26:57,635 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix039.opt.i [2024-11-22 21:26:57,659 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03f6b803f/3f538f19b117414fadb6c0458fc4c106/FLAG5ab517ca2 [2024-11-22 21:26:57,675 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03f6b803f/3f538f19b117414fadb6c0458fc4c106 [2024-11-22 21:26:57,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:26:57,680 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:26:57,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:26:57,684 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:26:57,689 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:26:57,690 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:26:57" (1/1) ... [2024-11-22 21:26:57,691 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cc50bee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:26:57, skipping insertion in model container [2024-11-22 21:26:57,691 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:26:57" (1/1) ... [2024-11-22 21:26:57,757 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:26:58,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:26:58,168 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 21:26:58,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:26:58,267 INFO L204 MainTranslator]: Completed translation [2024-11-22 21:26:58,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:26:58 WrapperNode [2024-11-22 21:26:58,268 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:26:58,270 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 21:26:58,271 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 21:26:58,271 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 21:26:58,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:26:58" (1/1) ... [2024-11-22 21:26:58,294 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:26:58" (1/1) ... [2024-11-22 21:26:58,323 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 139 [2024-11-22 21:26:58,324 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 21:26:58,325 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 21:26:58,325 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 21:26:58,325 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 21:26:58,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:26:58" (1/1) ... [2024-11-22 21:26:58,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:26:58" (1/1) ... [2024-11-22 21:26:58,340 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:26:58" (1/1) ... [2024-11-22 21:26:58,358 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-22 21:26:58,359 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:26:58" (1/1) ... [2024-11-22 21:26:58,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:26:58" (1/1) ... [2024-11-22 21:26:58,370 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:26:58" (1/1) ... [2024-11-22 21:26:58,372 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:26:58" (1/1) ... [2024-11-22 21:26:58,374 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:26:58" (1/1) ... [2024-11-22 21:26:58,376 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:26:58" (1/1) ... [2024-11-22 21:26:58,380 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 21:26:58,381 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 21:26:58,381 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 21:26:58,381 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 21:26:58,382 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:26:58" (1/1) ... [2024-11-22 21:26:58,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:26:58,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:26:58,431 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-22 21:26:58,434 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-22 21:26:58,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-22 21:26:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 21:26:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-22 21:26:58,492 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-22 21:26:58,493 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-22 21:26:58,493 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-22 21:26:58,493 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-22 21:26:58,493 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-22 21:26:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-22 21:26:58,494 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-22 21:26:58,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 21:26:58,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-22 21:26:58,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 21:26:58,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 21:26:58,498 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 21:26:58,639 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 21:26:58,641 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 21:26:58,991 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 21:26:58,992 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 21:26:59,214 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 21:26:59,215 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-22 21:26:59,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:26:59 BoogieIcfgContainer [2024-11-22 21:26:59,218 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 21:26:59,220 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 21:26:59,221 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 21:26:59,225 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 21:26:59,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:26:57" (1/3) ... [2024-11-22 21:26:59,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d475ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:26:59, skipping insertion in model container [2024-11-22 21:26:59,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:26:58" (2/3) ... [2024-11-22 21:26:59,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d475ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:26:59, skipping insertion in model container [2024-11-22 21:26:59,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:26:59" (3/3) ... [2024-11-22 21:26:59,229 INFO L112 eAbstractionObserver]: Analyzing ICFG mix039.opt.i [2024-11-22 21:26:59,248 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 21:26:59,248 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-22 21:26:59,248 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 21:26:59,319 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-22 21:26:59,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 126 flow [2024-11-22 21:26:59,388 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2024-11-22 21:26:59,389 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:26:59,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 106 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2024-11-22 21:26:59,395 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 126 flow [2024-11-22 21:26:59,400 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 114 flow [2024-11-22 21:26:59,414 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:26:59,421 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;@34da8f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:26:59,422 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-22 21:26:59,437 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 21:26:59,437 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-11-22 21:26:59,437 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:26:59,438 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:26:59,438 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:26:59,439 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:26:59,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:26:59,445 INFO L85 PathProgramCache]: Analyzing trace with hash -2059415119, now seen corresponding path program 1 times [2024-11-22 21:26:59,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:26:59,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142100247] [2024-11-22 21:26:59,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:26:59,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:26:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:27:00,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:27:00,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:27:00,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142100247] [2024-11-22 21:27:00,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142100247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:00,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:00,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:27:00,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431369975] [2024-11-22 21:27:00,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:00,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:27:00,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:27:00,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:27:00,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:27:00,078 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2024-11-22 21:27:00,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:00,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:00,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2024-11-22 21:27:00,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:00,624 INFO L124 PetriNetUnfolderBase]: 931/1851 cut-off events. [2024-11-22 21:27:00,624 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:27:00,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3247 conditions, 1851 events. 931/1851 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 14072 event pairs, 199 based on Foata normal form. 96/1918 useless extension candidates. Maximal degree in co-relation 3235. Up to 1021 conditions per place. [2024-11-22 21:27:00,649 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 29 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2024-11-22 21:27:00,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 58 transitions, 194 flow [2024-11-22 21:27:00,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:27:00,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:27:00,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2024-11-22 21:27:00,664 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7575757575757576 [2024-11-22 21:27:00,666 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 125 transitions. [2024-11-22 21:27:00,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 58 transitions, 194 flow [2024-11-22 21:27:00,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 58 transitions, 190 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-22 21:27:00,673 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2024-11-22 21:27:00,675 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-11-22 21:27:00,679 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2024-11-22 21:27:00,679 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2024-11-22 21:27:00,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:00,680 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:00,680 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:27:00,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 21:27:00,681 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:00,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:00,682 INFO L85 PathProgramCache]: Analyzing trace with hash -279928531, now seen corresponding path program 1 times [2024-11-22 21:27:00,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:27:00,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109333500] [2024-11-22 21:27:00,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:27:00,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:27:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:27:00,760 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-22 21:27:00,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:27:00,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109333500] [2024-11-22 21:27:00,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109333500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:00,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:00,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:27:00,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493458276] [2024-11-22 21:27:00,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:00,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:27:00,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:27:00,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:27:00,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:27:00,766 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2024-11-22 21:27:00,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:00,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:00,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2024-11-22 21:27:00,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:01,032 INFO L124 PetriNetUnfolderBase]: 815/1519 cut-off events. [2024-11-22 21:27:01,033 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2024-11-22 21:27:01,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2833 conditions, 1519 events. 815/1519 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11021 event pairs, 815 based on Foata normal form. 48/1502 useless extension candidates. Maximal degree in co-relation 2823. Up to 1188 conditions per place. [2024-11-22 21:27:01,048 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 19 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2024-11-22 21:27:01,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 144 flow [2024-11-22 21:27:01,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:27:01,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:27:01,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-11-22 21:27:01,051 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2024-11-22 21:27:01,051 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 106 transitions. [2024-11-22 21:27:01,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 144 flow [2024-11-22 21:27:01,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:27:01,054 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 98 flow [2024-11-22 21:27:01,054 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2024-11-22 21:27:01,055 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2024-11-22 21:27:01,055 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 98 flow [2024-11-22 21:27:01,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:01,055 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:01,055 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:27:01,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 21:27:01,056 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:01,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:01,056 INFO L85 PathProgramCache]: Analyzing trace with hash -279927368, now seen corresponding path program 1 times [2024-11-22 21:27:01,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:27:01,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804829488] [2024-11-22 21:27:01,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:27:01,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:27:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:27:01,310 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-22 21:27:01,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:27:01,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804829488] [2024-11-22 21:27:01,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804829488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:01,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:01,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:27:01,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711272664] [2024-11-22 21:27:01,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:01,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:27:01,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:27:01,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:27:01,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:27:01,330 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2024-11-22 21:27:01,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:01,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:01,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2024-11-22 21:27:01,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:01,839 INFO L124 PetriNetUnfolderBase]: 1327/2247 cut-off events. [2024-11-22 21:27:01,840 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:27:01,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4217 conditions, 2247 events. 1327/2247 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 16231 event pairs, 307 based on Foata normal form. 0/2170 useless extension candidates. Maximal degree in co-relation 4211. Up to 853 conditions per place. [2024-11-22 21:27:01,854 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 27 selfloop transitions, 2 changer transitions 36/86 dead transitions. [2024-11-22 21:27:01,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 86 transitions, 312 flow [2024-11-22 21:27:01,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:27:01,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:27:01,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 275 transitions. [2024-11-22 21:27:01,858 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-11-22 21:27:01,858 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 98 flow. Second operand 8 states and 275 transitions. [2024-11-22 21:27:01,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 86 transitions, 312 flow [2024-11-22 21:27:01,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 86 transitions, 311 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:27:01,862 INFO L231 Difference]: Finished difference. Result has 66 places, 43 transitions, 111 flow [2024-11-22 21:27:01,862 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=111, PETRI_PLACES=66, PETRI_TRANSITIONS=43} [2024-11-22 21:27:01,864 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2024-11-22 21:27:01,864 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 43 transitions, 111 flow [2024-11-22 21:27:01,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:01,864 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:01,864 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:27:01,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 21:27:01,865 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:01,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:01,865 INFO L85 PathProgramCache]: Analyzing trace with hash -917487499, now seen corresponding path program 1 times [2024-11-22 21:27:01,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:27:01,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658611638] [2024-11-22 21:27:01,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:27:01,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:27:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:27:02,083 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-22 21:27:02,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:27:02,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658611638] [2024-11-22 21:27:02,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658611638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:02,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:02,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:27:02,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364272591] [2024-11-22 21:27:02,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:02,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:27:02,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:27:02,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:27:02,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:27:02,094 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2024-11-22 21:27:02,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 43 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:02,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:02,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2024-11-22 21:27:02,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:02,619 INFO L124 PetriNetUnfolderBase]: 1844/3096 cut-off events. [2024-11-22 21:27:02,619 INFO L125 PetriNetUnfolderBase]: For 558/558 co-relation queries the response was YES. [2024-11-22 21:27:02,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6291 conditions, 3096 events. 1844/3096 cut-off events. For 558/558 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 21158 event pairs, 936 based on Foata normal form. 72/3132 useless extension candidates. Maximal degree in co-relation 6279. Up to 2102 conditions per place. [2024-11-22 21:27:02,645 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 33 selfloop transitions, 3 changer transitions 29/85 dead transitions. [2024-11-22 21:27:02,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 85 transitions, 339 flow [2024-11-22 21:27:02,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:27:02,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:27:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 242 transitions. [2024-11-22 21:27:02,648 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2024-11-22 21:27:02,650 INFO L175 Difference]: Start difference. First operand has 66 places, 43 transitions, 111 flow. Second operand 7 states and 242 transitions. [2024-11-22 21:27:02,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 85 transitions, 339 flow [2024-11-22 21:27:02,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 85 transitions, 319 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-22 21:27:02,668 INFO L231 Difference]: Finished difference. Result has 65 places, 45 transitions, 134 flow [2024-11-22 21:27:02,670 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=134, PETRI_PLACES=65, PETRI_TRANSITIONS=45} [2024-11-22 21:27:02,671 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2024-11-22 21:27:02,672 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 45 transitions, 134 flow [2024-11-22 21:27:02,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:02,672 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:02,673 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] [2024-11-22 21:27:02,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 21:27:02,673 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:02,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:02,674 INFO L85 PathProgramCache]: Analyzing trace with hash -2074419852, now seen corresponding path program 1 times [2024-11-22 21:27:02,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:27:02,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915199932] [2024-11-22 21:27:02,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:27:02,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:27:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:27:02,874 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-22 21:27:02,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:27:02,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915199932] [2024-11-22 21:27:02,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915199932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:02,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:02,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:27:02,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072959281] [2024-11-22 21:27:02,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:02,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:27:02,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:27:02,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:27:02,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:27:02,890 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-11-22 21:27:02,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 45 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-22 21:27:02,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:02,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-11-22 21:27:02,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:03,810 INFO L124 PetriNetUnfolderBase]: 4815/7368 cut-off events. [2024-11-22 21:27:03,811 INFO L125 PetriNetUnfolderBase]: For 1798/1798 co-relation queries the response was YES. [2024-11-22 21:27:03,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15972 conditions, 7368 events. 4815/7368 cut-off events. For 1798/1798 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 50674 event pairs, 722 based on Foata normal form. 225/7440 useless extension candidates. Maximal degree in co-relation 15959. Up to 4007 conditions per place. [2024-11-22 21:27:03,887 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 45 selfloop transitions, 6 changer transitions 0/71 dead transitions. [2024-11-22 21:27:03,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 71 transitions, 294 flow [2024-11-22 21:27:03,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:27:03,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:27:03,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2024-11-22 21:27:03,889 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6772727272727272 [2024-11-22 21:27:03,889 INFO L175 Difference]: Start difference. First operand has 65 places, 45 transitions, 134 flow. Second operand 4 states and 149 transitions. [2024-11-22 21:27:03,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 71 transitions, 294 flow [2024-11-22 21:27:03,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 71 transitions, 287 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-22 21:27:03,908 INFO L231 Difference]: Finished difference. Result has 63 places, 50 transitions, 173 flow [2024-11-22 21:27:03,908 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=63, PETRI_TRANSITIONS=50} [2024-11-22 21:27:03,910 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 1 predicate places. [2024-11-22 21:27:03,911 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 50 transitions, 173 flow [2024-11-22 21:27:03,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-22 21:27:03,911 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:03,911 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:27:03,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 21:27:03,912 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:03,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:03,913 INFO L85 PathProgramCache]: Analyzing trace with hash 935621326, now seen corresponding path program 1 times [2024-11-22 21:27:03,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:27:03,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834758502] [2024-11-22 21:27:03,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:27:03,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:27:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:27:04,206 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-22 21:27:04,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:27:04,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834758502] [2024-11-22 21:27:04,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834758502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:04,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:04,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:27:04,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686913775] [2024-11-22 21:27:04,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:04,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:27:04,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:27:04,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:27:04,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:27:04,230 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 55 [2024-11-22 21:27:04,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 50 transitions, 173 flow. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 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-22 21:27:04,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:04,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 55 [2024-11-22 21:27:04,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:06,596 INFO L124 PetriNetUnfolderBase]: 11871/19061 cut-off events. [2024-11-22 21:27:06,596 INFO L125 PetriNetUnfolderBase]: For 7631/8350 co-relation queries the response was YES. [2024-11-22 21:27:06,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44071 conditions, 19061 events. 11871/19061 cut-off events. For 7631/8350 co-relation queries the response was YES. Maximal size of possible extension queue 1073. Compared 150702 event pairs, 3865 based on Foata normal form. 380/18065 useless extension candidates. Maximal degree in co-relation 44057. Up to 7490 conditions per place. [2024-11-22 21:27:06,778 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 83 selfloop transitions, 13 changer transitions 0/118 dead transitions. [2024-11-22 21:27:06,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 118 transitions, 545 flow [2024-11-22 21:27:06,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:27:06,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:27:06,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 273 transitions. [2024-11-22 21:27:06,781 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6204545454545455 [2024-11-22 21:27:06,781 INFO L175 Difference]: Start difference. First operand has 63 places, 50 transitions, 173 flow. Second operand 8 states and 273 transitions. [2024-11-22 21:27:06,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 118 transitions, 545 flow [2024-11-22 21:27:06,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 118 transitions, 537 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-22 21:27:06,788 INFO L231 Difference]: Finished difference. Result has 75 places, 59 transitions, 269 flow [2024-11-22 21:27:06,788 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=269, PETRI_PLACES=75, PETRI_TRANSITIONS=59} [2024-11-22 21:27:06,790 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 13 predicate places. [2024-11-22 21:27:06,791 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 59 transitions, 269 flow [2024-11-22 21:27:06,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 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-22 21:27:06,791 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:06,791 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:27:06,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 21:27:06,792 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:06,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:06,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1080896880, now seen corresponding path program 1 times [2024-11-22 21:27:06,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:27:06,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586388147] [2024-11-22 21:27:06,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:27:06,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:27:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:27:07,005 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-22 21:27:07,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:27:07,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586388147] [2024-11-22 21:27:07,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586388147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:07,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:07,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:27:07,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535316553] [2024-11-22 21:27:07,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:07,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:27:07,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:27:07,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:27:07,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:27:07,012 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-11-22 21:27:07,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 59 transitions, 269 flow. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 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-22 21:27:07,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:07,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-11-22 21:27:07,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:08,739 INFO L124 PetriNetUnfolderBase]: 10252/15837 cut-off events. [2024-11-22 21:27:08,739 INFO L125 PetriNetUnfolderBase]: For 10772/11821 co-relation queries the response was YES. [2024-11-22 21:27:08,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40694 conditions, 15837 events. 10252/15837 cut-off events. For 10772/11821 co-relation queries the response was YES. Maximal size of possible extension queue 831. Compared 115129 event pairs, 982 based on Foata normal form. 529/16069 useless extension candidates. Maximal degree in co-relation 40673. Up to 7401 conditions per place. [2024-11-22 21:27:08,843 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 59 selfloop transitions, 10 changer transitions 2/97 dead transitions. [2024-11-22 21:27:08,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 97 transitions, 513 flow [2024-11-22 21:27:08,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:27:08,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:27:08,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 190 transitions. [2024-11-22 21:27:08,845 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6909090909090909 [2024-11-22 21:27:08,845 INFO L175 Difference]: Start difference. First operand has 75 places, 59 transitions, 269 flow. Second operand 5 states and 190 transitions. [2024-11-22 21:27:08,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 97 transitions, 513 flow [2024-11-22 21:27:08,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 97 transitions, 497 flow, removed 8 selfloop flow, removed 0 redundant places. [2024-11-22 21:27:08,993 INFO L231 Difference]: Finished difference. Result has 81 places, 62 transitions, 308 flow [2024-11-22 21:27:08,994 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=308, PETRI_PLACES=81, PETRI_TRANSITIONS=62} [2024-11-22 21:27:08,995 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 19 predicate places. [2024-11-22 21:27:08,995 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 62 transitions, 308 flow [2024-11-22 21:27:08,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 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-22 21:27:08,996 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:08,996 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:27:08,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 21:27:08,996 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:08,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:08,997 INFO L85 PathProgramCache]: Analyzing trace with hash -2052214957, now seen corresponding path program 1 times [2024-11-22 21:27:08,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:27:08,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394474143] [2024-11-22 21:27:08,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:27:08,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:27:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:27:09,301 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-22 21:27:09,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:27:09,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394474143] [2024-11-22 21:27:09,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394474143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:09,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:09,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:27:09,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254770078] [2024-11-22 21:27:09,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:09,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:27:09,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:27:09,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:27:09,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:27:09,310 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-11-22 21:27:09,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 62 transitions, 308 flow. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 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-22 21:27:09,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:09,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-11-22 21:27:09,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:10,467 INFO L124 PetriNetUnfolderBase]: 7636/11677 cut-off events. [2024-11-22 21:27:10,468 INFO L125 PetriNetUnfolderBase]: For 13675/15052 co-relation queries the response was YES. [2024-11-22 21:27:10,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33794 conditions, 11677 events. 7636/11677 cut-off events. For 13675/15052 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 78838 event pairs, 498 based on Foata normal form. 418/11822 useless extension candidates. Maximal degree in co-relation 33769. Up to 3472 conditions per place. [2024-11-22 21:27:10,572 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 70 selfloop transitions, 14 changer transitions 0/110 dead transitions. [2024-11-22 21:27:10,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 110 transitions, 621 flow [2024-11-22 21:27:10,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:27:10,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:27:10,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 229 transitions. [2024-11-22 21:27:10,574 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.693939393939394 [2024-11-22 21:27:10,574 INFO L175 Difference]: Start difference. First operand has 81 places, 62 transitions, 308 flow. Second operand 6 states and 229 transitions. [2024-11-22 21:27:10,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 110 transitions, 621 flow [2024-11-22 21:27:10,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 110 transitions, 601 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-11-22 21:27:10,601 INFO L231 Difference]: Finished difference. Result has 84 places, 67 transitions, 374 flow [2024-11-22 21:27:10,602 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=374, PETRI_PLACES=84, PETRI_TRANSITIONS=67} [2024-11-22 21:27:10,602 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 22 predicate places. [2024-11-22 21:27:10,602 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 67 transitions, 374 flow [2024-11-22 21:27:10,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 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-22 21:27:10,603 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:10,603 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:27:10,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 21:27:10,604 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:10,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:10,604 INFO L85 PathProgramCache]: Analyzing trace with hash -233542598, now seen corresponding path program 1 times [2024-11-22 21:27:10,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:27:10,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571046989] [2024-11-22 21:27:10,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:27:10,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:27:10,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:27:10,897 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-22 21:27:10,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:27:10,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571046989] [2024-11-22 21:27:10,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571046989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:10,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:10,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:27:10,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526354603] [2024-11-22 21:27:10,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:10,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:27:10,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:27:10,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:27:10,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:27:10,908 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-11-22 21:27:10,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 67 transitions, 374 flow. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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-22 21:27:10,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:10,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-11-22 21:27:10,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:13,604 INFO L124 PetriNetUnfolderBase]: 13253/22405 cut-off events. [2024-11-22 21:27:13,604 INFO L125 PetriNetUnfolderBase]: For 35508/39147 co-relation queries the response was YES. [2024-11-22 21:27:13,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63677 conditions, 22405 events. 13253/22405 cut-off events. For 35508/39147 co-relation queries the response was YES. Maximal size of possible extension queue 1244. Compared 185553 event pairs, 3212 based on Foata normal form. 559/21443 useless extension candidates. Maximal degree in co-relation 63651. Up to 9107 conditions per place. [2024-11-22 21:27:13,751 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 76 selfloop transitions, 22 changer transitions 52/181 dead transitions. [2024-11-22 21:27:13,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 181 transitions, 1131 flow [2024-11-22 21:27:13,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 21:27:13,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-22 21:27:13,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 362 transitions. [2024-11-22 21:27:13,753 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5983471074380166 [2024-11-22 21:27:13,753 INFO L175 Difference]: Start difference. First operand has 84 places, 67 transitions, 374 flow. Second operand 11 states and 362 transitions. [2024-11-22 21:27:13,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 181 transitions, 1131 flow [2024-11-22 21:27:13,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 181 transitions, 1100 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-11-22 21:27:13,921 INFO L231 Difference]: Finished difference. Result has 98 places, 81 transitions, 532 flow [2024-11-22 21:27:13,921 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=532, PETRI_PLACES=98, PETRI_TRANSITIONS=81} [2024-11-22 21:27:13,922 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 36 predicate places. [2024-11-22 21:27:13,922 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 81 transitions, 532 flow [2024-11-22 21:27:13,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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-22 21:27:13,922 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:13,923 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:27:13,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 21:27:13,923 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:13,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:13,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1184521752, now seen corresponding path program 2 times [2024-11-22 21:27:13,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:27:13,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923767516] [2024-11-22 21:27:13,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:27:13,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:27:13,947 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:27:13,947 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:27:14,169 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-22 21:27:14,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:27:14,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923767516] [2024-11-22 21:27:14,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923767516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:14,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:14,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 21:27:14,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754721763] [2024-11-22 21:27:14,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:14,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:27:14,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:27:14,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:27:14,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:27:14,182 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-11-22 21:27:14,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 81 transitions, 532 flow. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:14,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:14,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-11-22 21:27:14,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:17,540 INFO L124 PetriNetUnfolderBase]: 16821/28508 cut-off events. [2024-11-22 21:27:17,540 INFO L125 PetriNetUnfolderBase]: For 64076/67372 co-relation queries the response was YES. [2024-11-22 21:27:17,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90614 conditions, 28508 events. 16821/28508 cut-off events. For 64076/67372 co-relation queries the response was YES. Maximal size of possible extension queue 1779. Compared 251287 event pairs, 3912 based on Foata normal form. 679/26703 useless extension candidates. Maximal degree in co-relation 90581. Up to 8396 conditions per place. [2024-11-22 21:27:17,783 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 93 selfloop transitions, 22 changer transitions 22/168 dead transitions. [2024-11-22 21:27:17,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 168 transitions, 1286 flow [2024-11-22 21:27:17,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:27:17,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:27:17,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 289 transitions. [2024-11-22 21:27:17,785 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6568181818181819 [2024-11-22 21:27:17,785 INFO L175 Difference]: Start difference. First operand has 98 places, 81 transitions, 532 flow. Second operand 8 states and 289 transitions. [2024-11-22 21:27:17,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 168 transitions, 1286 flow [2024-11-22 21:27:17,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 168 transitions, 1240 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-11-22 21:27:17,971 INFO L231 Difference]: Finished difference. Result has 96 places, 87 transitions, 663 flow [2024-11-22 21:27:17,971 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=663, PETRI_PLACES=96, PETRI_TRANSITIONS=87} [2024-11-22 21:27:17,972 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 34 predicate places. [2024-11-22 21:27:17,972 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 87 transitions, 663 flow [2024-11-22 21:27:17,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:17,972 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:17,973 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:27:17,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 21:27:17,973 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:17,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:17,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1439864114, now seen corresponding path program 3 times [2024-11-22 21:27:17,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:27:17,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832111813] [2024-11-22 21:27:17,974 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 21:27:17,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:27:18,017 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-22 21:27:18,018 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:27:18,241 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-22 21:27:18,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:27:18,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832111813] [2024-11-22 21:27:18,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832111813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:18,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:18,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:27:18,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136916997] [2024-11-22 21:27:18,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:18,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:27:18,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:27:18,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:27:18,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:27:18,252 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-11-22 21:27:18,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 87 transitions, 663 flow. Second operand has 7 states, 7 states have (on average 26.857142857142858) internal successors, (188), 7 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:18,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:18,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-11-22 21:27:18,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:22,141 INFO L124 PetriNetUnfolderBase]: 20635/31145 cut-off events. [2024-11-22 21:27:22,141 INFO L125 PetriNetUnfolderBase]: For 71568/81426 co-relation queries the response was YES. [2024-11-22 21:27:22,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102770 conditions, 31145 events. 20635/31145 cut-off events. For 71568/81426 co-relation queries the response was YES. Maximal size of possible extension queue 1992. Compared 240818 event pairs, 1591 based on Foata normal form. 1463/31444 useless extension candidates. Maximal degree in co-relation 102735. Up to 11360 conditions per place. [2024-11-22 21:27:22,388 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 66 selfloop transitions, 18 changer transitions 9/137 dead transitions. [2024-11-22 21:27:22,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 137 transitions, 1043 flow [2024-11-22 21:27:22,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:27:22,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:27:22,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 252 transitions. [2024-11-22 21:27:22,390 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6545454545454545 [2024-11-22 21:27:22,390 INFO L175 Difference]: Start difference. First operand has 96 places, 87 transitions, 663 flow. Second operand 7 states and 252 transitions. [2024-11-22 21:27:22,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 137 transitions, 1043 flow [2024-11-22 21:27:22,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 137 transitions, 977 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-11-22 21:27:22,808 INFO L231 Difference]: Finished difference. Result has 95 places, 88 transitions, 664 flow [2024-11-22 21:27:22,808 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=664, PETRI_PLACES=95, PETRI_TRANSITIONS=88} [2024-11-22 21:27:22,808 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 33 predicate places. [2024-11-22 21:27:22,809 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 88 transitions, 664 flow [2024-11-22 21:27:22,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.857142857142858) internal successors, (188), 7 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:22,809 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:22,809 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:27:22,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 21:27:22,809 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:22,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:22,810 INFO L85 PathProgramCache]: Analyzing trace with hash 842144901, now seen corresponding path program 1 times [2024-11-22 21:27:22,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:27:22,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260385174] [2024-11-22 21:27:22,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:27:22,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:27:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:27:23,064 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-22 21:27:23,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:27:23,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260385174] [2024-11-22 21:27:23,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260385174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:23,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:23,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:27:23,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598930298] [2024-11-22 21:27:23,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:23,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:27:23,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:27:23,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:27:23,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:27:23,074 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2024-11-22 21:27:23,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 88 transitions, 664 flow. Second operand has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:23,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:23,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2024-11-22 21:27:23,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:26,678 INFO L124 PetriNetUnfolderBase]: 18328/33837 cut-off events. [2024-11-22 21:27:26,678 INFO L125 PetriNetUnfolderBase]: For 102607/109788 co-relation queries the response was YES. [2024-11-22 21:27:26,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110774 conditions, 33837 events. 18328/33837 cut-off events. For 102607/109788 co-relation queries the response was YES. Maximal size of possible extension queue 2544. Compared 343477 event pairs, 6260 based on Foata normal form. 1213/31110 useless extension candidates. Maximal degree in co-relation 110742. Up to 10367 conditions per place. [2024-11-22 21:27:26,981 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 46 selfloop transitions, 4 changer transitions 21/129 dead transitions. [2024-11-22 21:27:26,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 129 transitions, 979 flow [2024-11-22 21:27:26,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:27:26,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:27:26,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 210 transitions. [2024-11-22 21:27:26,983 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2024-11-22 21:27:26,983 INFO L175 Difference]: Start difference. First operand has 95 places, 88 transitions, 664 flow. Second operand 6 states and 210 transitions. [2024-11-22 21:27:26,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 129 transitions, 979 flow [2024-11-22 21:27:29,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 129 transitions, 912 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-11-22 21:27:29,068 INFO L231 Difference]: Finished difference. Result has 98 places, 88 transitions, 624 flow [2024-11-22 21:27:29,068 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=624, PETRI_PLACES=98, PETRI_TRANSITIONS=88} [2024-11-22 21:27:29,069 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 36 predicate places. [2024-11-22 21:27:29,069 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 88 transitions, 624 flow [2024-11-22 21:27:29,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:29,069 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:29,069 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:27:29,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 21:27:29,070 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:29,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:29,070 INFO L85 PathProgramCache]: Analyzing trace with hash 371678659, now seen corresponding path program 2 times [2024-11-22 21:27:29,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:27:29,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233851805] [2024-11-22 21:27:29,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:27:29,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:27:29,099 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:27:29,099 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:27:29,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:27:29,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:27:29,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233851805] [2024-11-22 21:27:29,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233851805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:29,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:29,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 21:27:29,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379082967] [2024-11-22 21:27:29,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:29,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:27:29,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:27:29,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:27:29,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:27:29,756 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2024-11-22 21:27:29,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 88 transitions, 624 flow. Second operand has 7 states, 7 states have (on average 29.428571428571427) internal successors, (206), 7 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:29,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:29,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2024-11-22 21:27:29,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:35,218 INFO L124 PetriNetUnfolderBase]: 27067/52367 cut-off events. [2024-11-22 21:27:35,219 INFO L125 PetriNetUnfolderBase]: For 75506/79822 co-relation queries the response was YES. [2024-11-22 21:27:35,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148543 conditions, 52367 events. 27067/52367 cut-off events. For 75506/79822 co-relation queries the response was YES. Maximal size of possible extension queue 4609. Compared 603820 event pairs, 8588 based on Foata normal form. 664/47044 useless extension candidates. Maximal degree in co-relation 148510. Up to 14443 conditions per place. [2024-11-22 21:27:35,772 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 36 selfloop transitions, 10 changer transitions 18/128 dead transitions. [2024-11-22 21:27:35,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 128 transitions, 910 flow [2024-11-22 21:27:35,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:27:35,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:27:35,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 273 transitions. [2024-11-22 21:27:35,774 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6204545454545455 [2024-11-22 21:27:35,774 INFO L175 Difference]: Start difference. First operand has 98 places, 88 transitions, 624 flow. Second operand 8 states and 273 transitions. [2024-11-22 21:27:35,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 128 transitions, 910 flow [2024-11-22 21:27:39,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 128 transitions, 903 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-22 21:27:39,429 INFO L231 Difference]: Finished difference. Result has 106 places, 96 transitions, 724 flow [2024-11-22 21:27:39,429 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=724, PETRI_PLACES=106, PETRI_TRANSITIONS=96} [2024-11-22 21:27:39,429 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 44 predicate places. [2024-11-22 21:27:39,430 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 96 transitions, 724 flow [2024-11-22 21:27:39,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.428571428571427) internal successors, (206), 7 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:39,430 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:39,430 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:27:39,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 21:27:39,431 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:39,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:39,431 INFO L85 PathProgramCache]: Analyzing trace with hash -868799515, now seen corresponding path program 3 times [2024-11-22 21:27:39,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:27:39,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243438531] [2024-11-22 21:27:39,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 21:27:39,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:27:39,492 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-22 21:27:39,492 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-22 21:27:39,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 21:27:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 21:27:39,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 21:27:39,607 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 21:27:39,608 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-22 21:27:39,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-22 21:27:39,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-22 21:27:39,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-22 21:27:39,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-22 21:27:39,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-22 21:27:39,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-22 21:27:39,612 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-22 21:27:39,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 21:27:39,613 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:27:39,730 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-22 21:27:39,730 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 21:27:39,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:27:39 BasicIcfg [2024-11-22 21:27:39,738 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 21:27:39,739 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 21:27:39,739 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 21:27:39,739 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 21:27:39,740 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:26:59" (3/4) ... [2024-11-22 21:27:39,741 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 21:27:39,743 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 21:27:39,743 INFO L158 Benchmark]: Toolchain (without parser) took 42063.44ms. Allocated memory was 157.3MB in the beginning and 13.4GB in the end (delta: 13.2GB). Free memory was 108.4MB in the beginning and 11.3GB in the end (delta: -11.2GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2024-11-22 21:27:39,743 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 157.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:27:39,744 INFO L158 Benchmark]: CACSL2BoogieTranslator took 586.66ms. Allocated memory is still 157.3MB. Free memory was 108.4MB in the beginning and 82.8MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-22 21:27:39,744 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.62ms. Allocated memory is still 157.3MB. Free memory was 82.4MB in the beginning and 79.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 21:27:39,744 INFO L158 Benchmark]: Boogie Preprocessor took 55.28ms. Allocated memory is still 157.3MB. Free memory was 79.9MB in the beginning and 76.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 21:27:39,745 INFO L158 Benchmark]: RCFGBuilder took 837.79ms. Allocated memory was 157.3MB in the beginning and 203.4MB in the end (delta: 46.1MB). Free memory was 76.6MB in the beginning and 138.2MB in the end (delta: -61.7MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2024-11-22 21:27:39,746 INFO L158 Benchmark]: TraceAbstraction took 40517.22ms. Allocated memory was 203.4MB in the beginning and 13.4GB in the end (delta: 13.2GB). Free memory was 137.2MB in the beginning and 11.3GB in the end (delta: -11.2GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2024-11-22 21:27:39,746 INFO L158 Benchmark]: Witness Printer took 3.76ms. Allocated memory is still 13.4GB. Free memory is still 11.3GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:27:39,747 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 157.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 586.66ms. Allocated memory is still 157.3MB. Free memory was 108.4MB in the beginning and 82.8MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.62ms. Allocated memory is still 157.3MB. Free memory was 82.4MB in the beginning and 79.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.28ms. Allocated memory is still 157.3MB. Free memory was 79.9MB in the beginning and 76.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 837.79ms. Allocated memory was 157.3MB in the beginning and 203.4MB in the end (delta: 46.1MB). Free memory was 76.6MB in the beginning and 138.2MB in the end (delta: -61.7MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. * TraceAbstraction took 40517.22ms. Allocated memory was 203.4MB in the beginning and 13.4GB in the end (delta: 13.2GB). Free memory was 137.2MB in the beginning and 11.3GB in the end (delta: -11.2GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. * Witness Printer took 3.76ms. Allocated memory is still 13.4GB. Free memory is still 11.3GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1029; [L857] FCALL, FORK 0 pthread_create(&t1029, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1029=-4, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L858] 0 pthread_t t1030; [L859] FCALL, FORK 0 pthread_create(&t1030, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1029=-4, t1030=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t1031; [L861] FCALL, FORK 0 pthread_create(&t1031, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1029=-4, t1030=-3, t1031=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L862] 0 pthread_t t1032; [L863] FCALL, FORK 0 pthread_create(&t1032, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1029=-4, t1030=-3, t1031=-2, t1032=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L825] 4 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L828] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L831] 4 __unbuffered_p3_EBX = b VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 b = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L834] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L835] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L836] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L837] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L838] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1029=-4, t1030=-3, t1031=-2, t1032=-1, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1029=-4, t1030=-3, t1031=-2, t1032=-1, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L876] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1029=-4, t1030=-3, t1031=-2, t1032=-1, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix039.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=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: 854]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 857]: 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: 863]: 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: 861]: 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: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 89 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 40.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 36.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 733 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 707 mSDsluCounter, 192 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 150 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1855 IncrementalHoareTripleChecker+Invalid, 1900 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 42 mSDtfsCounter, 1855 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=724occurred in iteration=13, InterpolantAutomatonStates: 84, 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.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 388 NumberOfCodeBlocks, 388 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 336 ConstructedInterpolants, 0 QuantifiedInterpolants, 1550 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-22 21:27:39,771 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/current/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/mix039.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 4df22382a468f75ea1bc6624bacd8789c0b9b9f8aa1bc2866cf2715dcbc507bc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 21:27:42,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:27:42,737 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-22 21:27:42,742 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:27:42,743 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:27:42,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:27:42,773 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:27:42,773 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:27:42,774 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:27:42,775 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:27:42,776 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:27:42,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:27:42,777 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:27:42,777 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:27:42,779 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:27:42,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:27:42,780 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:27:42,780 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:27:42,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:27:42,784 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:27:42,784 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:27:42,784 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:27:42,785 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:27:42,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:27:42,786 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:27:42,786 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 21:27:42,786 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:27:42,787 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 21:27:42,787 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:27:42,787 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:27:42,788 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:27:42,788 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:27:42,789 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:27:42,789 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:27:42,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:27:42,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:27:42,790 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:27:42,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:27:42,791 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 21:27:42,791 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 21:27:42,791 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:27:42,792 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:27:42,792 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:27:42,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:27:42,792 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 -> 4df22382a468f75ea1bc6624bacd8789c0b9b9f8aa1bc2866cf2715dcbc507bc [2024-11-22 21:27:43,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:27:43,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:27:43,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:27:43,174 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:27:43,174 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:27:43,176 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix039.opt.i [2024-11-22 21:27:44,685 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:27:44,977 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:27:44,980 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix039.opt.i [2024-11-22 21:27:45,003 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d40fbe030/2444a08c5b3548ffa0780261643c31b4/FLAG0a46bbd07 [2024-11-22 21:27:45,026 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d40fbe030/2444a08c5b3548ffa0780261643c31b4 [2024-11-22 21:27:45,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:27:45,030 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:27:45,031 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:27:45,031 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:27:45,038 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:27:45,038 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:27:45" (1/1) ... [2024-11-22 21:27:45,039 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14cc6510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:45, skipping insertion in model container [2024-11-22 21:27:45,039 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:27:45" (1/1) ... [2024-11-22 21:27:45,090 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:27:45,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:27:45,527 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 21:27:45,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:27:45,669 INFO L204 MainTranslator]: Completed translation [2024-11-22 21:27:45,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:45 WrapperNode [2024-11-22 21:27:45,670 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:27:45,671 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 21:27:45,671 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 21:27:45,671 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 21:27:45,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:45" (1/1) ... [2024-11-22 21:27:45,706 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:45" (1/1) ... [2024-11-22 21:27:45,736 INFO L138 Inliner]: procedures = 177, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 140 [2024-11-22 21:27:45,739 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 21:27:45,740 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 21:27:45,740 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 21:27:45,740 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 21:27:45,751 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:45" (1/1) ... [2024-11-22 21:27:45,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:45" (1/1) ... [2024-11-22 21:27:45,757 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:45" (1/1) ... [2024-11-22 21:27:45,792 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-22 21:27:45,793 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:45" (1/1) ... [2024-11-22 21:27:45,793 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:45" (1/1) ... [2024-11-22 21:27:45,805 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:45" (1/1) ... [2024-11-22 21:27:45,811 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:45" (1/1) ... [2024-11-22 21:27:45,819 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:45" (1/1) ... [2024-11-22 21:27:45,821 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:45" (1/1) ... [2024-11-22 21:27:45,828 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 21:27:45,833 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 21:27:45,833 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 21:27:45,833 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 21:27:45,834 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:45" (1/1) ... [2024-11-22 21:27:45,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:27:45,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:27:45,871 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-22 21:27:45,878 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-22 21:27:45,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-22 21:27:45,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 21:27:45,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 21:27:45,929 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-22 21:27:45,929 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-22 21:27:45,929 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-22 21:27:45,929 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-22 21:27:45,929 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-22 21:27:45,929 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-22 21:27:45,931 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-22 21:27:45,931 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-22 21:27:45,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-22 21:27:45,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 21:27:45,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 21:27:45,933 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 21:27:46,126 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 21:27:46,128 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 21:27:46,489 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 21:27:46,490 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 21:27:46,746 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 21:27:46,747 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-22 21:27:46,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:27:46 BoogieIcfgContainer [2024-11-22 21:27:46,747 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 21:27:46,749 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 21:27:46,749 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 21:27:46,753 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 21:27:46,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:27:45" (1/3) ... [2024-11-22 21:27:46,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@313ac4e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:27:46, skipping insertion in model container [2024-11-22 21:27:46,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:27:45" (2/3) ... [2024-11-22 21:27:46,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@313ac4e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:27:46, skipping insertion in model container [2024-11-22 21:27:46,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:27:46" (3/3) ... [2024-11-22 21:27:46,758 INFO L112 eAbstractionObserver]: Analyzing ICFG mix039.opt.i [2024-11-22 21:27:46,775 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 21:27:46,775 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-22 21:27:46,775 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 21:27:46,846 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-22 21:27:46,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 126 flow [2024-11-22 21:27:46,922 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2024-11-22 21:27:46,922 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:27:46,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 106 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2024-11-22 21:27:46,927 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 126 flow [2024-11-22 21:27:46,932 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 114 flow [2024-11-22 21:27:46,943 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:27:46,951 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;@58d91974, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:27:46,951 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-22 21:27:46,962 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 21:27:46,962 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-11-22 21:27:46,962 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:27:46,962 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:46,963 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:27:46,964 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:46,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:46,969 INFO L85 PathProgramCache]: Analyzing trace with hash -747556111, now seen corresponding path program 1 times [2024-11-22 21:27:46,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:27:46,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175800040] [2024-11-22 21:27:46,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:27:46,985 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-22 21:27:46,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:27:46,988 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-22 21:27:46,989 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-22 21:27:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:27:47,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 21:27:47,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:27:47,187 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-22 21:27:47,188 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:27:47,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:27:47,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175800040] [2024-11-22 21:27:47,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175800040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:47,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:47,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:27:47,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753376340] [2024-11-22 21:27:47,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:47,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:27:47,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:27:47,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:27:47,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:27:47,230 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2024-11-22 21:27:47,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:47,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:47,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2024-11-22 21:27:47,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:47,678 INFO L124 PetriNetUnfolderBase]: 931/1851 cut-off events. [2024-11-22 21:27:47,679 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:27:47,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3247 conditions, 1851 events. 931/1851 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 14072 event pairs, 199 based on Foata normal form. 96/1918 useless extension candidates. Maximal degree in co-relation 3235. Up to 1021 conditions per place. [2024-11-22 21:27:47,698 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 29 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2024-11-22 21:27:47,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 58 transitions, 194 flow [2024-11-22 21:27:47,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:27:47,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:27:47,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2024-11-22 21:27:47,711 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7575757575757576 [2024-11-22 21:27:47,713 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 125 transitions. [2024-11-22 21:27:47,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 58 transitions, 194 flow [2024-11-22 21:27:47,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 58 transitions, 190 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-22 21:27:47,720 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2024-11-22 21:27:47,722 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-11-22 21:27:47,727 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2024-11-22 21:27:47,727 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2024-11-22 21:27:47,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:47,728 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:47,728 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:27:47,732 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-22 21:27:47,928 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-22 21:27:47,929 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:47,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:47,930 INFO L85 PathProgramCache]: Analyzing trace with hash 798924591, now seen corresponding path program 1 times [2024-11-22 21:27:47,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:27:47,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212130619] [2024-11-22 21:27:47,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:27:47,931 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-22 21:27:47,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:27:47,934 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-22 21:27:47,935 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-22 21:27:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:27:48,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 21:27:48,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:27:48,087 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-22 21:27:48,088 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:27:48,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:27:48,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212130619] [2024-11-22 21:27:48,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1212130619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:48,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:48,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:27:48,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054707891] [2024-11-22 21:27:48,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:48,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:27:48,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:27:48,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:27:48,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:27:48,107 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-11-22 21:27:48,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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-22 21:27:48,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:48,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-11-22 21:27:48,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:49,116 INFO L124 PetriNetUnfolderBase]: 4352/6922 cut-off events. [2024-11-22 21:27:49,116 INFO L125 PetriNetUnfolderBase]: For 312/312 co-relation queries the response was YES. [2024-11-22 21:27:49,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13369 conditions, 6922 events. 4352/6922 cut-off events. For 312/312 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 49460 event pairs, 536 based on Foata normal form. 180/7086 useless extension candidates. Maximal degree in co-relation 13359. Up to 4015 conditions per place. [2024-11-22 21:27:49,179 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 45 selfloop transitions, 6 changer transitions 1/72 dead transitions. [2024-11-22 21:27:49,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 72 transitions, 270 flow [2024-11-22 21:27:49,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:27:49,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:27:49,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2024-11-22 21:27:49,181 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2024-11-22 21:27:49,181 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 4 states and 150 transitions. [2024-11-22 21:27:49,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 72 transitions, 270 flow [2024-11-22 21:27:49,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 72 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:27:49,185 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 142 flow [2024-11-22 21:27:49,185 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2024-11-22 21:27:49,186 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -2 predicate places. [2024-11-22 21:27:49,186 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 142 flow [2024-11-22 21:27:49,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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-22 21:27:49,187 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:49,187 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:27:49,194 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-22 21:27:49,390 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-22 21:27:49,391 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:49,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:49,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1064914558, now seen corresponding path program 1 times [2024-11-22 21:27:49,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:27:49,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [9358022] [2024-11-22 21:27:49,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:27:49,393 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-22 21:27:49,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:27:49,396 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-22 21:27:49,397 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-22 21:27:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:27:49,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 21:27:49,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:27:49,567 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-22 21:27:49,567 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:27:49,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:27:49,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [9358022] [2024-11-22 21:27:49,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [9358022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:49,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:49,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:27:49,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825356808] [2024-11-22 21:27:49,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:49,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:27:49,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:27:49,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:27:49,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:27:49,581 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-11-22 21:27:49,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-22 21:27:49,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:49,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-11-22 21:27:49,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:50,422 INFO L124 PetriNetUnfolderBase]: 3648/5838 cut-off events. [2024-11-22 21:27:50,423 INFO L125 PetriNetUnfolderBase]: For 1511/1511 co-relation queries the response was YES. [2024-11-22 21:27:50,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13101 conditions, 5838 events. 3648/5838 cut-off events. For 1511/1511 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 40441 event pairs, 192 based on Foata normal form. 174/5998 useless extension candidates. Maximal degree in co-relation 13089. Up to 3097 conditions per place. [2024-11-22 21:27:50,479 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 57 selfloop transitions, 10 changer transitions 1/88 dead transitions. [2024-11-22 21:27:50,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 88 transitions, 383 flow [2024-11-22 21:27:50,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:27:50,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:27:50,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 190 transitions. [2024-11-22 21:27:50,482 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6909090909090909 [2024-11-22 21:27:50,482 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 142 flow. Second operand 5 states and 190 transitions. [2024-11-22 21:27:50,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 88 transitions, 383 flow [2024-11-22 21:27:50,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 88 transitions, 372 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-22 21:27:50,487 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 194 flow [2024-11-22 21:27:50,487 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2024-11-22 21:27:50,488 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2024-11-22 21:27:50,488 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 194 flow [2024-11-22 21:27:50,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-22 21:27:50,488 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:50,488 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:27:50,492 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-22 21:27:50,689 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-22 21:27:50,690 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:50,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:50,690 INFO L85 PathProgramCache]: Analyzing trace with hash 996643733, now seen corresponding path program 1 times [2024-11-22 21:27:50,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:27:50,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1171673538] [2024-11-22 21:27:50,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:27:50,692 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-22 21:27:50,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:27:50,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-22 21:27:50,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-22 21:27:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:27:50,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 21:27:50,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:27:50,960 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-22 21:27:50,961 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:27:50,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:27:50,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1171673538] [2024-11-22 21:27:50,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1171673538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:50,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:50,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:27:50,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979654140] [2024-11-22 21:27:50,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:50,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:27:50,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:27:50,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:27:50,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:27:50,992 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-11-22 21:27:50,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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-22 21:27:50,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:50,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-11-22 21:27:50,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:51,601 INFO L124 PetriNetUnfolderBase]: 2373/3781 cut-off events. [2024-11-22 21:27:51,601 INFO L125 PetriNetUnfolderBase]: For 2868/2868 co-relation queries the response was YES. [2024-11-22 21:27:51,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9591 conditions, 3781 events. 2373/3781 cut-off events. For 2868/2868 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 22814 event pairs, 69 based on Foata normal form. 140/3907 useless extension candidates. Maximal degree in co-relation 9577. Up to 1465 conditions per place. [2024-11-22 21:27:51,632 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 67 selfloop transitions, 14 changer transitions 1/102 dead transitions. [2024-11-22 21:27:51,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 102 transitions, 502 flow [2024-11-22 21:27:51,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:27:51,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:27:51,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 228 transitions. [2024-11-22 21:27:51,634 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6909090909090909 [2024-11-22 21:27:51,635 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 194 flow. Second operand 6 states and 228 transitions. [2024-11-22 21:27:51,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 102 transitions, 502 flow [2024-11-22 21:27:51,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 102 transitions, 472 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-22 21:27:51,646 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 244 flow [2024-11-22 21:27:51,646 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=244, PETRI_PLACES=67, PETRI_TRANSITIONS=58} [2024-11-22 21:27:51,648 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2024-11-22 21:27:51,648 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 244 flow [2024-11-22 21:27:51,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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-22 21:27:51,649 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:51,649 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:27:51,655 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-22 21:27:51,849 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-22 21:27:51,850 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:51,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:51,851 INFO L85 PathProgramCache]: Analyzing trace with hash 375540980, now seen corresponding path program 1 times [2024-11-22 21:27:51,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:27:51,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2135252660] [2024-11-22 21:27:51,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:27:51,852 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-22 21:27:51,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:27:51,854 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-22 21:27:51,855 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-22 21:27:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:27:51,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 21:27:51,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:27:52,043 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-22 21:27:52,044 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:27:52,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:27:52,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2135252660] [2024-11-22 21:27:52,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2135252660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:52,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:52,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:27:52,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385483410] [2024-11-22 21:27:52,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:52,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:27:52,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:27:52,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:27:52,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:27:52,056 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-11-22 21:27:52,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 244 flow. Second operand has 7 states, 7 states have (on average 26.571428571428573) internal successors, (186), 7 states have internal predecessors, (186), 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-22 21:27:52,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:52,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-11-22 21:27:52,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:52,597 INFO L124 PetriNetUnfolderBase]: 1385/2109 cut-off events. [2024-11-22 21:27:52,598 INFO L125 PetriNetUnfolderBase]: For 3118/3118 co-relation queries the response was YES. [2024-11-22 21:27:52,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6168 conditions, 2109 events. 1385/2109 cut-off events. For 3118/3118 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 10271 event pairs, 39 based on Foata normal form. 72/2167 useless extension candidates. Maximal degree in co-relation 6153. Up to 668 conditions per place. [2024-11-22 21:27:52,618 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 61 selfloop transitions, 18 changer transitions 1/100 dead transitions. [2024-11-22 21:27:52,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 100 transitions, 504 flow [2024-11-22 21:27:52,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:27:52,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:27:52,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 250 transitions. [2024-11-22 21:27:52,620 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6493506493506493 [2024-11-22 21:27:52,620 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 244 flow. Second operand 7 states and 250 transitions. [2024-11-22 21:27:52,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 100 transitions, 504 flow [2024-11-22 21:27:52,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 100 transitions, 458 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-22 21:27:52,634 INFO L231 Difference]: Finished difference. Result has 70 places, 58 transitions, 254 flow [2024-11-22 21:27:52,634 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=254, PETRI_PLACES=70, PETRI_TRANSITIONS=58} [2024-11-22 21:27:52,635 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2024-11-22 21:27:52,635 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 58 transitions, 254 flow [2024-11-22 21:27:52,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.571428571428573) internal successors, (186), 7 states have internal predecessors, (186), 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-22 21:27:52,636 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:52,637 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:27:52,645 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-22 21:27:52,837 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-22 21:27:52,838 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:52,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:52,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1153057684, now seen corresponding path program 1 times [2024-11-22 21:27:52,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:27:52,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [36621599] [2024-11-22 21:27:52,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:27:52,839 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-22 21:27:52,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:27:52,842 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-22 21:27:52,844 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-22 21:27:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:27:52,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 21:27:52,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:27:53,005 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-22 21:27:53,005 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:27:53,006 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:27:53,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [36621599] [2024-11-22 21:27:53,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [36621599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:53,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:53,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:27:53,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134268332] [2024-11-22 21:27:53,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:53,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:27:53,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:27:53,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:27:53,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:27:53,008 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2024-11-22 21:27:53,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 58 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:53,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:53,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2024-11-22 21:27:53,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:53,143 INFO L124 PetriNetUnfolderBase]: 591/1141 cut-off events. [2024-11-22 21:27:53,143 INFO L125 PetriNetUnfolderBase]: For 483/508 co-relation queries the response was YES. [2024-11-22 21:27:53,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2489 conditions, 1141 events. 591/1141 cut-off events. For 483/508 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6571 event pairs, 552 based on Foata normal form. 16/1017 useless extension candidates. Maximal degree in co-relation 2473. Up to 871 conditions per place. [2024-11-22 21:27:53,155 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 19 selfloop transitions, 1 changer transitions 1/57 dead transitions. [2024-11-22 21:27:53,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 57 transitions, 294 flow [2024-11-22 21:27:53,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:27:53,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:27:53,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-11-22 21:27:53,157 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2024-11-22 21:27:53,157 INFO L175 Difference]: Start difference. First operand has 70 places, 58 transitions, 254 flow. Second operand 3 states and 106 transitions. [2024-11-22 21:27:53,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 57 transitions, 294 flow [2024-11-22 21:27:53,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 57 transitions, 198 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-11-22 21:27:53,160 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 156 flow [2024-11-22 21:27:53,160 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2024-11-22 21:27:53,161 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2024-11-22 21:27:53,161 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 156 flow [2024-11-22 21:27:53,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:27:53,161 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:53,161 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:27:53,167 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-22 21:27:53,362 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-22 21:27:53,362 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:53,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:53,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1776327335, now seen corresponding path program 1 times [2024-11-22 21:27:53,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:27:53,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1506681036] [2024-11-22 21:27:53,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:27:53,364 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-22 21:27:53,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:27:53,369 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-22 21:27:53,371 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-22 21:27:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:27:53,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 21:27:53,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:27:53,528 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-22 21:27:53,528 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:27:53,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:27:53,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1506681036] [2024-11-22 21:27:53,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1506681036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:53,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:53,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:27:53,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40668867] [2024-11-22 21:27:53,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:53,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:27:53,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:27:53,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:27:53,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:27:53,543 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2024-11-22 21:27:53,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 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-22 21:27:53,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:53,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2024-11-22 21:27:53,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:53,882 INFO L124 PetriNetUnfolderBase]: 1614/2795 cut-off events. [2024-11-22 21:27:53,883 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:27:53,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5514 conditions, 2795 events. 1614/2795 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 16976 event pairs, 667 based on Foata normal form. 16/2555 useless extension candidates. Maximal degree in co-relation 5507. Up to 1165 conditions per place. [2024-11-22 21:27:53,895 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 32 selfloop transitions, 2 changer transitions 14/81 dead transitions. [2024-11-22 21:27:53,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 81 transitions, 306 flow [2024-11-22 21:27:53,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:27:53,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:27:53,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 179 transitions. [2024-11-22 21:27:53,897 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6509090909090909 [2024-11-22 21:27:53,897 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 156 flow. Second operand 5 states and 179 transitions. [2024-11-22 21:27:53,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 81 transitions, 306 flow [2024-11-22 21:27:53,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 81 transitions, 305 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:27:53,899 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 171 flow [2024-11-22 21:27:53,899 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2024-11-22 21:27:53,900 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2024-11-22 21:27:53,900 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 171 flow [2024-11-22 21:27:53,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 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-22 21:27:53,900 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:53,901 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:27:53,905 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-22 21:27:54,101 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-22 21:27:54,102 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:54,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:54,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1155778479, now seen corresponding path program 2 times [2024-11-22 21:27:54,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:27:54,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1831623106] [2024-11-22 21:27:54,103 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:27:54,103 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-22 21:27:54,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:27:54,106 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:27:54,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-22 21:27:54,202 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:27:54,203 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:27:54,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 21:27:54,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:27:54,433 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-22 21:27:54,433 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:27:54,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:27:54,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1831623106] [2024-11-22 21:27:54,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1831623106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:54,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:54,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 21:27:54,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018613703] [2024-11-22 21:27:54,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:54,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 21:27:54,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:27:54,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 21:27:54,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-22 21:27:54,446 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2024-11-22 21:27:54,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 171 flow. Second operand has 8 states, 8 states have (on average 30.125) internal successors, (241), 8 states have internal predecessors, (241), 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-22 21:27:54,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:54,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2024-11-22 21:27:54,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:54,862 INFO L124 PetriNetUnfolderBase]: 1650/3125 cut-off events. [2024-11-22 21:27:54,863 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-22 21:27:54,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6009 conditions, 3125 events. 1650/3125 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 21465 event pairs, 437 based on Foata normal form. 16/2856 useless extension candidates. Maximal degree in co-relation 5999. Up to 639 conditions per place. [2024-11-22 21:27:54,882 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 32 selfloop transitions, 5 changer transitions 16/89 dead transitions. [2024-11-22 21:27:54,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 89 transitions, 345 flow [2024-11-22 21:27:54,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 21:27:54,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-22 21:27:54,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 306 transitions. [2024-11-22 21:27:54,884 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2024-11-22 21:27:54,884 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 171 flow. Second operand 9 states and 306 transitions. [2024-11-22 21:27:54,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 89 transitions, 345 flow [2024-11-22 21:27:54,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 89 transitions, 337 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-22 21:27:54,888 INFO L231 Difference]: Finished difference. Result has 73 places, 58 transitions, 188 flow [2024-11-22 21:27:54,888 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=188, PETRI_PLACES=73, PETRI_TRANSITIONS=58} [2024-11-22 21:27:54,889 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 11 predicate places. [2024-11-22 21:27:54,889 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 58 transitions, 188 flow [2024-11-22 21:27:54,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.125) internal successors, (241), 8 states have internal predecessors, (241), 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-22 21:27:54,890 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:54,890 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:27:54,897 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 (9)] Forceful destruction successful, exit code 0 [2024-11-22 21:27:55,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:27:55,091 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:55,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:55,091 INFO L85 PathProgramCache]: Analyzing trace with hash 76934133, now seen corresponding path program 3 times [2024-11-22 21:27:55,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:27:55,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1898214431] [2024-11-22 21:27:55,092 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 21:27:55,092 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-22 21:27:55,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:27:55,095 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:27:55,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-22 21:27:55,213 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-22 21:27:55,213 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:27:55,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 21:27:55,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:27:55,284 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-22 21:27:55,284 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:27:55,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:27:55,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1898214431] [2024-11-22 21:27:55,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1898214431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:55,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:55,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:27:55,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844571250] [2024-11-22 21:27:55,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:55,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:27:55,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:27:55,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:27:55,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:27:55,301 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2024-11-22 21:27:55,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 58 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 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-22 21:27:55,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:55,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2024-11-22 21:27:55,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:56,139 INFO L124 PetriNetUnfolderBase]: 4257/7492 cut-off events. [2024-11-22 21:27:56,139 INFO L125 PetriNetUnfolderBase]: For 1107/1107 co-relation queries the response was YES. [2024-11-22 21:27:56,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15759 conditions, 7492 events. 4257/7492 cut-off events. For 1107/1107 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 55904 event pairs, 1400 based on Foata normal form. 16/6844 useless extension candidates. Maximal degree in co-relation 15746. Up to 2623 conditions per place. [2024-11-22 21:27:56,187 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 34 selfloop transitions, 1 changer transitions 27/96 dead transitions. [2024-11-22 21:27:56,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 96 transitions, 425 flow [2024-11-22 21:27:56,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:27:56,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:27:56,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 216 transitions. [2024-11-22 21:27:56,189 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6545454545454545 [2024-11-22 21:27:56,189 INFO L175 Difference]: Start difference. First operand has 73 places, 58 transitions, 188 flow. Second operand 6 states and 216 transitions. [2024-11-22 21:27:56,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 96 transitions, 425 flow [2024-11-22 21:27:56,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 96 transitions, 402 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-11-22 21:27:56,194 INFO L231 Difference]: Finished difference. Result has 73 places, 58 transitions, 187 flow [2024-11-22 21:27:56,194 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=73, PETRI_TRANSITIONS=58} [2024-11-22 21:27:56,200 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 11 predicate places. [2024-11-22 21:27:56,200 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 58 transitions, 187 flow [2024-11-22 21:27:56,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 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-22 21:27:56,200 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:56,200 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:27:56,205 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 (10)] Forceful destruction successful, exit code 0 [2024-11-22 21:27:56,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:27:56,401 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:56,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:56,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1538596059, now seen corresponding path program 4 times [2024-11-22 21:27:56,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:27:56,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1286003460] [2024-11-22 21:27:56,402 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 21:27:56,403 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-22 21:27:56,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:27:56,406 INFO L229 MonitoredProcess]: Starting monitored process 11 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-22 21:27:56,407 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 (11)] Waiting until timeout for monitored process [2024-11-22 21:27:56,503 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 21:27:56,504 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:27:56,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 21:27:56,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:27:56,596 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-22 21:27:56,598 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:27:56,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:27:56,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1286003460] [2024-11-22 21:27:56,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1286003460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:27:56,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:27:56,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:27:56,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335855947] [2024-11-22 21:27:56,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:27:56,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:27:56,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:27:56,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:27:56,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:27:56,611 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2024-11-22 21:27:56,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 58 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 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-22 21:27:56,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:27:56,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2024-11-22 21:27:56,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:27:57,309 INFO L124 PetriNetUnfolderBase]: 4070/7311 cut-off events. [2024-11-22 21:27:57,309 INFO L125 PetriNetUnfolderBase]: For 469/477 co-relation queries the response was YES. [2024-11-22 21:27:57,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15237 conditions, 7311 events. 4070/7311 cut-off events. For 469/477 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 56391 event pairs, 1388 based on Foata normal form. 18/6632 useless extension candidates. Maximal degree in co-relation 15224. Up to 2853 conditions per place. [2024-11-22 21:27:57,337 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 28 selfloop transitions, 1 changer transitions 30/93 dead transitions. [2024-11-22 21:27:57,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 93 transitions, 403 flow [2024-11-22 21:27:57,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:27:57,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:27:57,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions. [2024-11-22 21:27:57,339 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6454545454545455 [2024-11-22 21:27:57,339 INFO L175 Difference]: Start difference. First operand has 73 places, 58 transitions, 187 flow. Second operand 6 states and 213 transitions. [2024-11-22 21:27:57,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 93 transitions, 403 flow [2024-11-22 21:27:57,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 93 transitions, 392 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-22 21:27:57,343 INFO L231 Difference]: Finished difference. Result has 75 places, 57 transitions, 186 flow [2024-11-22 21:27:57,346 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=75, PETRI_TRANSITIONS=57} [2024-11-22 21:27:57,347 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 13 predicate places. [2024-11-22 21:27:57,347 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 57 transitions, 186 flow [2024-11-22 21:27:57,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 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-22 21:27:57,347 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:27:57,347 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:27:57,354 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 (11)] Ended with exit code 0 [2024-11-22 21:27:57,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-22 21:27:57,548 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-22 21:27:57,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:27:57,549 INFO L85 PathProgramCache]: Analyzing trace with hash -408200803, now seen corresponding path program 5 times [2024-11-22 21:27:57,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:27:57,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927256865] [2024-11-22 21:27:57,549 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 21:27:57,549 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-22 21:27:57,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:27:57,550 INFO L229 MonitoredProcess]: Starting monitored process 12 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-22 21:27:57,551 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 (12)] Waiting until timeout for monitored process [2024-11-22 21:27:57,641 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:27:57,642 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-22 21:27:57,642 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 21:27:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 21:27:57,759 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-22 21:27:57,759 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 21:27:57,761 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-22 21:27:57,764 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-22 21:27:57,764 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-22 21:27:57,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-22 21:27:57,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-22 21:27:57,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-22 21:27:57,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-22 21:27:57,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-22 21:27:57,771 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 (12)] Ended with exit code 0 [2024-11-22 21:27:57,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-22 21:27:57,966 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2024-11-22 21:27:58,076 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-22 21:27:58,076 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 21:27:58,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:27:58 BasicIcfg [2024-11-22 21:27:58,083 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 21:27:58,086 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 21:27:58,086 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 21:27:58,086 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 21:27:58,086 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:27:46" (3/4) ... [2024-11-22 21:27:58,088 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 21:27:58,089 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 21:27:58,090 INFO L158 Benchmark]: Toolchain (without parser) took 13060.07ms. Allocated memory was 60.8MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 41.8MB in the beginning and 806.3MB in the end (delta: -764.6MB). Peak memory consumption was 238.6MB. Max. memory is 16.1GB. [2024-11-22 21:27:58,090 INFO L158 Benchmark]: CDTParser took 1.14ms. Allocated memory is still 50.3MB. Free memory is still 33.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:27:58,090 INFO L158 Benchmark]: CACSL2BoogieTranslator took 638.64ms. Allocated memory is still 60.8MB. Free memory was 41.5MB in the beginning and 32.2MB in the end (delta: 9.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-22 21:27:58,090 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.66ms. Allocated memory is still 60.8MB. Free memory was 32.2MB in the beginning and 29.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 21:27:58,091 INFO L158 Benchmark]: Boogie Preprocessor took 92.23ms. Allocated memory is still 60.8MB. Free memory was 29.4MB in the beginning and 26.2MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 21:27:58,091 INFO L158 Benchmark]: RCFGBuilder took 914.60ms. Allocated memory was 60.8MB in the beginning and 79.7MB in the end (delta: 18.9MB). Free memory was 25.9MB in the beginning and 39.3MB in the end (delta: -13.3MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2024-11-22 21:27:58,091 INFO L158 Benchmark]: TraceAbstraction took 11333.37ms. Allocated memory was 79.7MB in the beginning and 1.1GB in the end (delta: 985.7MB). Free memory was 38.2MB in the beginning and 807.4MB in the end (delta: -769.2MB). Peak memory consumption was 217.1MB. Max. memory is 16.1GB. [2024-11-22 21:27:58,093 INFO L158 Benchmark]: Witness Printer took 3.63ms. Allocated memory is still 1.1GB. Free memory was 807.4MB in the beginning and 806.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:27:58,094 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.14ms. Allocated memory is still 50.3MB. Free memory is still 33.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 638.64ms. Allocated memory is still 60.8MB. Free memory was 41.5MB in the beginning and 32.2MB in the end (delta: 9.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.66ms. Allocated memory is still 60.8MB. Free memory was 32.2MB in the beginning and 29.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.23ms. Allocated memory is still 60.8MB. Free memory was 29.4MB in the beginning and 26.2MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 914.60ms. Allocated memory was 60.8MB in the beginning and 79.7MB in the end (delta: 18.9MB). Free memory was 25.9MB in the beginning and 39.3MB in the end (delta: -13.3MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11333.37ms. Allocated memory was 79.7MB in the beginning and 1.1GB in the end (delta: 985.7MB). Free memory was 38.2MB in the beginning and 807.4MB in the end (delta: -769.2MB). Peak memory consumption was 217.1MB. Max. memory is 16.1GB. * Witness Printer took 3.63ms. Allocated memory is still 1.1GB. Free memory was 807.4MB in the beginning and 806.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1029; [L857] FCALL, FORK 0 pthread_create(&t1029, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1029=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L858] 0 pthread_t t1030; [L859] FCALL, FORK 0 pthread_create(&t1030, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1029=0, t1030=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t1031; [L861] FCALL, FORK 0 pthread_create(&t1031, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1029=0, t1030=1, t1031=2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L862] 0 pthread_t t1032; [L863] FCALL, FORK 0 pthread_create(&t1032, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1029=0, t1030=1, t1031=2, t1032=3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L825] 4 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L828] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L831] 4 __unbuffered_p3_EBX = b VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 b = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L834] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L835] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L836] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L837] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L838] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1029=0, t1030=1, t1031=2, t1032=3, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1029=0, t1030=1, t1031=2, t1032=3, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L876] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1029=0, t1030=1, t1031=2, t1032=3, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix039.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=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: 854]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 857]: 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: 863]: 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: 861]: 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: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 89 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 471 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 452 mSDsluCounter, 67 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1534 IncrementalHoareTripleChecker+Invalid, 1562 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 3 mSDtfsCounter, 1534 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 316 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=254occurred in iteration=5, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 342 NumberOfCodeBlocks, 341 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 293 ConstructedInterpolants, 0 QuantifiedInterpolants, 864 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1203 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 21:27:58,118 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 Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample