./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix011.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix011.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 bf5c730233935847a217c1b7e035f48702f966e69335bdca03afb3b42404d05c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:26:40,126 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:26:40,195 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:26:40,200 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:26:40,201 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:26:40,232 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:26:40,233 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:26:40,233 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:26:40,234 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:26:40,238 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:26:40,238 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:26:40,238 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:26:40,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:26:40,239 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:26:40,239 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:26:40,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:26:40,240 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:26:40,242 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:26:40,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:26:40,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:26:40,243 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:26:40,243 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:26:40,244 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:26:40,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:26:40,244 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:26:40,244 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:26:40,245 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:26:40,245 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:26:40,245 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:26:40,246 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:26:40,246 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:26:40,246 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:26:40,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:26:40,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:26:40,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:26:40,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:26:40,247 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:26:40,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:26:40,247 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:26:40,248 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:26:40,248 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:26:40,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:26:40,250 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 -> bf5c730233935847a217c1b7e035f48702f966e69335bdca03afb3b42404d05c [2024-11-09 10:26:40,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:26:40,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:26:40,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:26:40,568 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:26:40,568 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:26:40,570 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix011.opt.i [2024-11-09 10:26:42,020 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:26:42,270 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:26:42,271 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix011.opt.i [2024-11-09 10:26:42,289 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d114a67f/019772f6b28a459082255757b475ce32/FLAG8af199eac [2024-11-09 10:26:42,308 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d114a67f/019772f6b28a459082255757b475ce32 [2024-11-09 10:26:42,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:26:42,311 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:26:42,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:26:42,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:26:42,317 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:26:42,318 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:26:42" (1/1) ... [2024-11-09 10:26:42,319 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d71c972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:42, skipping insertion in model container [2024-11-09 10:26:42,319 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:26:42" (1/1) ... [2024-11-09 10:26:42,365 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:26:42,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:26:42,817 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:26:42,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:26:42,924 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:26:42,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:42 WrapperNode [2024-11-09 10:26:42,925 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:26:42,926 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:26:42,926 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:26:42,927 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:26:42,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:42" (1/1) ... [2024-11-09 10:26:42,956 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:42" (1/1) ... [2024-11-09 10:26:43,000 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 144 [2024-11-09 10:26:43,000 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:26:43,001 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:26:43,001 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:26:43,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:26:43,013 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:42" (1/1) ... [2024-11-09 10:26:43,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:42" (1/1) ... [2024-11-09 10:26:43,016 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:42" (1/1) ... [2024-11-09 10:26:43,040 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 10:26:43,041 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:42" (1/1) ... [2024-11-09 10:26:43,041 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:42" (1/1) ... [2024-11-09 10:26:43,053 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:42" (1/1) ... [2024-11-09 10:26:43,055 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:42" (1/1) ... [2024-11-09 10:26:43,060 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:42" (1/1) ... [2024-11-09 10:26:43,062 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:42" (1/1) ... [2024-11-09 10:26:43,064 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:26:43,065 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:26:43,065 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:26:43,066 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:26:43,070 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:42" (1/1) ... [2024-11-09 10:26:43,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:26:43,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:26:43,109 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 10:26:43,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 10:26:43,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 10:26:43,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:26:43,161 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-09 10:26:43,161 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-09 10:26:43,162 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-09 10:26:43,162 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-09 10:26:43,162 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-09 10:26:43,162 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-09 10:26:43,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:26:43,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 10:26:43,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:26:43,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:26:43,165 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:26:43,355 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:26:43,358 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:26:43,716 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:26:43,716 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:26:43,938 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:26:43,938 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 10:26:43,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:26:43 BoogieIcfgContainer [2024-11-09 10:26:43,939 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:26:43,941 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:26:43,941 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:26:43,944 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:26:43,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:26:42" (1/3) ... [2024-11-09 10:26:43,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd65513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:26:43, skipping insertion in model container [2024-11-09 10:26:43,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:42" (2/3) ... [2024-11-09 10:26:43,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd65513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:26:43, skipping insertion in model container [2024-11-09 10:26:43,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:26:43" (3/3) ... [2024-11-09 10:26:43,947 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011.opt.i [2024-11-09 10:26:43,964 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:26:43,965 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-09 10:26:43,965 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:26:44,052 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:26:44,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 106 flow [2024-11-09 10:26:44,122 INFO L124 PetriNetUnfolderBase]: 2/44 cut-off events. [2024-11-09 10:26:44,123 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:26:44,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 2/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 88 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2024-11-09 10:26:44,128 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 47 transitions, 106 flow [2024-11-09 10:26:44,133 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 44 transitions, 97 flow [2024-11-09 10:26:44,141 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:26:44,151 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;@1ad5913e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:26:44,151 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 10:26:44,160 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:26:44,160 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2024-11-09 10:26:44,160 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:26:44,160 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:26:44,161 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:26:44,162 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:26:44,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:26:44,168 INFO L85 PathProgramCache]: Analyzing trace with hash -2040167228, now seen corresponding path program 1 times [2024-11-09 10:26:44,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:26:44,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745846625] [2024-11-09 10:26:44,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:26:44,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:26:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:26:44,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:26:44,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:26:44,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745846625] [2024-11-09 10:26:44,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745846625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:26:44,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:26:44,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:26:44,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354911034] [2024-11-09 10:26:44,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:26:44,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:26:44,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:26:44,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:26:44,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:26:44,723 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 47 [2024-11-09 10:26:44,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:44,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:26:44,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 47 [2024-11-09 10:26:44,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:26:45,096 INFO L124 PetriNetUnfolderBase]: 459/871 cut-off events. [2024-11-09 10:26:45,097 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:26:45,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1610 conditions, 871 events. 459/871 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5981 event pairs, 67 based on Foata normal form. 60/910 useless extension candidates. Maximal degree in co-relation 1599. Up to 585 conditions per place. [2024-11-09 10:26:45,112 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 26 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2024-11-09 10:26:45,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 50 transitions, 169 flow [2024-11-09 10:26:45,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:26:45,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:26:45,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-11-09 10:26:45,126 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7375886524822695 [2024-11-09 10:26:45,127 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 97 flow. Second operand 3 states and 104 transitions. [2024-11-09 10:26:45,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 50 transitions, 169 flow [2024-11-09 10:26:45,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:26:45,135 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 88 flow [2024-11-09 10:26:45,138 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-11-09 10:26:45,143 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2024-11-09 10:26:45,144 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 88 flow [2024-11-09 10:26:45,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:45,144 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:26:45,144 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:26:45,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:26:45,145 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:26:45,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:26:45,145 INFO L85 PathProgramCache]: Analyzing trace with hash -326082749, now seen corresponding path program 1 times [2024-11-09 10:26:45,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:26:45,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823542228] [2024-11-09 10:26:45,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:26:45,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:26:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:26:45,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:26:45,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:26:45,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823542228] [2024-11-09 10:26:45,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823542228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:26:45,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:26:45,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:26:45,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146615169] [2024-11-09 10:26:45,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:26:45,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:26:45,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:26:45,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:26:45,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:26:45,247 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-11-09 10:26:45,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:45,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:26:45,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-11-09 10:26:45,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:26:45,415 INFO L124 PetriNetUnfolderBase]: 400/818 cut-off events. [2024-11-09 10:26:45,415 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2024-11-09 10:26:45,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1509 conditions, 818 events. 400/818 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5745 event pairs, 400 based on Foata normal form. 30/815 useless extension candidates. Maximal degree in co-relation 1499. Up to 627 conditions per place. [2024-11-09 10:26:45,422 INFO L140 encePairwiseOnDemand]: 45/47 looper letters, 17 selfloop transitions, 1 changer transitions 1/38 dead transitions. [2024-11-09 10:26:45,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 124 flow [2024-11-09 10:26:45,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:26:45,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:26:45,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2024-11-09 10:26:45,425 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6099290780141844 [2024-11-09 10:26:45,425 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 88 flow. Second operand 3 states and 86 transitions. [2024-11-09 10:26:45,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 124 flow [2024-11-09 10:26:45,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 38 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:26:45,428 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 82 flow [2024-11-09 10:26:45,429 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2024-11-09 10:26:45,430 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2024-11-09 10:26:45,430 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 82 flow [2024-11-09 10:26:45,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:45,431 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:26:45,431 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:26:45,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:26:45,431 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:26:45,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:26:45,432 INFO L85 PathProgramCache]: Analyzing trace with hash -326081384, now seen corresponding path program 1 times [2024-11-09 10:26:45,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:26:45,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972068186] [2024-11-09 10:26:45,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:26:45,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:26:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:26:45,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:26:45,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:26:45,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972068186] [2024-11-09 10:26:45,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972068186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:26:45,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:26:45,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:26:45,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956142272] [2024-11-09 10:26:45,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:26:45,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:26:45,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:26:45,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:26:45,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:26:45,756 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2024-11-09 10:26:45,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:45,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:26:45,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2024-11-09 10:26:45,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:26:46,728 INFO L124 PetriNetUnfolderBase]: 3294/5590 cut-off events. [2024-11-09 10:26:46,728 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:26:46,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10577 conditions, 5590 events. 3294/5590 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 41563 event pairs, 802 based on Foata normal form. 0/5386 useless extension candidates. Maximal degree in co-relation 10571. Up to 2096 conditions per place. [2024-11-09 10:26:46,760 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 34 selfloop transitions, 7 changer transitions 72/126 dead transitions. [2024-11-09 10:26:46,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 126 transitions, 488 flow [2024-11-09 10:26:46,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 10:26:46,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 10:26:46,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 268 transitions. [2024-11-09 10:26:46,763 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6335697399527187 [2024-11-09 10:26:46,763 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 82 flow. Second operand 9 states and 268 transitions. [2024-11-09 10:26:46,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 126 transitions, 488 flow [2024-11-09 10:26:46,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 126 transitions, 487 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:26:46,768 INFO L231 Difference]: Finished difference. Result has 61 places, 42 transitions, 177 flow [2024-11-09 10:26:46,768 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=177, PETRI_PLACES=61, PETRI_TRANSITIONS=42} [2024-11-09 10:26:46,769 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2024-11-09 10:26:46,769 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 42 transitions, 177 flow [2024-11-09 10:26:46,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:46,769 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:26:46,769 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:26:46,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:26:46,770 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:26:46,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:26:46,770 INFO L85 PathProgramCache]: Analyzing trace with hash -79062377, now seen corresponding path program 1 times [2024-11-09 10:26:46,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:26:46,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946886409] [2024-11-09 10:26:46,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:26:46,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:26:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:26:46,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:26:46,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:26:46,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946886409] [2024-11-09 10:26:46,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946886409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:26:46,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:26:46,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:26:46,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732199690] [2024-11-09 10:26:46,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:26:46,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:26:46,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:26:46,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:26:46,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:26:47,004 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2024-11-09 10:26:47,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 42 transitions, 177 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:47,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:26:47,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2024-11-09 10:26:47,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:26:47,848 INFO L124 PetriNetUnfolderBase]: 2256/4138 cut-off events. [2024-11-09 10:26:47,849 INFO L125 PetriNetUnfolderBase]: For 5496/5496 co-relation queries the response was YES. [2024-11-09 10:26:47,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12070 conditions, 4138 events. 2256/4138 cut-off events. For 5496/5496 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 30245 event pairs, 466 based on Foata normal form. 120/4228 useless extension candidates. Maximal degree in co-relation 12055. Up to 1482 conditions per place. [2024-11-09 10:26:47,880 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 41 selfloop transitions, 8 changer transitions 54/116 dead transitions. [2024-11-09 10:26:47,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 116 transitions, 745 flow [2024-11-09 10:26:47,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:26:47,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-09 10:26:47,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 266 transitions. [2024-11-09 10:26:47,883 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5659574468085107 [2024-11-09 10:26:47,883 INFO L175 Difference]: Start difference. First operand has 61 places, 42 transitions, 177 flow. Second operand 10 states and 266 transitions. [2024-11-09 10:26:47,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 116 transitions, 745 flow [2024-11-09 10:26:47,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 116 transitions, 637 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-11-09 10:26:47,909 INFO L231 Difference]: Finished difference. Result has 68 places, 46 transitions, 229 flow [2024-11-09 10:26:47,909 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=229, PETRI_PLACES=68, PETRI_TRANSITIONS=46} [2024-11-09 10:26:47,909 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 16 predicate places. [2024-11-09 10:26:47,910 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 46 transitions, 229 flow [2024-11-09 10:26:47,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:47,910 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:26:47,910 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:26:47,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:26:47,910 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:26:47,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:26:47,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1410012614, now seen corresponding path program 1 times [2024-11-09 10:26:47,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:26:47,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248965083] [2024-11-09 10:26:47,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:26:47,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:26:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:26:48,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:26:48,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:26:48,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248965083] [2024-11-09 10:26:48,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248965083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:26:48,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:26:48,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:26:48,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50504188] [2024-11-09 10:26:48,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:26:48,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:26:48,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:26:48,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:26:48,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:26:48,216 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-11-09 10:26:48,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 46 transitions, 229 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:48,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:26:48,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-11-09 10:26:48,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:26:48,863 INFO L124 PetriNetUnfolderBase]: 1788/3633 cut-off events. [2024-11-09 10:26:48,863 INFO L125 PetriNetUnfolderBase]: For 6733/6736 co-relation queries the response was YES. [2024-11-09 10:26:48,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10661 conditions, 3633 events. 1788/3633 cut-off events. For 6733/6736 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 28320 event pairs, 820 based on Foata normal form. 98/3650 useless extension candidates. Maximal degree in co-relation 10639. Up to 2135 conditions per place. [2024-11-09 10:26:48,897 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 37 selfloop transitions, 5 changer transitions 29/89 dead transitions. [2024-11-09 10:26:48,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 89 transitions, 587 flow [2024-11-09 10:26:48,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:26:48,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 10:26:48,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 194 transitions. [2024-11-09 10:26:48,900 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5896656534954408 [2024-11-09 10:26:48,900 INFO L175 Difference]: Start difference. First operand has 68 places, 46 transitions, 229 flow. Second operand 7 states and 194 transitions. [2024-11-09 10:26:48,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 89 transitions, 587 flow [2024-11-09 10:26:48,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 89 transitions, 555 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-11-09 10:26:48,952 INFO L231 Difference]: Finished difference. Result has 68 places, 49 transitions, 271 flow [2024-11-09 10:26:48,952 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=271, PETRI_PLACES=68, PETRI_TRANSITIONS=49} [2024-11-09 10:26:48,953 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 16 predicate places. [2024-11-09 10:26:48,953 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 49 transitions, 271 flow [2024-11-09 10:26:48,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:48,953 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:26:48,954 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:26:48,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:26:48,954 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:26:48,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:26:48,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1122829211, now seen corresponding path program 1 times [2024-11-09 10:26:48,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:26:48,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051546053] [2024-11-09 10:26:48,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:26:48,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:26:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:26:49,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:26:49,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:26:49,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051546053] [2024-11-09 10:26:49,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051546053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:26:49,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:26:49,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:26:49,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837007559] [2024-11-09 10:26:49,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:26:49,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:26:49,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:26:49,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:26:49,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:26:49,235 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2024-11-09 10:26:49,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 49 transitions, 271 flow. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:49,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:26:49,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2024-11-09 10:26:49,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:26:49,913 INFO L124 PetriNetUnfolderBase]: 1866/3539 cut-off events. [2024-11-09 10:26:49,913 INFO L125 PetriNetUnfolderBase]: For 7048/7048 co-relation queries the response was YES. [2024-11-09 10:26:49,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11077 conditions, 3539 events. 1866/3539 cut-off events. For 7048/7048 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 25670 event pairs, 357 based on Foata normal form. 88/3596 useless extension candidates. Maximal degree in co-relation 11053. Up to 1164 conditions per place. [2024-11-09 10:26:49,947 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 53 selfloop transitions, 10 changer transitions 48/124 dead transitions. [2024-11-09 10:26:49,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 124 transitions, 897 flow [2024-11-09 10:26:49,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:26:49,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-09 10:26:49,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 267 transitions. [2024-11-09 10:26:49,949 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5680851063829787 [2024-11-09 10:26:49,949 INFO L175 Difference]: Start difference. First operand has 68 places, 49 transitions, 271 flow. Second operand 10 states and 267 transitions. [2024-11-09 10:26:49,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 124 transitions, 897 flow [2024-11-09 10:26:49,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 124 transitions, 854 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-11-09 10:26:49,985 INFO L231 Difference]: Finished difference. Result has 75 places, 53 transitions, 351 flow [2024-11-09 10:26:49,985 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=351, PETRI_PLACES=75, PETRI_TRANSITIONS=53} [2024-11-09 10:26:49,986 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2024-11-09 10:26:49,986 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 53 transitions, 351 flow [2024-11-09 10:26:49,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:49,986 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:26:49,986 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-09 10:26:49,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:26:49,987 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:26:49,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:26:49,987 INFO L85 PathProgramCache]: Analyzing trace with hash -84525990, now seen corresponding path program 1 times [2024-11-09 10:26:49,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:26:49,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918685023] [2024-11-09 10:26:49,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:26:49,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:26:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:26:50,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:26:50,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:26:50,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918685023] [2024-11-09 10:26:50,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918685023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:26:50,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:26:50,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:26:50,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171244863] [2024-11-09 10:26:50,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:26:50,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:26:50,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:26:50,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:26:50,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:26:50,201 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-11-09 10:26:50,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 53 transitions, 351 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:50,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:26:50,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-11-09 10:26:50,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:26:50,758 INFO L124 PetriNetUnfolderBase]: 2770/4700 cut-off events. [2024-11-09 10:26:50,758 INFO L125 PetriNetUnfolderBase]: For 9578/9977 co-relation queries the response was YES. [2024-11-09 10:26:50,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13577 conditions, 4700 events. 2770/4700 cut-off events. For 9578/9977 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 31430 event pairs, 404 based on Foata normal form. 235/4778 useless extension candidates. Maximal degree in co-relation 13549. Up to 2414 conditions per place. [2024-11-09 10:26:50,804 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 52 selfloop transitions, 5 changer transitions 0/84 dead transitions. [2024-11-09 10:26:50,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 84 transitions, 629 flow [2024-11-09 10:26:50,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:26:50,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:26:50,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2024-11-09 10:26:50,808 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6542553191489362 [2024-11-09 10:26:50,809 INFO L175 Difference]: Start difference. First operand has 75 places, 53 transitions, 351 flow. Second operand 4 states and 123 transitions. [2024-11-09 10:26:50,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 84 transitions, 629 flow [2024-11-09 10:26:50,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 84 transitions, 607 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-09 10:26:50,850 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 367 flow [2024-11-09 10:26:50,851 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=367, PETRI_PLACES=69, PETRI_TRANSITIONS=57} [2024-11-09 10:26:50,852 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 17 predicate places. [2024-11-09 10:26:50,852 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 367 flow [2024-11-09 10:26:50,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:50,853 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:26:50,853 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:26:50,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:26:50,853 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:26:50,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:26:50,854 INFO L85 PathProgramCache]: Analyzing trace with hash -930439468, now seen corresponding path program 1 times [2024-11-09 10:26:50,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:26:50,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489355462] [2024-11-09 10:26:50,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:26:50,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:26:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:26:51,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:26:51,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:26:51,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489355462] [2024-11-09 10:26:51,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489355462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:26:51,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:26:51,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:26:51,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660314277] [2024-11-09 10:26:51,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:26:51,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:26:51,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:26:51,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:26:51,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:26:51,118 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-11-09 10:26:51,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 367 flow. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 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-09 10:26:51,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:26:51,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-11-09 10:26:51,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:26:51,642 INFO L124 PetriNetUnfolderBase]: 2072/3592 cut-off events. [2024-11-09 10:26:51,643 INFO L125 PetriNetUnfolderBase]: For 5756/6204 co-relation queries the response was YES. [2024-11-09 10:26:51,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11098 conditions, 3592 events. 2072/3592 cut-off events. For 5756/6204 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 22942 event pairs, 203 based on Foata normal form. 239/3699 useless extension candidates. Maximal degree in co-relation 11071. Up to 1112 conditions per place. [2024-11-09 10:26:51,678 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 63 selfloop transitions, 8 changer transitions 0/98 dead transitions. [2024-11-09 10:26:51,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 98 transitions, 729 flow [2024-11-09 10:26:51,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:26:51,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:26:51,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2024-11-09 10:26:51,680 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6638297872340425 [2024-11-09 10:26:51,680 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 367 flow. Second operand 5 states and 156 transitions. [2024-11-09 10:26:51,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 98 transitions, 729 flow [2024-11-09 10:26:51,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 98 transitions, 722 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-09 10:26:51,692 INFO L231 Difference]: Finished difference. Result has 72 places, 61 transitions, 415 flow [2024-11-09 10:26:51,692 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=415, PETRI_PLACES=72, PETRI_TRANSITIONS=61} [2024-11-09 10:26:51,693 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 20 predicate places. [2024-11-09 10:26:51,694 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 61 transitions, 415 flow [2024-11-09 10:26:51,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 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-09 10:26:51,695 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:26:51,698 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:26:51,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:26:51,698 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:26:51,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:26:51,699 INFO L85 PathProgramCache]: Analyzing trace with hash 104529342, now seen corresponding path program 1 times [2024-11-09 10:26:51,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:26:51,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809246847] [2024-11-09 10:26:51,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:26:51,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:26:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:26:52,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:26:52,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:26:52,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809246847] [2024-11-09 10:26:52,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809246847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:26:52,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:26:52,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:26:52,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641533681] [2024-11-09 10:26:52,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:26:52,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:26:52,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:26:52,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:26:52,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:26:52,103 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-11-09 10:26:52,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 61 transitions, 415 flow. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:52,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:26:52,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-11-09 10:26:52,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:26:52,613 INFO L124 PetriNetUnfolderBase]: 1624/2796 cut-off events. [2024-11-09 10:26:52,613 INFO L125 PetriNetUnfolderBase]: For 7068/7722 co-relation queries the response was YES. [2024-11-09 10:26:52,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9846 conditions, 2796 events. 1624/2796 cut-off events. For 7068/7722 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 17490 event pairs, 175 based on Foata normal form. 177/2845 useless extension candidates. Maximal degree in co-relation 9818. Up to 1100 conditions per place. [2024-11-09 10:26:52,642 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 56 selfloop transitions, 11 changer transitions 0/94 dead transitions. [2024-11-09 10:26:52,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 94 transitions, 709 flow [2024-11-09 10:26:52,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:26:52,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:26:52,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 173 transitions. [2024-11-09 10:26:52,644 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6134751773049646 [2024-11-09 10:26:52,644 INFO L175 Difference]: Start difference. First operand has 72 places, 61 transitions, 415 flow. Second operand 6 states and 173 transitions. [2024-11-09 10:26:52,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 94 transitions, 709 flow [2024-11-09 10:26:52,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 94 transitions, 661 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-11-09 10:26:52,658 INFO L231 Difference]: Finished difference. Result has 73 places, 62 transitions, 417 flow [2024-11-09 10:26:52,660 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=417, PETRI_PLACES=73, PETRI_TRANSITIONS=62} [2024-11-09 10:26:52,661 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places. [2024-11-09 10:26:52,661 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 62 transitions, 417 flow [2024-11-09 10:26:52,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:52,661 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:26:52,662 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:26:52,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:26:52,662 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:26:52,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:26:52,662 INFO L85 PathProgramCache]: Analyzing trace with hash -150073575, now seen corresponding path program 1 times [2024-11-09 10:26:52,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:26:52,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517116124] [2024-11-09 10:26:52,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:26:52,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:26:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:26:52,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:26:52,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:26:52,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517116124] [2024-11-09 10:26:52,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517116124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:26:52,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:26:52,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:26:52,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866416836] [2024-11-09 10:26:52,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:26:52,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:26:52,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:26:52,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:26:52,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:26:52,971 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-11-09 10:26:52,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 417 flow. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:52,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:26:52,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-11-09 10:26:52,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:26:53,421 INFO L124 PetriNetUnfolderBase]: 1334/2879 cut-off events. [2024-11-09 10:26:53,421 INFO L125 PetriNetUnfolderBase]: For 6267/6591 co-relation queries the response was YES. [2024-11-09 10:26:53,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9158 conditions, 2879 events. 1334/2879 cut-off events. For 6267/6591 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 22312 event pairs, 414 based on Foata normal form. 44/2614 useless extension candidates. Maximal degree in co-relation 9132. Up to 1050 conditions per place. [2024-11-09 10:26:53,444 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 31 selfloop transitions, 1 changer transitions 26/92 dead transitions. [2024-11-09 10:26:53,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 92 transitions, 651 flow [2024-11-09 10:26:53,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:26:53,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:26:53,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 164 transitions. [2024-11-09 10:26:53,446 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5815602836879432 [2024-11-09 10:26:53,446 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 417 flow. Second operand 6 states and 164 transitions. [2024-11-09 10:26:53,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 92 transitions, 651 flow [2024-11-09 10:26:53,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 92 transitions, 585 flow, removed 27 selfloop flow, removed 5 redundant places. [2024-11-09 10:26:53,476 INFO L231 Difference]: Finished difference. Result has 77 places, 57 transitions, 330 flow [2024-11-09 10:26:53,477 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=330, PETRI_PLACES=77, PETRI_TRANSITIONS=57} [2024-11-09 10:26:53,477 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 25 predicate places. [2024-11-09 10:26:53,477 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 57 transitions, 330 flow [2024-11-09 10:26:53,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:53,478 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:26:53,478 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:26:53,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:26:53,478 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:26:53,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:26:53,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1233706511, now seen corresponding path program 2 times [2024-11-09 10:26:53,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:26:53,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782861886] [2024-11-09 10:26:53,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:26:53,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:26:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:26:53,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:26:53,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:26:53,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782861886] [2024-11-09 10:26:53,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782861886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:26:53,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:26:53,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:26:53,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079934131] [2024-11-09 10:26:53,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:26:53,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:26:53,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:26:53,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:26:53,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:26:53,744 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-11-09 10:26:53,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 57 transitions, 330 flow. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:53,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:26:53,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-11-09 10:26:53,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:26:54,118 INFO L124 PetriNetUnfolderBase]: 1118/2482 cut-off events. [2024-11-09 10:26:54,119 INFO L125 PetriNetUnfolderBase]: For 3392/3576 co-relation queries the response was YES. [2024-11-09 10:26:54,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7079 conditions, 2482 events. 1118/2482 cut-off events. For 3392/3576 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 19121 event pairs, 437 based on Foata normal form. 30/2229 useless extension candidates. Maximal degree in co-relation 7052. Up to 956 conditions per place. [2024-11-09 10:26:54,134 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 23 selfloop transitions, 2 changer transitions 31/80 dead transitions. [2024-11-09 10:26:54,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 80 transitions, 518 flow [2024-11-09 10:26:54,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:26:54,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:26:54,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions. [2024-11-09 10:26:54,135 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2024-11-09 10:26:54,136 INFO L175 Difference]: Start difference. First operand has 77 places, 57 transitions, 330 flow. Second operand 5 states and 140 transitions. [2024-11-09 10:26:54,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 80 transitions, 518 flow [2024-11-09 10:26:54,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 80 transitions, 507 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-09 10:26:54,159 INFO L231 Difference]: Finished difference. Result has 77 places, 45 transitions, 231 flow [2024-11-09 10:26:54,159 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=231, PETRI_PLACES=77, PETRI_TRANSITIONS=45} [2024-11-09 10:26:54,160 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 25 predicate places. [2024-11-09 10:26:54,160 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 45 transitions, 231 flow [2024-11-09 10:26:54,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:26:54,160 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:26:54,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] [2024-11-09 10:26:54,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 10:26:54,161 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:26:54,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:26:54,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1793139937, now seen corresponding path program 3 times [2024-11-09 10:26:54,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:26:54,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806286665] [2024-11-09 10:26:54,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:26:54,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:26:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:26:54,229 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:26:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:26:54,349 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:26:54,349 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:26:54,350 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-09 10:26:54,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-09 10:26:54,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-09 10:26:54,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-09 10:26:54,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-09 10:26:54,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-09 10:26:54,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-09 10:26:54,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 10:26:54,353 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:26:54,449 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:26:54,450 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:26:54,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:26:54 BasicIcfg [2024-11-09 10:26:54,455 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:26:54,456 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:26:54,456 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:26:54,456 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:26:54,456 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:26:43" (3/4) ... [2024-11-09 10:26:54,458 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:26:54,460 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:26:54,462 INFO L158 Benchmark]: Toolchain (without parser) took 12149.79ms. Allocated memory was 159.4MB in the beginning and 608.2MB in the end (delta: 448.8MB). Free memory was 83.9MB in the beginning and 326.1MB in the end (delta: -242.2MB). Peak memory consumption was 209.2MB. Max. memory is 16.1GB. [2024-11-09 10:26:54,462 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 130.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:26:54,462 INFO L158 Benchmark]: CACSL2BoogieTranslator took 612.66ms. Allocated memory is still 159.4MB. Free memory was 83.6MB in the beginning and 118.1MB in the end (delta: -34.5MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2024-11-09 10:26:54,463 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.92ms. Allocated memory is still 159.4MB. Free memory was 118.1MB in the beginning and 115.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 10:26:54,463 INFO L158 Benchmark]: Boogie Preprocessor took 63.49ms. Allocated memory is still 159.4MB. Free memory was 115.2MB in the beginning and 111.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 10:26:54,463 INFO L158 Benchmark]: RCFGBuilder took 873.82ms. Allocated memory is still 159.4MB. Free memory was 111.0MB in the beginning and 76.8MB in the end (delta: 34.2MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2024-11-09 10:26:54,463 INFO L158 Benchmark]: TraceAbstraction took 10514.44ms. Allocated memory was 159.4MB in the beginning and 608.2MB in the end (delta: 448.8MB). Free memory was 76.2MB in the beginning and 326.1MB in the end (delta: -249.9MB). Peak memory consumption was 201.1MB. Max. memory is 16.1GB. [2024-11-09 10:26:54,464 INFO L158 Benchmark]: Witness Printer took 4.40ms. Allocated memory is still 608.2MB. Free memory is still 326.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:26:54,469 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.18ms. Allocated memory is still 159.4MB. Free memory is still 130.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 612.66ms. Allocated memory is still 159.4MB. Free memory was 83.6MB in the beginning and 118.1MB in the end (delta: -34.5MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.92ms. Allocated memory is still 159.4MB. Free memory was 118.1MB in the beginning and 115.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.49ms. Allocated memory is still 159.4MB. Free memory was 115.2MB in the beginning and 111.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 873.82ms. Allocated memory is still 159.4MB. Free memory was 111.0MB in the beginning and 76.8MB in the end (delta: 34.2MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10514.44ms. Allocated memory was 159.4MB in the beginning and 608.2MB in the end (delta: 448.8MB). Free memory was 76.2MB in the beginning and 326.1MB in the end (delta: -249.9MB). Peak memory consumption was 201.1MB. Max. memory is 16.1GB. * Witness Printer took 4.40ms. Allocated memory is still 608.2MB. Free memory is still 326.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L727] 0 int z = 0; [L728] 0 _Bool z$flush_delayed; [L729] 0 int z$mem_tmp; [L730] 0 _Bool z$r_buff0_thd0; [L731] 0 _Bool z$r_buff0_thd1; [L732] 0 _Bool z$r_buff0_thd2; [L733] 0 _Bool z$r_buff0_thd3; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$read_delayed; [L739] 0 int *z$read_delayed_var; [L740] 0 int z$w_buff0; [L741] 0 _Bool z$w_buff0_used; [L742] 0 int z$w_buff1; [L743] 0 _Bool z$w_buff1_used; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L851] 0 pthread_t t284; [L852] FCALL, FORK 0 pthread_create(&t284, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t284=-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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L853] 0 pthread_t t285; [L854] FCALL, FORK 0 pthread_create(&t285, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t284=-3, t285=-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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L855] 0 pthread_t t286; [L856] FCALL, FORK 0 pthread_create(&t286, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t284=-3, t285=-2, t286=-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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L798] 3 z$w_buff1 = z$w_buff0 [L799] 3 z$w_buff0 = 1 [L800] 3 z$w_buff1_used = z$w_buff0_used [L801] 3 z$w_buff0_used = (_Bool)1 [L802] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L802] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 3 z$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 z$flush_delayed = weak$$choice2 [L813] 3 z$mem_tmp = z [L814] 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) [L815] 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)) [L816] 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)) [L817] 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)) [L818] 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)) [L819] 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)) [L820] 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)) [L821] 3 __unbuffered_p2_EAX = z [L822] 3 z = z$flush_delayed ? z$mem_tmp : z [L823] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L826] 3 __unbuffered_p2_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L749] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L752] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L764] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L767] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L770] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L773] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 2 z$flush_delayed = weak$$choice2 [L776] 2 z$mem_tmp = z [L777] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L778] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L779] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L780] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L781] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L783] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 __unbuffered_p1_EBX = z [L785] 2 z = z$flush_delayed ? z$mem_tmp : z [L786] 2 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L829] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L830] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L831] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L832] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L833] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L836] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L858] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t284=-3, t285=-2, t286=-1, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L860] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L860] RET 0 assume_abort_if_not(main$tmp_guard0) [L862] 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) [L863] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L864] 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 [L865] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L866] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t284=-3, t285=-2, t286=-1, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t284=-3, t285=-2, t286=-1, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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", "mix011.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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: 849]: 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 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: 852]: 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: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 74 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 450 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 413 mSDsluCounter, 165 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 111 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1201 IncrementalHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 54 mSDtfsCounter, 1201 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=417occurred in iteration=9, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 839 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 10:26:54,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix011.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 bf5c730233935847a217c1b7e035f48702f966e69335bdca03afb3b42404d05c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:26:56,803 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:26:56,889 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:26:56,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:26:56,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:26:56,932 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:26:56,935 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:26:56,935 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:26:56,936 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:26:56,937 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:26:56,939 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:26:56,939 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:26:56,940 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:26:56,940 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:26:56,941 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:26:56,944 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:26:56,945 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:26:56,945 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:26:56,945 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:26:56,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:26:56,946 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:26:56,946 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:26:56,947 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:26:56,947 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:26:56,948 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:26:56,948 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:26:56,949 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:26:56,949 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:26:56,949 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:26:56,950 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:26:56,950 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:26:56,950 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:26:56,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:26:56,951 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:26:56,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:26:56,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:26:56,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:26:56,953 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:26:56,954 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:26:56,954 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:26:56,954 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:26:56,955 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:26:56,955 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:26:56,955 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:26:56,955 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 -> bf5c730233935847a217c1b7e035f48702f966e69335bdca03afb3b42404d05c [2024-11-09 10:26:57,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:26:57,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:26:57,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:26:57,314 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:26:57,314 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:26:57,315 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix011.opt.i [2024-11-09 10:26:58,974 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:26:59,253 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:26:59,253 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix011.opt.i [2024-11-09 10:26:59,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1b4f8e28/2b9d4f485f094e4581e112eef6fdedfa/FLAGfcc607946 [2024-11-09 10:26:59,290 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1b4f8e28/2b9d4f485f094e4581e112eef6fdedfa [2024-11-09 10:26:59,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:26:59,293 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:26:59,294 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:26:59,294 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:26:59,299 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:26:59,300 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:26:59" (1/1) ... [2024-11-09 10:26:59,301 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e80b09f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:59, skipping insertion in model container [2024-11-09 10:26:59,303 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:26:59" (1/1) ... [2024-11-09 10:26:59,345 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:26:59,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:26:59,825 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:26:59,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:26:59,948 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:26:59,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:59 WrapperNode [2024-11-09 10:26:59,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:26:59,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:26:59,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:26:59,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:26:59,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:59" (1/1) ... [2024-11-09 10:26:59,986 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:59" (1/1) ... [2024-11-09 10:27:00,030 INFO L138 Inliner]: procedures = 176, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 145 [2024-11-09 10:27:00,034 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:27:00,035 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:27:00,036 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:27:00,036 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:27:00,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:59" (1/1) ... [2024-11-09 10:27:00,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:59" (1/1) ... [2024-11-09 10:27:00,057 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:59" (1/1) ... [2024-11-09 10:27:00,085 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 10:27:00,089 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:59" (1/1) ... [2024-11-09 10:27:00,089 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:59" (1/1) ... [2024-11-09 10:27:00,098 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:59" (1/1) ... [2024-11-09 10:27:00,100 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:59" (1/1) ... [2024-11-09 10:27:00,102 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:59" (1/1) ... [2024-11-09 10:27:00,104 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:59" (1/1) ... [2024-11-09 10:27:00,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:27:00,108 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:27:00,108 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:27:00,108 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:27:00,109 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:59" (1/1) ... [2024-11-09 10:27:00,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:27:00,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:27:00,157 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 10:27:00,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 10:27:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 10:27:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:27:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:27:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-09 10:27:00,209 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-09 10:27:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-09 10:27:00,210 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-09 10:27:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-09 10:27:00,210 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-09 10:27:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 10:27:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:27:00,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:27:00,212 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:27:00,372 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:27:00,374 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:27:00,743 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:27:00,743 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:27:01,051 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:27:01,052 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 10:27:01,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:27:01 BoogieIcfgContainer [2024-11-09 10:27:01,053 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:27:01,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:27:01,057 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:27:01,060 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:27:01,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:26:59" (1/3) ... [2024-11-09 10:27:01,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f57884d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:27:01, skipping insertion in model container [2024-11-09 10:27:01,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:26:59" (2/3) ... [2024-11-09 10:27:01,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f57884d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:27:01, skipping insertion in model container [2024-11-09 10:27:01,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:27:01" (3/3) ... [2024-11-09 10:27:01,064 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011.opt.i [2024-11-09 10:27:01,079 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:27:01,079 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-09 10:27:01,079 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:27:01,144 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:27:01,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 106 flow [2024-11-09 10:27:01,215 INFO L124 PetriNetUnfolderBase]: 2/44 cut-off events. [2024-11-09 10:27:01,216 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:27:01,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 2/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 88 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2024-11-09 10:27:01,221 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 47 transitions, 106 flow [2024-11-09 10:27:01,225 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 44 transitions, 97 flow [2024-11-09 10:27:01,240 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:27:01,247 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;@84fbb13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:27:01,248 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 10:27:01,257 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:27:01,258 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2024-11-09 10:27:01,258 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:27:01,258 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:27:01,259 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:27:01,260 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:27:01,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:27:01,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1015339580, now seen corresponding path program 1 times [2024-11-09 10:27:01,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:27:01,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1299439820] [2024-11-09 10:27:01,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:27:01,280 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:27:01,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:27:01,284 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:27:01,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 10:27:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:27:01,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:27:01,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:27:01,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:27:01,469 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:27:01,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:27:01,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1299439820] [2024-11-09 10:27:01,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1299439820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:27:01,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:27:01,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:27:01,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474190239] [2024-11-09 10:27:01,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:27:01,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:27:01,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:27:01,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:27:01,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:27:01,520 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 47 [2024-11-09 10:27:01,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:27:01,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:27:01,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 47 [2024-11-09 10:27:01,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:27:01,874 INFO L124 PetriNetUnfolderBase]: 459/871 cut-off events. [2024-11-09 10:27:01,875 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:27:01,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1610 conditions, 871 events. 459/871 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5981 event pairs, 67 based on Foata normal form. 60/910 useless extension candidates. Maximal degree in co-relation 1599. Up to 585 conditions per place. [2024-11-09 10:27:01,886 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 26 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2024-11-09 10:27:01,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 50 transitions, 169 flow [2024-11-09 10:27:01,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:27:01,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:27:01,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-11-09 10:27:01,900 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7375886524822695 [2024-11-09 10:27:01,902 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 97 flow. Second operand 3 states and 104 transitions. [2024-11-09 10:27:01,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 50 transitions, 169 flow [2024-11-09 10:27:01,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:27:01,910 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 88 flow [2024-11-09 10:27:01,912 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-11-09 10:27:01,919 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2024-11-09 10:27:01,919 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 88 flow [2024-11-09 10:27:01,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:27:01,920 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:27:01,920 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:27:01,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 10:27:02,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:27:02,125 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:27:02,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:27:02,126 INFO L85 PathProgramCache]: Analyzing trace with hash -932780667, now seen corresponding path program 1 times [2024-11-09 10:27:02,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:27:02,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132624837] [2024-11-09 10:27:02,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:27:02,127 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:27:02,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:27:02,130 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:27:02,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 10:27:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:27:02,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:27:02,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:27:02,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:27:02,290 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:27:02,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:27:02,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [132624837] [2024-11-09 10:27:02,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [132624837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:27:02,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:27:02,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:27:02,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891632269] [2024-11-09 10:27:02,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:27:02,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:27:02,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:27:02,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:27:02,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:27:02,305 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-11-09 10:27:02,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:27:02,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:27:02,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-11-09 10:27:02,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:27:02,693 INFO L124 PetriNetUnfolderBase]: 1217/2185 cut-off events. [2024-11-09 10:27:02,693 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2024-11-09 10:27:02,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4165 conditions, 2185 events. 1217/2185 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 14615 event pairs, 107 based on Foata normal form. 72/2247 useless extension candidates. Maximal degree in co-relation 4155. Up to 1213 conditions per place. [2024-11-09 10:27:02,711 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 40 selfloop transitions, 5 changer transitions 1/62 dead transitions. [2024-11-09 10:27:02,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 62 transitions, 234 flow [2024-11-09 10:27:02,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:27:02,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:27:02,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2024-11-09 10:27:02,716 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6595744680851063 [2024-11-09 10:27:02,716 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 88 flow. Second operand 4 states and 124 transitions. [2024-11-09 10:27:02,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 62 transitions, 234 flow [2024-11-09 10:27:02,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 62 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:27:02,719 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 118 flow [2024-11-09 10:27:02,719 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2024-11-09 10:27:02,720 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2024-11-09 10:27:02,720 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 118 flow [2024-11-09 10:27:02,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:27:02,721 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:27:02,721 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:27:02,726 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 (3)] Forceful destruction successful, exit code 0 [2024-11-09 10:27:02,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:27:02,922 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:27:02,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:27:02,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1290697696, now seen corresponding path program 1 times [2024-11-09 10:27:02,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:27:02,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [331455705] [2024-11-09 10:27:02,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:27:02,924 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:27:02,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:27:02,925 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:27:02,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 10:27:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:27:03,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:27:03,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:27:03,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:27:03,060 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:27:03,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:27:03,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [331455705] [2024-11-09 10:27:03,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [331455705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:27:03,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:27:03,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:27:03,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991998442] [2024-11-09 10:27:03,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:27:03,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:27:03,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:27:03,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:27:03,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:27:03,072 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-11-09 10:27:03,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:27:03,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:27:03,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-11-09 10:27:03,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:27:03,397 INFO L124 PetriNetUnfolderBase]: 801/1451 cut-off events. [2024-11-09 10:27:03,398 INFO L125 PetriNetUnfolderBase]: For 366/366 co-relation queries the response was YES. [2024-11-09 10:27:03,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3217 conditions, 1451 events. 801/1451 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8495 event pairs, 41 based on Foata normal form. 64/1505 useless extension candidates. Maximal degree in co-relation 3205. Up to 625 conditions per place. [2024-11-09 10:27:03,409 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 50 selfloop transitions, 8 changer transitions 1/75 dead transitions. [2024-11-09 10:27:03,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 75 transitions, 323 flow [2024-11-09 10:27:03,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:27:03,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:27:03,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2024-11-09 10:27:03,412 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6638297872340425 [2024-11-09 10:27:03,412 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 118 flow. Second operand 5 states and 156 transitions. [2024-11-09 10:27:03,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 75 transitions, 323 flow [2024-11-09 10:27:03,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 75 transitions, 313 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-09 10:27:03,415 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 158 flow [2024-11-09 10:27:03,415 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2024-11-09 10:27:03,416 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2024-11-09 10:27:03,416 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 158 flow [2024-11-09 10:27:03,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:27:03,417 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:27:03,417 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-09 10:27:03,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 10:27:03,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:27:03,621 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:27:03,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:27:03,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1207460388, now seen corresponding path program 1 times [2024-11-09 10:27:03,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:27:03,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1493209878] [2024-11-09 10:27:03,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:27:03,623 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:27:03,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:27:03,625 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:27:03,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 10:27:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:27:03,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:27:03,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:27:03,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:27:03,809 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:27:03,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:27:03,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1493209878] [2024-11-09 10:27:03,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1493209878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:27:03,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:27:03,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:27:03,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665715648] [2024-11-09 10:27:03,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:27:03,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:27:03,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:27:03,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:27:03,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:27:03,822 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 47 [2024-11-09 10:27:03,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:27:03,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:27:03,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 47 [2024-11-09 10:27:03,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:27:04,101 INFO L124 PetriNetUnfolderBase]: 423/737 cut-off events. [2024-11-09 10:27:04,102 INFO L125 PetriNetUnfolderBase]: For 644/644 co-relation queries the response was YES. [2024-11-09 10:27:04,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1927 conditions, 737 events. 423/737 cut-off events. For 644/644 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3325 event pairs, 29 based on Foata normal form. 36/763 useless extension candidates. Maximal degree in co-relation 1913. Up to 268 conditions per place. [2024-11-09 10:27:04,107 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 44 selfloop transitions, 11 changer transitions 1/72 dead transitions. [2024-11-09 10:27:04,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 72 transitions, 334 flow [2024-11-09 10:27:04,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:27:04,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:27:04,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 172 transitions. [2024-11-09 10:27:04,109 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6099290780141844 [2024-11-09 10:27:04,109 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 158 flow. Second operand 6 states and 172 transitions. [2024-11-09 10:27:04,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 72 transitions, 334 flow [2024-11-09 10:27:04,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 72 transitions, 309 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-09 10:27:04,114 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 172 flow [2024-11-09 10:27:04,114 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2024-11-09 10:27:04,115 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2024-11-09 10:27:04,115 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 172 flow [2024-11-09 10:27:04,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:27:04,116 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:27:04,116 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:27:04,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 10:27:04,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:27:04,316 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:27:04,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:27:04,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1273383288, now seen corresponding path program 1 times [2024-11-09 10:27:04,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:27:04,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [214742094] [2024-11-09 10:27:04,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:27:04,318 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:27:04,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:27:04,320 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:27:04,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 10:27:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:27:04,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:27:04,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:27:04,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:27:04,561 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:27:04,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:27:04,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [214742094] [2024-11-09 10:27:04,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [214742094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:27:04,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:27:04,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:27:04,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130235443] [2024-11-09 10:27:04,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:27:04,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:27:04,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:27:04,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:27:04,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:27:04,566 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-11-09 10:27:04,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:27:04,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:27:04,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-11-09 10:27:04,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:27:04,654 INFO L124 PetriNetUnfolderBase]: 204/442 cut-off events. [2024-11-09 10:27:04,654 INFO L125 PetriNetUnfolderBase]: For 195/205 co-relation queries the response was YES. [2024-11-09 10:27:04,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 984 conditions, 442 events. 204/442 cut-off events. For 195/205 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2128 event pairs, 189 based on Foata normal form. 8/413 useless extension candidates. Maximal degree in co-relation 969. Up to 328 conditions per place. [2024-11-09 10:27:04,658 INFO L140 encePairwiseOnDemand]: 45/47 looper letters, 17 selfloop transitions, 1 changer transitions 1/44 dead transitions. [2024-11-09 10:27:04,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 44 transitions, 208 flow [2024-11-09 10:27:04,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:27:04,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:27:04,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2024-11-09 10:27:04,659 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6099290780141844 [2024-11-09 10:27:04,659 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 172 flow. Second operand 3 states and 86 transitions. [2024-11-09 10:27:04,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 44 transitions, 208 flow [2024-11-09 10:27:04,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 44 transitions, 152 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-11-09 10:27:04,665 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 114 flow [2024-11-09 10:27:04,665 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2024-11-09 10:27:04,666 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2024-11-09 10:27:04,667 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 114 flow [2024-11-09 10:27:04,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:27:04,668 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:27:04,668 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:27:04,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-09 10:27:04,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:27:04,869 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:27:04,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:27:04,870 INFO L85 PathProgramCache]: Analyzing trace with hash 2010173773, now seen corresponding path program 1 times [2024-11-09 10:27:04,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:27:04,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341440472] [2024-11-09 10:27:04,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:27:04,870 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:27:04,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:27:04,872 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:27:04,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 10:27:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:27:04,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:27:04,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:27:05,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:27:05,027 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:27:05,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:27:05,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1341440472] [2024-11-09 10:27:05,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1341440472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:27:05,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:27:05,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:27:05,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840935341] [2024-11-09 10:27:05,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:27:05,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:27:05,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:27:05,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:27:05,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:27:05,046 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-11-09 10:27:05,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:27:05,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:27:05,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-11-09 10:27:05,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:27:05,304 INFO L124 PetriNetUnfolderBase]: 572/1151 cut-off events. [2024-11-09 10:27:05,304 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:27:05,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2214 conditions, 1151 events. 572/1151 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6618 event pairs, 248 based on Foata normal form. 8/1093 useless extension candidates. Maximal degree in co-relation 2207. Up to 450 conditions per place. [2024-11-09 10:27:05,310 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 29 selfloop transitions, 2 changer transitions 13/66 dead transitions. [2024-11-09 10:27:05,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 66 transitions, 252 flow [2024-11-09 10:27:05,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:27:05,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:27:05,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2024-11-09 10:27:05,312 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6170212765957447 [2024-11-09 10:27:05,312 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 114 flow. Second operand 5 states and 145 transitions. [2024-11-09 10:27:05,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 66 transitions, 252 flow [2024-11-09 10:27:05,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 66 transitions, 251 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:27:05,314 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 125 flow [2024-11-09 10:27:05,314 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2024-11-09 10:27:05,315 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2024-11-09 10:27:05,315 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 125 flow [2024-11-09 10:27:05,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:27:05,315 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:27:05,315 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:27:05,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 10:27:05,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:27:05,516 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:27:05,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:27:05,517 INFO L85 PathProgramCache]: Analyzing trace with hash 957649663, now seen corresponding path program 2 times [2024-11-09 10:27:05,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:27:05,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1609858256] [2024-11-09 10:27:05,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:27:05,518 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:27:05,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:27:05,519 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:27:05,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 10:27:05,613 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 10:27:05,614 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:27:05,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:27:05,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:27:05,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:27:05,689 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:27:05,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:27:05,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1609858256] [2024-11-09 10:27:05,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1609858256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:27:05,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:27:05,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:27:05,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756091207] [2024-11-09 10:27:05,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:27:05,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:27:05,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:27:05,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:27:05,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:27:05,699 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 47 [2024-11-09 10:27:05,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 125 flow. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:27:05,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:27:05,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 47 [2024-11-09 10:27:05,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:27:05,939 INFO L124 PetriNetUnfolderBase]: 382/833 cut-off events. [2024-11-09 10:27:05,940 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-09 10:27:05,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1654 conditions, 833 events. 382/833 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4323 event pairs, 115 based on Foata normal form. 8/783 useless extension candidates. Maximal degree in co-relation 1644. Up to 365 conditions per place. [2024-11-09 10:27:05,944 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 23 selfloop transitions, 1 changer transitions 23/69 dead transitions. [2024-11-09 10:27:05,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 69 transitions, 279 flow [2024-11-09 10:27:05,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:27:05,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:27:05,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2024-11-09 10:27:05,945 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2024-11-09 10:27:05,946 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 125 flow. Second operand 6 states and 168 transitions. [2024-11-09 10:27:05,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 69 transitions, 279 flow [2024-11-09 10:27:05,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 69 transitions, 265 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-09 10:27:05,948 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 126 flow [2024-11-09 10:27:05,949 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=126, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2024-11-09 10:27:05,949 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2024-11-09 10:27:05,949 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 126 flow [2024-11-09 10:27:05,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:27:05,950 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:27:05,950 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:27:05,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 10:27:06,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:27:06,155 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:27:06,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:27:06,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1033876255, now seen corresponding path program 3 times [2024-11-09 10:27:06,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:27:06,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745959369] [2024-11-09 10:27:06,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:27:06,157 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:27:06,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:27:06,160 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-09 10:27:06,161 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-09 10:27:06,256 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-09 10:27:06,257 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:27:06,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 10:27:06,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:27:07,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-09 10:27:07,064 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:27:07,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:27:07,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745959369] [2024-11-09 10:27:07,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1745959369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:27:07,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:27:07,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 10:27:07,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132314071] [2024-11-09 10:27:07,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:27:07,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 10:27:07,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:27:07,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 10:27:07,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 10:27:07,096 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 47 [2024-11-09 10:27:07,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 126 flow. Second operand has 9 states, 9 states have (on average 23.77777777777778) internal successors, (214), 9 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:27:07,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:27:07,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 47 [2024-11-09 10:27:07,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:27:07,482 INFO L124 PetriNetUnfolderBase]: 304/658 cut-off events. [2024-11-09 10:27:07,482 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 10:27:07,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1302 conditions, 658 events. 304/658 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3262 event pairs, 42 based on Foata normal form. 8/611 useless extension candidates. Maximal degree in co-relation 1291. Up to 103 conditions per place. [2024-11-09 10:27:07,486 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 22 selfloop transitions, 5 changer transitions 24/75 dead transitions. [2024-11-09 10:27:07,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 75 transitions, 296 flow [2024-11-09 10:27:07,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:27:07,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-09 10:27:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 272 transitions. [2024-11-09 10:27:07,488 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5787234042553191 [2024-11-09 10:27:07,488 INFO L175 Difference]: Start difference. First operand has 59 places, 43 transitions, 126 flow. Second operand 10 states and 272 transitions. [2024-11-09 10:27:07,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 75 transitions, 296 flow [2024-11-09 10:27:07,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 75 transitions, 285 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-09 10:27:07,491 INFO L231 Difference]: Finished difference. Result has 65 places, 43 transitions, 139 flow [2024-11-09 10:27:07,491 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=139, PETRI_PLACES=65, PETRI_TRANSITIONS=43} [2024-11-09 10:27:07,491 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 13 predicate places. [2024-11-09 10:27:07,492 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 43 transitions, 139 flow [2024-11-09 10:27:07,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.77777777777778) internal successors, (214), 9 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:27:07,492 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:27:07,492 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:27:07,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-09 10:27:07,692 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-09 10:27:07,693 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-09 10:27:07,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:27:07,694 INFO L85 PathProgramCache]: Analyzing trace with hash -800497255, now seen corresponding path program 4 times [2024-11-09 10:27:07,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:27:07,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179291978] [2024-11-09 10:27:07,696 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 10:27:07,696 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:27:07,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:27:07,699 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-09 10:27:07,701 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-09 10:27:07,809 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 10:27:07,809 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-09 10:27:07,809 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:27:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:27:07,971 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 10:27:07,971 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:27:07,972 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-09 10:27:07,974 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-09 10:27:07,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-09 10:27:07,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-09 10:27:07,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-09 10:27:07,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-09 10:27:07,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-09 10:27:07,982 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-09 10:27:08,176 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-09 10:27:08,176 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-11-09 10:27:08,290 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:27:08,290 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:27:08,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:27:08 BasicIcfg [2024-11-09 10:27:08,295 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:27:08,296 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:27:08,296 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:27:08,296 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:27:08,297 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:27:01" (3/4) ... [2024-11-09 10:27:08,298 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:27:08,300 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:27:08,300 INFO L158 Benchmark]: Toolchain (without parser) took 9007.45ms. Allocated memory was 77.6MB in the beginning and 172.0MB in the end (delta: 94.4MB). Free memory was 56.8MB in the beginning and 111.2MB in the end (delta: -54.4MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-09 10:27:08,301 INFO L158 Benchmark]: CDTParser took 1.63ms. Allocated memory is still 50.3MB. Free memory is still 27.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:27:08,301 INFO L158 Benchmark]: CACSL2BoogieTranslator took 655.55ms. Allocated memory is still 77.6MB. Free memory was 56.5MB in the beginning and 49.4MB in the end (delta: 7.1MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2024-11-09 10:27:08,301 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.48ms. Allocated memory is still 77.6MB. Free memory was 49.4MB in the beginning and 46.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:27:08,302 INFO L158 Benchmark]: Boogie Preprocessor took 71.66ms. Allocated memory is still 77.6MB. Free memory was 46.4MB in the beginning and 42.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 10:27:08,302 INFO L158 Benchmark]: RCFGBuilder took 945.81ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 42.7MB in the beginning and 43.3MB in the end (delta: -574.5kB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2024-11-09 10:27:08,302 INFO L158 Benchmark]: TraceAbstraction took 7240.04ms. Allocated memory was 94.4MB in the beginning and 172.0MB in the end (delta: 77.6MB). Free memory was 42.3MB in the beginning and 111.2MB in the end (delta: -68.8MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2024-11-09 10:27:08,303 INFO L158 Benchmark]: Witness Printer took 3.92ms. Allocated memory is still 172.0MB. Free memory is still 111.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:27:08,304 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.63ms. Allocated memory is still 50.3MB. Free memory is still 27.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 655.55ms. Allocated memory is still 77.6MB. Free memory was 56.5MB in the beginning and 49.4MB in the end (delta: 7.1MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.48ms. Allocated memory is still 77.6MB. Free memory was 49.4MB in the beginning and 46.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.66ms. Allocated memory is still 77.6MB. Free memory was 46.4MB in the beginning and 42.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 945.81ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 42.7MB in the beginning and 43.3MB in the end (delta: -574.5kB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * TraceAbstraction took 7240.04ms. Allocated memory was 94.4MB in the beginning and 172.0MB in the end (delta: 77.6MB). Free memory was 42.3MB in the beginning and 111.2MB in the end (delta: -68.8MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * Witness Printer took 3.92ms. Allocated memory is still 172.0MB. Free memory is still 111.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L727] 0 int z = 0; [L728] 0 _Bool z$flush_delayed; [L729] 0 int z$mem_tmp; [L730] 0 _Bool z$r_buff0_thd0; [L731] 0 _Bool z$r_buff0_thd1; [L732] 0 _Bool z$r_buff0_thd2; [L733] 0 _Bool z$r_buff0_thd3; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$read_delayed; [L739] 0 int *z$read_delayed_var; [L740] 0 int z$w_buff0; [L741] 0 _Bool z$w_buff0_used; [L742] 0 int z$w_buff1; [L743] 0 _Bool z$w_buff1_used; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L851] 0 pthread_t t284; [L852] FCALL, FORK 0 pthread_create(&t284, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t284=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L853] 0 pthread_t t285; [L854] FCALL, FORK 0 pthread_create(&t285, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t284=0, t285=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L855] 0 pthread_t t286; [L856] FCALL, FORK 0 pthread_create(&t286, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t284=0, t285=1, t286=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L798] 3 z$w_buff1 = z$w_buff0 [L799] 3 z$w_buff0 = 1 [L800] 3 z$w_buff1_used = z$w_buff0_used [L801] 3 z$w_buff0_used = (_Bool)1 [L802] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L802] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 3 z$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 z$flush_delayed = weak$$choice2 [L813] 3 z$mem_tmp = z [L814] 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) [L815] 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)) [L816] 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)) [L817] 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)) [L818] 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)) [L819] 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)) [L820] 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)) [L821] 3 __unbuffered_p2_EAX = z [L822] 3 z = z$flush_delayed ? z$mem_tmp : z [L823] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L826] 3 __unbuffered_p2_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L749] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L752] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L764] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L767] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L770] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L773] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 2 z$flush_delayed = weak$$choice2 [L776] 2 z$mem_tmp = z [L777] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L778] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L779] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L780] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L781] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L783] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 __unbuffered_p1_EBX = z [L785] 2 z = z$flush_delayed ? z$mem_tmp : z [L786] 2 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L829] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L830] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L831] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L832] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L833] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L836] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L858] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t284=0, t285=1, t286=2, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L860] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L860] RET 0 assume_abort_if_not(main$tmp_guard0) [L862] 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) [L863] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L864] 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 [L865] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L866] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t284=0, t285=1, t286=2, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t284=0, t285=1, t286=2, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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", "mix011.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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: 849]: 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 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: 852]: 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: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 74 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 284 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 261 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 67 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 998 IncrementalHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 8 mSDtfsCounter, 998 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 208 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred in iteration=4, InterpolantAutomatonStates: 42, 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, 1.2s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 193 ConstructedInterpolants, 0 QuantifiedInterpolants, 760 SizeOfPredicates, 16 NumberOfNonLiveVariables, 930 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 10:27:08,338 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