./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-atomic/szymanski.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-atomic/szymanski.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 a3cd4be37ada319d324d40d8d6c18fff519996a186a93f33b3070275487295e3 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:22:57,779 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:22:57,852 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:22:57,858 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:22:57,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:22:57,903 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:22:57,905 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:22:57,905 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:22:57,906 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:22:57,906 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:22:57,907 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:22:57,907 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:22:57,907 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:22:57,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:22:57,908 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:22:57,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:22:57,909 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:22:57,909 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:22:57,911 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:22:57,911 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:22:57,911 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:22:57,912 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:22:57,912 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:22:57,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:22:57,913 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:22:57,913 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:22:57,913 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:22:57,914 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:22:57,914 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:22:57,914 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:22:57,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:22:57,915 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:22:57,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:22:57,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:22:57,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:22:57,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:22:57,916 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:22:57,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:22:57,917 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:22:57,917 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:22:57,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:22:57,918 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:22:57,918 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 -> a3cd4be37ada319d324d40d8d6c18fff519996a186a93f33b3070275487295e3 [2024-11-09 10:22:58,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:22:58,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:22:58,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:22:58,192 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:22:58,192 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:22:58,193 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/szymanski.i [2024-11-09 10:22:59,732 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:23:00,033 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:23:00,034 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/szymanski.i [2024-11-09 10:23:00,056 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31165fcea/0fe797c9979d4cd08fc1f9cd6492f19f/FLAGe2891dea9 [2024-11-09 10:23:00,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31165fcea/0fe797c9979d4cd08fc1f9cd6492f19f [2024-11-09 10:23:00,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:23:00,079 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:23:00,082 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:23:00,082 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:23:00,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:23:00,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:23:00" (1/1) ... [2024-11-09 10:23:00,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dc8f82b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:00, skipping insertion in model container [2024-11-09 10:23:00,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:23:00" (1/1) ... [2024-11-09 10:23:00,133 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:23:00,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:23:00,482 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:23:00,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:23:00,576 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:23:00,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:00 WrapperNode [2024-11-09 10:23:00,577 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:23:00,578 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:23:00,578 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:23:00,578 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:23:00,585 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:23:00" (1/1) ... [2024-11-09 10:23:00,599 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:23:00" (1/1) ... [2024-11-09 10:23:00,621 INFO L138 Inliner]: procedures = 166, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 101 [2024-11-09 10:23:00,623 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:23:00,623 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:23:00,624 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:23:00,624 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:23:00,632 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:00" (1/1) ... [2024-11-09 10:23:00,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:00" (1/1) ... [2024-11-09 10:23:00,635 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:00" (1/1) ... [2024-11-09 10:23:00,649 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:23:00,650 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:00" (1/1) ... [2024-11-09 10:23:00,650 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:00" (1/1) ... [2024-11-09 10:23:00,654 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:00" (1/1) ... [2024-11-09 10:23:00,659 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:00" (1/1) ... [2024-11-09 10:23:00,661 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:00" (1/1) ... [2024-11-09 10:23:00,662 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:00" (1/1) ... [2024-11-09 10:23:00,666 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:23:00,667 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:23:00,667 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:23:00,667 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:23:00,668 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:00" (1/1) ... [2024-11-09 10:23:00,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:23:00,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:23:00,714 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:23:00,721 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:23:00,769 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-11-09 10:23:00,769 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-11-09 10:23:00,769 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-09 10:23:00,769 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-09 10:23:00,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:23:00,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:23:00,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:23:00,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:23:00,771 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:23:00,918 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:23:00,920 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:23:01,074 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:23:01,074 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:23:01,169 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:23:01,169 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-09 10:23:01,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:23:01 BoogieIcfgContainer [2024-11-09 10:23:01,170 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:23:01,175 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:23:01,176 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:23:01,179 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:23:01,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:23:00" (1/3) ... [2024-11-09 10:23:01,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31791629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:23:01, skipping insertion in model container [2024-11-09 10:23:01,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:00" (2/3) ... [2024-11-09 10:23:01,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31791629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:23:01, skipping insertion in model container [2024-11-09 10:23:01,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:23:01" (3/3) ... [2024-11-09 10:23:01,185 INFO L112 eAbstractionObserver]: Analyzing ICFG szymanski.i [2024-11-09 10:23:01,217 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:23:01,221 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-09 10:23:01,222 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:23:01,283 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 10:23:01,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 60 transitions, 134 flow [2024-11-09 10:23:01,352 INFO L124 PetriNetUnfolderBase]: 14/58 cut-off events. [2024-11-09 10:23:01,352 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:23:01,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 58 events. 14/58 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 97 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 53. Up to 3 conditions per place. [2024-11-09 10:23:01,363 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 60 transitions, 134 flow [2024-11-09 10:23:01,367 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 57 transitions, 126 flow [2024-11-09 10:23:01,381 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:23:01,389 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;@169f6286, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:23:01,390 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 10:23:01,400 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:23:01,401 INFO L124 PetriNetUnfolderBase]: 11/40 cut-off events. [2024-11-09 10:23:01,401 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:23:01,401 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:23:01,402 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:23:01,403 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:23:01,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:23:01,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1580070394, now seen corresponding path program 1 times [2024-11-09 10:23:01,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:23:01,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786822074] [2024-11-09 10:23:01,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:23:01,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:23:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:23:01,680 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:23:01,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:23:01,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786822074] [2024-11-09 10:23:01,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786822074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:23:01,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:23:01,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:23:01,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88363087] [2024-11-09 10:23:01,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:23:01,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:23:01,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:23:01,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:23:01,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:23:01,735 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 60 [2024-11-09 10:23:01,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:23:01,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:23:01,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 60 [2024-11-09 10:23:01,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:23:01,901 INFO L124 PetriNetUnfolderBase]: 238/526 cut-off events. [2024-11-09 10:23:01,902 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-09 10:23:01,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 907 conditions, 526 events. 238/526 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2757 event pairs, 60 based on Foata normal form. 81/544 useless extension candidates. Maximal degree in co-relation 822. Up to 177 conditions per place. [2024-11-09 10:23:01,912 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 28 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2024-11-09 10:23:01,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 62 transitions, 204 flow [2024-11-09 10:23:01,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:23:01,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:23:01,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2024-11-09 10:23:01,925 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8 [2024-11-09 10:23:01,928 INFO L175 Difference]: Start difference. First operand has 50 places, 57 transitions, 126 flow. Second operand 3 states and 144 transitions. [2024-11-09 10:23:01,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 62 transitions, 204 flow [2024-11-09 10:23:01,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 62 transitions, 192 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:23:01,939 INFO L231 Difference]: Finished difference. Result has 48 places, 52 transitions, 126 flow [2024-11-09 10:23:01,942 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=48, PETRI_TRANSITIONS=52} [2024-11-09 10:23:01,948 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2024-11-09 10:23:01,948 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 52 transitions, 126 flow [2024-11-09 10:23:01,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:23:01,948 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:23:01,949 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:23:01,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:23:01,949 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr2Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:23:01,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:23:01,950 INFO L85 PathProgramCache]: Analyzing trace with hash -232144531, now seen corresponding path program 1 times [2024-11-09 10:23:01,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:23:01,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573592517] [2024-11-09 10:23:01,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:23:01,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:23:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:23:02,051 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:23:02,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:23:02,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573592517] [2024-11-09 10:23:02,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573592517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:23:02,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:23:02,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:23:02,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27921647] [2024-11-09 10:23:02,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:23:02,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:23:02,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:23:02,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:23:02,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:23:02,060 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 60 [2024-11-09 10:23:02,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 52 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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:23:02,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:23:02,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 60 [2024-11-09 10:23:02,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:23:02,216 INFO L124 PetriNetUnfolderBase]: 233/513 cut-off events. [2024-11-09 10:23:02,216 INFO L125 PetriNetUnfolderBase]: For 137/137 co-relation queries the response was YES. [2024-11-09 10:23:02,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 984 conditions, 513 events. 233/513 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2554 event pairs, 82 based on Foata normal form. 23/500 useless extension candidates. Maximal degree in co-relation 326. Up to 215 conditions per place. [2024-11-09 10:23:02,224 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 28 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2024-11-09 10:23:02,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 61 transitions, 206 flow [2024-11-09 10:23:02,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:23:02,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:23:02,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2024-11-09 10:23:02,226 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7611111111111111 [2024-11-09 10:23:02,226 INFO L175 Difference]: Start difference. First operand has 48 places, 52 transitions, 126 flow. Second operand 3 states and 137 transitions. [2024-11-09 10:23:02,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 61 transitions, 206 flow [2024-11-09 10:23:02,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 61 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:23:02,230 INFO L231 Difference]: Finished difference. Result has 49 places, 52 transitions, 130 flow [2024-11-09 10:23:02,230 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=49, PETRI_TRANSITIONS=52} [2024-11-09 10:23:02,231 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2024-11-09 10:23:02,231 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 52 transitions, 130 flow [2024-11-09 10:23:02,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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:23:02,232 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:23:02,232 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:23:02,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:23:02,233 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:23:02,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:23:02,233 INFO L85 PathProgramCache]: Analyzing trace with hash 400050575, now seen corresponding path program 1 times [2024-11-09 10:23:02,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:23:02,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076096202] [2024-11-09 10:23:02,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:23:02,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:23:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:23:02,292 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:23:02,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:23:02,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076096202] [2024-11-09 10:23:02,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076096202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:23:02,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:23:02,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:23:02,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090126296] [2024-11-09 10:23:02,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:23:02,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:23:02,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:23:02,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:23:02,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:23:02,315 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 60 [2024-11-09 10:23:02,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 52 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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:23:02,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:23:02,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 60 [2024-11-09 10:23:02,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:23:02,434 INFO L124 PetriNetUnfolderBase]: 374/713 cut-off events. [2024-11-09 10:23:02,434 INFO L125 PetriNetUnfolderBase]: For 365/365 co-relation queries the response was YES. [2024-11-09 10:23:02,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1383 conditions, 713 events. 374/713 cut-off events. For 365/365 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3252 event pairs, 156 based on Foata normal form. 43/680 useless extension candidates. Maximal degree in co-relation 617. Up to 376 conditions per place. [2024-11-09 10:23:02,440 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 33 selfloop transitions, 6 changer transitions 2/64 dead transitions. [2024-11-09 10:23:02,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 64 transitions, 238 flow [2024-11-09 10:23:02,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:23:02,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:23:02,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2024-11-09 10:23:02,442 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7277777777777777 [2024-11-09 10:23:02,443 INFO L175 Difference]: Start difference. First operand has 49 places, 52 transitions, 130 flow. Second operand 3 states and 131 transitions. [2024-11-09 10:23:02,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 64 transitions, 238 flow [2024-11-09 10:23:02,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 64 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:23:02,445 INFO L231 Difference]: Finished difference. Result has 49 places, 54 transitions, 172 flow [2024-11-09 10:23:02,446 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=49, PETRI_TRANSITIONS=54} [2024-11-09 10:23:02,446 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2024-11-09 10:23:02,447 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 54 transitions, 172 flow [2024-11-09 10:23:02,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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:23:02,447 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:23:02,447 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:23:02,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:23:02,448 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr2Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:23:02,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:23:02,448 INFO L85 PathProgramCache]: Analyzing trace with hash 939123319, now seen corresponding path program 1 times [2024-11-09 10:23:02,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:23:02,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581306148] [2024-11-09 10:23:02,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:23:02,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:23:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:23:02,517 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:23:02,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:23:02,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581306148] [2024-11-09 10:23:02,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581306148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:23:02,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:23:02,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:23:02,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976747387] [2024-11-09 10:23:02,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:23:02,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:23:02,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:23:02,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:23:02,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:23:02,532 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2024-11-09 10:23:02,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 54 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:23:02,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:23:02,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2024-11-09 10:23:02,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:23:02,646 INFO L124 PetriNetUnfolderBase]: 457/848 cut-off events. [2024-11-09 10:23:02,647 INFO L125 PetriNetUnfolderBase]: For 427/430 co-relation queries the response was YES. [2024-11-09 10:23:02,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1966 conditions, 848 events. 457/848 cut-off events. For 427/430 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3995 event pairs, 192 based on Foata normal form. 37/845 useless extension candidates. Maximal degree in co-relation 768. Up to 568 conditions per place. [2024-11-09 10:23:02,654 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 39 selfloop transitions, 5 changer transitions 2/66 dead transitions. [2024-11-09 10:23:02,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 300 flow [2024-11-09 10:23:02,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:23:02,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:23:02,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2024-11-09 10:23:02,656 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2024-11-09 10:23:02,656 INFO L175 Difference]: Start difference. First operand has 49 places, 54 transitions, 172 flow. Second operand 3 states and 125 transitions. [2024-11-09 10:23:02,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 300 flow [2024-11-09 10:23:02,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 66 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:23:02,661 INFO L231 Difference]: Finished difference. Result has 51 places, 56 transitions, 206 flow [2024-11-09 10:23:02,662 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=51, PETRI_TRANSITIONS=56} [2024-11-09 10:23:02,662 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2024-11-09 10:23:02,663 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 56 transitions, 206 flow [2024-11-09 10:23:02,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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:23:02,663 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:23:02,663 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:23:02,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:23:02,664 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:23:02,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:23:02,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1469449463, now seen corresponding path program 2 times [2024-11-09 10:23:02,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:23:02,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119776936] [2024-11-09 10:23:02,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:23:02,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:23:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:23:02,729 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:23:02,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:23:02,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119776936] [2024-11-09 10:23:02,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119776936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:23:02,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:23:02,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:23:02,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225480655] [2024-11-09 10:23:02,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:23:02,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:23:02,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:23:02,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:23:02,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:23:02,756 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 60 [2024-11-09 10:23:02,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 56 transitions, 206 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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:23:02,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:23:02,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 60 [2024-11-09 10:23:02,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:23:02,869 INFO L124 PetriNetUnfolderBase]: 416/797 cut-off events. [2024-11-09 10:23:02,870 INFO L125 PetriNetUnfolderBase]: For 575/591 co-relation queries the response was YES. [2024-11-09 10:23:02,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1981 conditions, 797 events. 416/797 cut-off events. For 575/591 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3799 event pairs, 156 based on Foata normal form. 20/781 useless extension candidates. Maximal degree in co-relation 832. Up to 330 conditions per place. [2024-11-09 10:23:02,878 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 34 selfloop transitions, 9 changer transitions 2/68 dead transitions. [2024-11-09 10:23:02,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 68 transitions, 334 flow [2024-11-09 10:23:02,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:23:02,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:23:02,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2024-11-09 10:23:02,880 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2024-11-09 10:23:02,880 INFO L175 Difference]: Start difference. First operand has 51 places, 56 transitions, 206 flow. Second operand 3 states and 128 transitions. [2024-11-09 10:23:02,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 68 transitions, 334 flow [2024-11-09 10:23:02,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 68 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:23:02,886 INFO L231 Difference]: Finished difference. Result has 53 places, 59 transitions, 262 flow [2024-11-09 10:23:02,886 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=53, PETRI_TRANSITIONS=59} [2024-11-09 10:23:02,887 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2024-11-09 10:23:02,889 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 59 transitions, 262 flow [2024-11-09 10:23:02,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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:23:02,890 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:23:02,890 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:23:02,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:23:02,891 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr2Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:23:02,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:23:02,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1528938777, now seen corresponding path program 3 times [2024-11-09 10:23:02,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:23:02,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682762718] [2024-11-09 10:23:02,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:23:02,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:23:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:23:02,950 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:23:02,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:23:02,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682762718] [2024-11-09 10:23:02,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682762718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:23:02,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:23:02,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:23:02,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717761351] [2024-11-09 10:23:02,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:23:02,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:23:02,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:23:02,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:23:02,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:23:02,976 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 60 [2024-11-09 10:23:02,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 59 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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:23:02,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:23:02,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 60 [2024-11-09 10:23:02,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:23:03,039 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([328] L742-1-->L744: Formula: (and (< v_~flag2~0_25 2) (= v_~x~0_22 0)) InVars {~flag2~0=v_~flag2~0_25} OutVars{~x~0=v_~x~0_22, ~flag2~0=v_~flag2~0_25} AuxVars[] AssignedVars[~x~0][21], [Black: 63#(= ~x~0 1), 33#L769true, Black: 65#true, 77#(<= 3 ~flag1~0), 3#L751-1true, 80#true, Black: 72#(= ~flag1~0 1), Black: 56#true, Black: 75#true, 23#L744true]) [2024-11-09 10:23:03,040 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-11-09 10:23:03,040 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-11-09 10:23:03,040 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2024-11-09 10:23:03,040 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-11-09 10:23:03,091 INFO L124 PetriNetUnfolderBase]: 481/892 cut-off events. [2024-11-09 10:23:03,092 INFO L125 PetriNetUnfolderBase]: For 757/821 co-relation queries the response was YES. [2024-11-09 10:23:03,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2219 conditions, 892 events. 481/892 cut-off events. For 757/821 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4256 event pairs, 173 based on Foata normal form. 55/878 useless extension candidates. Maximal degree in co-relation 1134. Up to 407 conditions per place. [2024-11-09 10:23:03,100 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 35 selfloop transitions, 6 changer transitions 1/71 dead transitions. [2024-11-09 10:23:03,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 71 transitions, 384 flow [2024-11-09 10:23:03,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:23:03,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:23:03,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2024-11-09 10:23:03,102 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7166666666666667 [2024-11-09 10:23:03,103 INFO L175 Difference]: Start difference. First operand has 53 places, 59 transitions, 262 flow. Second operand 3 states and 129 transitions. [2024-11-09 10:23:03,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 71 transitions, 384 flow [2024-11-09 10:23:03,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 71 transitions, 360 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-09 10:23:03,109 INFO L231 Difference]: Finished difference. Result has 52 places, 61 transitions, 286 flow [2024-11-09 10:23:03,109 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=286, PETRI_PLACES=52, PETRI_TRANSITIONS=61} [2024-11-09 10:23:03,110 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2024-11-09 10:23:03,110 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 61 transitions, 286 flow [2024-11-09 10:23:03,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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:23:03,110 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:23:03,110 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] [2024-11-09 10:23:03,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:23:03,111 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:23:03,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:23:03,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1784019535, now seen corresponding path program 1 times [2024-11-09 10:23:03,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:23:03,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385583516] [2024-11-09 10:23:03,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:23:03,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:23:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:23:03,165 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:23:03,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:23:03,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385583516] [2024-11-09 10:23:03,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385583516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:23:03,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:23:03,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:23:03,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924573456] [2024-11-09 10:23:03,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:23:03,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:23:03,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:23:03,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:23:03,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:23:03,191 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2024-11-09 10:23:03,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 61 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:23:03,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:23:03,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2024-11-09 10:23:03,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:23:03,318 INFO L124 PetriNetUnfolderBase]: 556/992 cut-off events. [2024-11-09 10:23:03,319 INFO L125 PetriNetUnfolderBase]: For 877/954 co-relation queries the response was YES. [2024-11-09 10:23:03,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2712 conditions, 992 events. 556/992 cut-off events. For 877/954 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4657 event pairs, 233 based on Foata normal form. 42/978 useless extension candidates. Maximal degree in co-relation 1895. Up to 638 conditions per place. [2024-11-09 10:23:03,328 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 42 selfloop transitions, 5 changer transitions 1/74 dead transitions. [2024-11-09 10:23:03,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 74 transitions, 430 flow [2024-11-09 10:23:03,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:23:03,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:23:03,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2024-11-09 10:23:03,331 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6888888888888889 [2024-11-09 10:23:03,331 INFO L175 Difference]: Start difference. First operand has 52 places, 61 transitions, 286 flow. Second operand 3 states and 124 transitions. [2024-11-09 10:23:03,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 74 transitions, 430 flow [2024-11-09 10:23:03,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 74 transitions, 415 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:23:03,338 INFO L231 Difference]: Finished difference. Result has 52 places, 63 transitions, 315 flow [2024-11-09 10:23:03,338 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=315, PETRI_PLACES=52, PETRI_TRANSITIONS=63} [2024-11-09 10:23:03,340 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2024-11-09 10:23:03,340 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 63 transitions, 315 flow [2024-11-09 10:23:03,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:23:03,341 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:23:03,341 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] [2024-11-09 10:23:03,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:23:03,341 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:23:03,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:23:03,342 INFO L85 PathProgramCache]: Analyzing trace with hash -11957503, now seen corresponding path program 2 times [2024-11-09 10:23:03,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:23:03,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671487310] [2024-11-09 10:23:03,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:23:03,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:23:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:23:03,394 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:23:03,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:23:03,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671487310] [2024-11-09 10:23:03,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671487310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:23:03,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:23:03,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:23:03,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171415897] [2024-11-09 10:23:03,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:23:03,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:23:03,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:23:03,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:23:03,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:23:03,413 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 60 [2024-11-09 10:23:03,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 63 transitions, 315 flow. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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:23:03,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:23:03,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 60 [2024-11-09 10:23:03,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:23:03,541 INFO L124 PetriNetUnfolderBase]: 404/775 cut-off events. [2024-11-09 10:23:03,542 INFO L125 PetriNetUnfolderBase]: For 891/967 co-relation queries the response was YES. [2024-11-09 10:23:03,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2240 conditions, 775 events. 404/775 cut-off events. For 891/967 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3565 event pairs, 141 based on Foata normal form. 45/779 useless extension candidates. Maximal degree in co-relation 1035. Up to 298 conditions per place. [2024-11-09 10:23:03,549 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 35 selfloop transitions, 9 changer transitions 1/74 dead transitions. [2024-11-09 10:23:03,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 74 transitions, 441 flow [2024-11-09 10:23:03,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:23:03,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:23:03,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2024-11-09 10:23:03,551 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-11-09 10:23:03,551 INFO L175 Difference]: Start difference. First operand has 52 places, 63 transitions, 315 flow. Second operand 3 states and 126 transitions. [2024-11-09 10:23:03,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 74 transitions, 441 flow [2024-11-09 10:23:03,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 74 transitions, 431 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:23:03,555 INFO L231 Difference]: Finished difference. Result has 54 places, 66 transitions, 371 flow [2024-11-09 10:23:03,555 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=371, PETRI_PLACES=54, PETRI_TRANSITIONS=66} [2024-11-09 10:23:03,556 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2024-11-09 10:23:03,556 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 66 transitions, 371 flow [2024-11-09 10:23:03,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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:23:03,557 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:23:03,557 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] [2024-11-09 10:23:03,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:23:03,558 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:23:03,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:23:03,558 INFO L85 PathProgramCache]: Analyzing trace with hash 460829169, now seen corresponding path program 3 times [2024-11-09 10:23:03,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:23:03,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123920607] [2024-11-09 10:23:03,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:23:03,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:23:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:23:03,606 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:23:03,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:23:03,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123920607] [2024-11-09 10:23:03,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123920607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:23:03,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:23:03,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:23:03,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486717736] [2024-11-09 10:23:03,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:23:03,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:23:03,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:23:03,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:23:03,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:23:03,610 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 60 [2024-11-09 10:23:03,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 66 transitions, 371 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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:23:03,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:23:03,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 60 [2024-11-09 10:23:03,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:23:03,652 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([304] L758-1-->L760: Formula: (and (< v_~flag1~0_25 2) (= v_~x~0_24 1)) InVars {~flag1~0=v_~flag1~0_25} OutVars{~flag1~0=v_~flag1~0_25, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[~x~0][38], [Black: 80#true, 33#L769true, Black: 67#(<= 4 ~flag1~0), 63#(= ~x~0 1), Black: 87#(= ~flag2~0 1), Black: 72#(= ~flag1~0 1), 22#L739-1true, 50#L760true, 97#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 90#true, 92#(<= 3 ~flag2~0), Black: 77#(<= 3 ~flag1~0)]) [2024-11-09 10:23:03,652 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-11-09 10:23:03,653 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-11-09 10:23:03,653 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-09 10:23:03,653 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-09 10:23:03,654 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([328] L742-1-->L744: Formula: (and (< v_~flag2~0_25 2) (= v_~x~0_22 0)) InVars {~flag2~0=v_~flag2~0_25} OutVars{~x~0=v_~x~0_22, ~flag2~0=v_~flag2~0_25} AuxVars[] AssignedVars[~x~0][25], [9#L755-1true, 33#L769true, Black: 65#true, Black: 82#(<= 4 ~flag2~0), 90#true, Black: 72#(= ~flag1~0 1), Black: 87#(= ~flag2~0 1), Black: 56#true, 97#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 75#true, Black: 92#(<= 3 ~flag2~0), 23#L744true]) [2024-11-09 10:23:03,654 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-11-09 10:23:03,654 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-09 10:23:03,654 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-11-09 10:23:03,654 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-11-09 10:23:03,673 INFO L124 PetriNetUnfolderBase]: 255/545 cut-off events. [2024-11-09 10:23:03,674 INFO L125 PetriNetUnfolderBase]: For 933/995 co-relation queries the response was YES. [2024-11-09 10:23:03,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1701 conditions, 545 events. 255/545 cut-off events. For 933/995 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2600 event pairs, 123 based on Foata normal form. 10/478 useless extension candidates. Maximal degree in co-relation 749. Up to 283 conditions per place. [2024-11-09 10:23:03,676 INFO L140 encePairwiseOnDemand]: 58/60 looper letters, 0 selfloop transitions, 0 changer transitions 65/65 dead transitions. [2024-11-09 10:23:03,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 65 transitions, 413 flow [2024-11-09 10:23:03,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:23:03,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:23:03,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2024-11-09 10:23:03,678 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2024-11-09 10:23:03,678 INFO L175 Difference]: Start difference. First operand has 54 places, 66 transitions, 371 flow. Second operand 3 states and 123 transitions. [2024-11-09 10:23:03,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 65 transitions, 413 flow [2024-11-09 10:23:03,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 65 transitions, 395 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:23:03,681 INFO L231 Difference]: Finished difference. Result has 53 places, 0 transitions, 0 flow [2024-11-09 10:23:03,681 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=53, PETRI_TRANSITIONS=0} [2024-11-09 10:23:03,683 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2024-11-09 10:23:03,683 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 0 transitions, 0 flow [2024-11-09 10:23:03,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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:23:03,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-09 10:23:03,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-09 10:23:03,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-09 10:23:03,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-09 10:23:03,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-09 10:23:03,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-11-09 10:23:03,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-09 10:23:03,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:23:03,689 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1] [2024-11-09 10:23:03,695 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:23:03,696 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:23:03,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:23:03 BasicIcfg [2024-11-09 10:23:03,705 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:23:03,705 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:23:03,706 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:23:03,706 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:23:03,707 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:23:01" (3/4) ... [2024-11-09 10:23:03,709 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 10:23:03,711 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thr2 [2024-11-09 10:23:03,711 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2024-11-09 10:23:03,716 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2024-11-09 10:23:03,716 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-09 10:23:03,716 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 10:23:03,716 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 10:23:03,789 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 10:23:03,789 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 10:23:03,789 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:23:03,790 INFO L158 Benchmark]: Toolchain (without parser) took 3710.71ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 95.3MB in the beginning and 111.1MB in the end (delta: -15.8MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2024-11-09 10:23:03,790 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:23:03,790 INFO L158 Benchmark]: CACSL2BoogieTranslator took 494.99ms. Allocated memory is still 163.6MB. Free memory was 95.0MB in the beginning and 72.8MB in the end (delta: 22.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 10:23:03,791 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.06ms. Allocated memory is still 163.6MB. Free memory was 72.8MB in the beginning and 70.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:23:03,791 INFO L158 Benchmark]: Boogie Preprocessor took 42.86ms. Allocated memory is still 163.6MB. Free memory was 70.9MB in the beginning and 68.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:23:03,791 INFO L158 Benchmark]: RCFGBuilder took 502.89ms. Allocated memory is still 163.6MB. Free memory was 68.7MB in the beginning and 133.0MB in the end (delta: -64.4MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. [2024-11-09 10:23:03,791 INFO L158 Benchmark]: TraceAbstraction took 2529.24ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 132.2MB in the beginning and 115.2MB in the end (delta: 16.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-11-09 10:23:03,792 INFO L158 Benchmark]: Witness Printer took 83.98ms. Allocated memory is still 197.1MB. Free memory was 115.2MB in the beginning and 111.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 10:23:03,793 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.17ms. Allocated memory is still 104.9MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 494.99ms. Allocated memory is still 163.6MB. Free memory was 95.0MB in the beginning and 72.8MB in the end (delta: 22.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.06ms. Allocated memory is still 163.6MB. Free memory was 72.8MB in the beginning and 70.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.86ms. Allocated memory is still 163.6MB. Free memory was 70.9MB in the beginning and 68.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 502.89ms. Allocated memory is still 163.6MB. Free memory was 68.7MB in the beginning and 133.0MB in the end (delta: -64.4MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2529.24ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 132.2MB in the beginning and 115.2MB in the end (delta: 16.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 83.98ms. Allocated memory is still 197.1MB. Free memory was 115.2MB in the beginning and 111.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 765]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 85 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: 2.4s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 194 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 118 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 447 IncrementalHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 38 mSDtfsCounter, 447 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=371occurred in iteration=8, InterpolantAutomatonStates: 27, 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.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 203 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 316 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 10:23:03,825 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: TRUE