./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/triangular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f 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/triangular-2.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 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 15:59:01,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 15:59:01,633 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 15:59:01,638 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 15:59:01,638 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 15:59:01,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 15:59:01,653 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 15:59:01,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 15:59:01,654 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 15:59:01,654 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 15:59:01,655 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 15:59:01,655 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 15:59:01,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 15:59:01,656 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 15:59:01,656 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 15:59:01,656 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 15:59:01,656 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 15:59:01,657 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 15:59:01,657 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 15:59:01,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 15:59:01,657 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 15:59:01,658 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 15:59:01,658 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 15:59:01,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 15:59:01,659 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 15:59:01,659 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 15:59:01,659 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 15:59:01,659 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 15:59:01,660 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 15:59:01,660 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 15:59:01,660 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 15:59:01,660 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 15:59:01,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 15:59:01,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 15:59:01,661 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 15:59:01,661 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 15:59:01,662 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 15:59:01,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 15:59:01,662 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 15:59:01,662 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 15:59:01,663 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 15:59:01,663 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 15:59:01,663 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 -> 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 [2024-11-12 15:59:01,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 15:59:01,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 15:59:01,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 15:59:01,862 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 15:59:01,863 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 15:59:01,863 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-2.i [2024-11-12 15:59:03,032 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 15:59:03,227 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 15:59:03,228 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i [2024-11-12 15:59:03,244 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/088ee0dcf/761b353436a2424087e9fa8e5ae03e4f/FLAG56ea61183 [2024-11-12 15:59:03,257 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/088ee0dcf/761b353436a2424087e9fa8e5ae03e4f [2024-11-12 15:59:03,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 15:59:03,260 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 15:59:03,261 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 15:59:03,261 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 15:59:03,265 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 15:59:03,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:59:03" (1/1) ... [2024-11-12 15:59:03,268 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39faedf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:59:03, skipping insertion in model container [2024-11-12 15:59:03,268 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:59:03" (1/1) ... [2024-11-12 15:59:03,299 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 15:59:03,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 15:59:03,574 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 15:59:03,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 15:59:03,645 INFO L204 MainTranslator]: Completed translation [2024-11-12 15:59:03,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:59:03 WrapperNode [2024-11-12 15:59:03,646 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 15:59:03,647 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 15:59:03,647 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 15:59:03,647 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 15:59:03,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:59:03" (1/1) ... [2024-11-12 15:59:03,663 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:59:03" (1/1) ... [2024-11-12 15:59:03,680 INFO L138 Inliner]: procedures = 168, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2024-11-12 15:59:03,682 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 15:59:03,683 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 15:59:03,683 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 15:59:03,683 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 15:59:03,690 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:59:03" (1/1) ... [2024-11-12 15:59:03,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:59:03" (1/1) ... [2024-11-12 15:59:03,693 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:59:03" (1/1) ... [2024-11-12 15:59:03,708 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-12 15:59:03,709 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:59:03" (1/1) ... [2024-11-12 15:59:03,709 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:59:03" (1/1) ... [2024-11-12 15:59:03,713 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:59:03" (1/1) ... [2024-11-12 15:59:03,718 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:59:03" (1/1) ... [2024-11-12 15:59:03,719 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:59:03" (1/1) ... [2024-11-12 15:59:03,719 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:59:03" (1/1) ... [2024-11-12 15:59:03,721 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 15:59:03,721 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 15:59:03,721 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 15:59:03,722 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 15:59:03,726 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:59:03" (1/1) ... [2024-11-12 15:59:03,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 15:59:03,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 15:59:03,754 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-12 15:59:03,757 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-12 15:59:03,791 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-12 15:59:03,792 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-12 15:59:03,792 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-12 15:59:03,792 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-12 15:59:03,792 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-12 15:59:03,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 15:59:03,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 15:59:03,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-12 15:59:03,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 15:59:03,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 15:59:03,795 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 15:59:03,885 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 15:59:03,887 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 15:59:03,989 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 15:59:03,989 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 15:59:04,065 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 15:59:04,067 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 15:59:04,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:59:04 BoogieIcfgContainer [2024-11-12 15:59:04,067 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 15:59:04,069 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 15:59:04,070 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 15:59:04,073 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 15:59:04,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:59:03" (1/3) ... [2024-11-12 15:59:04,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4704e45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:59:04, skipping insertion in model container [2024-11-12 15:59:04,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:59:03" (2/3) ... [2024-11-12 15:59:04,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4704e45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:59:04, skipping insertion in model container [2024-11-12 15:59:04,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:59:04" (3/3) ... [2024-11-12 15:59:04,075 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2024-11-12 15:59:04,088 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 15:59:04,088 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 15:59:04,088 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 15:59:04,121 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-12 15:59:04,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 66 flow [2024-11-12 15:59:04,182 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2024-11-12 15:59:04,182 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 15:59:04,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 27 events. 4/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2024-11-12 15:59:04,186 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 66 flow [2024-11-12 15:59:04,188 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 27 transitions, 60 flow [2024-11-12 15:59:04,199 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 15:59:04,205 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;@51d3aca2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 15:59:04,205 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-12 15:59:04,216 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 15:59:04,218 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2024-11-12 15:59:04,218 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 15:59:04,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 15:59:04,219 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:59:04,219 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 15:59:04,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:59:04,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1038261642, now seen corresponding path program 1 times [2024-11-12 15:59:04,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:59:04,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173564968] [2024-11-12 15:59:04,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:59:04,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:59:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:59:04,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:59:04,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:59:04,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173564968] [2024-11-12 15:59:04,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173564968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:59:04,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:59:04,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 15:59:04,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905468550] [2024-11-12 15:59:04,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:59:04,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:59:04,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:59:04,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:59:04,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:59:04,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 29 [2024-11-12 15:59:04,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-12 15:59:04,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 15:59:04,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 29 [2024-11-12 15:59:04,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 15:59:04,564 INFO L124 PetriNetUnfolderBase]: 70/157 cut-off events. [2024-11-12 15:59:04,564 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 15:59:04,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 157 events. 70/157 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 554 event pairs, 44 based on Foata normal form. 15/161 useless extension candidates. Maximal degree in co-relation 272. Up to 113 conditions per place. [2024-11-12 15:59:04,568 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 11 selfloop transitions, 1 changer transitions 1/23 dead transitions. [2024-11-12 15:59:04,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 23 transitions, 78 flow [2024-11-12 15:59:04,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:59:04,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 15:59:04,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2024-11-12 15:59:04,577 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5977011494252874 [2024-11-12 15:59:04,578 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 60 flow. Second operand 3 states and 52 transitions. [2024-11-12 15:59:04,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 23 transitions, 78 flow [2024-11-12 15:59:04,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 23 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 15:59:04,581 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 50 flow [2024-11-12 15:59:04,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2024-11-12 15:59:04,585 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2024-11-12 15:59:04,585 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 50 flow [2024-11-12 15:59:04,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-12 15:59:04,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 15:59:04,585 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:59:04,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 15:59:04,586 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 15:59:04,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:59:04,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1038262774, now seen corresponding path program 1 times [2024-11-12 15:59:04,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:59:04,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006741019] [2024-11-12 15:59:04,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:59:04,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:59:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:59:04,780 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-12 15:59:04,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:59:04,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006741019] [2024-11-12 15:59:04,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006741019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:59:04,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:59:04,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:59:04,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083713767] [2024-11-12 15:59:04,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:59:04,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 15:59:04,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:59:04,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 15:59:04,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 15:59:04,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-12 15:59:04,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:59:04,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 15:59:04,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-12 15:59:04,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 15:59:04,941 INFO L124 PetriNetUnfolderBase]: 273/487 cut-off events. [2024-11-12 15:59:04,942 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 15:59:04,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 927 conditions, 487 events. 273/487 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1990 event pairs, 45 based on Foata normal form. 0/470 useless extension candidates. Maximal degree in co-relation 921. Up to 181 conditions per place. [2024-11-12 15:59:04,945 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 25 selfloop transitions, 4 changer transitions 21/54 dead transitions. [2024-11-12 15:59:04,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 54 transitions, 212 flow [2024-11-12 15:59:04,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 15:59:04,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 15:59:04,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2024-11-12 15:59:04,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5689655172413793 [2024-11-12 15:59:04,946 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 50 flow. Second operand 6 states and 99 transitions. [2024-11-12 15:59:04,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 54 transitions, 212 flow [2024-11-12 15:59:04,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 54 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 15:59:04,948 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 74 flow [2024-11-12 15:59:04,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=74, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2024-11-12 15:59:04,949 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2024-11-12 15:59:04,949 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 74 flow [2024-11-12 15:59:04,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:59:04,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 15:59:04,950 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:59:04,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 15:59:04,950 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 15:59:04,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:59:04,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1117686194, now seen corresponding path program 1 times [2024-11-12 15:59:04,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:59:04,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434833304] [2024-11-12 15:59:04,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:59:04,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:59:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:59:05,067 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-12 15:59:05,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:59:05,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434833304] [2024-11-12 15:59:05,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434833304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:59:05,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:59:05,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 15:59:05,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897754135] [2024-11-12 15:59:05,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:59:05,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 15:59:05,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:59:05,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 15:59:05,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 15:59:05,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-12 15:59:05,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 74 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:59:05,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 15:59:05,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-12 15:59:05,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 15:59:05,271 INFO L124 PetriNetUnfolderBase]: 382/704 cut-off events. [2024-11-12 15:59:05,271 INFO L125 PetriNetUnfolderBase]: For 276/276 co-relation queries the response was YES. [2024-11-12 15:59:05,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1602 conditions, 704 events. 382/704 cut-off events. For 276/276 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3073 event pairs, 65 based on Foata normal form. 27/727 useless extension candidates. Maximal degree in co-relation 1591. Up to 246 conditions per place. [2024-11-12 15:59:05,278 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 46 selfloop transitions, 9 changer transitions 20/79 dead transitions. [2024-11-12 15:59:05,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 79 transitions, 382 flow [2024-11-12 15:59:05,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 15:59:05,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-12 15:59:05,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-11-12 15:59:05,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2024-11-12 15:59:05,283 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 74 flow. Second operand 9 states and 144 transitions. [2024-11-12 15:59:05,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 79 transitions, 382 flow [2024-11-12 15:59:05,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 79 transitions, 366 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-11-12 15:59:05,289 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 159 flow [2024-11-12 15:59:05,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=159, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2024-11-12 15:59:05,289 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 14 predicate places. [2024-11-12 15:59:05,290 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 159 flow [2024-11-12 15:59:05,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:59:05,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 15:59:05,290 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:59:05,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 15:59:05,295 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 15:59:05,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:59:05,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1000674482, now seen corresponding path program 2 times [2024-11-12 15:59:05,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:59:05,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345476626] [2024-11-12 15:59:05,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:59:05,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:59:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:59:05,418 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-12 15:59:05,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:59:05,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345476626] [2024-11-12 15:59:05,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345476626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:59:05,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:59:05,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 15:59:05,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952720081] [2024-11-12 15:59:05,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:59:05,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 15:59:05,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:59:05,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 15:59:05,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 15:59:05,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-12 15:59:05,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 159 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:59:05,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 15:59:05,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-12 15:59:05,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 15:59:05,569 INFO L124 PetriNetUnfolderBase]: 328/611 cut-off events. [2024-11-12 15:59:05,570 INFO L125 PetriNetUnfolderBase]: For 971/971 co-relation queries the response was YES. [2024-11-12 15:59:05,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1741 conditions, 611 events. 328/611 cut-off events. For 971/971 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2595 event pairs, 65 based on Foata normal form. 45/652 useless extension candidates. Maximal degree in co-relation 1723. Up to 234 conditions per place. [2024-11-12 15:59:05,573 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 38 selfloop transitions, 9 changer transitions 28/79 dead transitions. [2024-11-12 15:59:05,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 79 transitions, 499 flow [2024-11-12 15:59:05,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 15:59:05,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-12 15:59:05,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2024-11-12 15:59:05,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5474137931034483 [2024-11-12 15:59:05,575 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 159 flow. Second operand 8 states and 127 transitions. [2024-11-12 15:59:05,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 79 transitions, 499 flow [2024-11-12 15:59:05,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 79 transitions, 491 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-11-12 15:59:05,578 INFO L231 Difference]: Finished difference. Result has 51 places, 34 transitions, 213 flow [2024-11-12 15:59:05,578 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=213, PETRI_PLACES=51, PETRI_TRANSITIONS=34} [2024-11-12 15:59:05,579 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2024-11-12 15:59:05,579 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 34 transitions, 213 flow [2024-11-12 15:59:05,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:59:05,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 15:59:05,579 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:59:05,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 15:59:05,579 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 15:59:05,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:59:05,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1356857717, now seen corresponding path program 1 times [2024-11-12 15:59:05,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:59:05,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713717466] [2024-11-12 15:59:05,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:59:05,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:59:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:59:05,686 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-12 15:59:05,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:59:05,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713717466] [2024-11-12 15:59:05,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713717466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:59:05,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:59:05,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 15:59:05,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052087286] [2024-11-12 15:59:05,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:59:05,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 15:59:05,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:59:05,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 15:59:05,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 15:59:05,701 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-12 15:59:05,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 34 transitions, 213 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-12 15:59:05,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 15:59:05,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-12 15:59:05,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 15:59:05,894 INFO L124 PetriNetUnfolderBase]: 337/620 cut-off events. [2024-11-12 15:59:05,894 INFO L125 PetriNetUnfolderBase]: For 1649/1649 co-relation queries the response was YES. [2024-11-12 15:59:05,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1946 conditions, 620 events. 337/620 cut-off events. For 1649/1649 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2632 event pairs, 74 based on Foata normal form. 18/634 useless extension candidates. Maximal degree in co-relation 1923. Up to 237 conditions per place. [2024-11-12 15:59:05,897 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 46 selfloop transitions, 16 changer transitions 24/90 dead transitions. [2024-11-12 15:59:05,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 90 transitions, 610 flow [2024-11-12 15:59:05,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 15:59:05,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-12 15:59:05,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2024-11-12 15:59:05,899 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5266457680250783 [2024-11-12 15:59:05,899 INFO L175 Difference]: Start difference. First operand has 51 places, 34 transitions, 213 flow. Second operand 11 states and 168 transitions. [2024-11-12 15:59:05,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 90 transitions, 610 flow [2024-11-12 15:59:05,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 90 transitions, 543 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-11-12 15:59:05,905 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 282 flow [2024-11-12 15:59:05,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=282, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2024-11-12 15:59:05,906 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 26 predicate places. [2024-11-12 15:59:05,906 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 282 flow [2024-11-12 15:59:05,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-12 15:59:05,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 15:59:05,906 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:59:05,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 15:59:05,906 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 15:59:05,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:59:05,907 INFO L85 PathProgramCache]: Analyzing trace with hash 392343623, now seen corresponding path program 2 times [2024-11-12 15:59:05,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:59:05,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373813476] [2024-11-12 15:59:05,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:59:05,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:59:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:59:06,008 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-12 15:59:06,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:59:06,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373813476] [2024-11-12 15:59:06,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373813476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:59:06,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:59:06,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 15:59:06,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758045822] [2024-11-12 15:59:06,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:59:06,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 15:59:06,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:59:06,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 15:59:06,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 15:59:06,019 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-12 15:59:06,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 282 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-12 15:59:06,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 15:59:06,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-12 15:59:06,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 15:59:06,198 INFO L124 PetriNetUnfolderBase]: 445/807 cut-off events. [2024-11-12 15:59:06,198 INFO L125 PetriNetUnfolderBase]: For 2473/2473 co-relation queries the response was YES. [2024-11-12 15:59:06,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2634 conditions, 807 events. 445/807 cut-off events. For 2473/2473 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3481 event pairs, 59 based on Foata normal form. 27/828 useless extension candidates. Maximal degree in co-relation 2610. Up to 151 conditions per place. [2024-11-12 15:59:06,203 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 44 selfloop transitions, 23 changer transitions 30/101 dead transitions. [2024-11-12 15:59:06,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 101 transitions, 742 flow [2024-11-12 15:59:06,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 15:59:06,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-12 15:59:06,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 171 transitions. [2024-11-12 15:59:06,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5360501567398119 [2024-11-12 15:59:06,204 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 282 flow. Second operand 11 states and 171 transitions. [2024-11-12 15:59:06,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 101 transitions, 742 flow [2024-11-12 15:59:06,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 101 transitions, 688 flow, removed 21 selfloop flow, removed 4 redundant places. [2024-11-12 15:59:06,210 INFO L231 Difference]: Finished difference. Result has 67 places, 46 transitions, 393 flow [2024-11-12 15:59:06,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=393, PETRI_PLACES=67, PETRI_TRANSITIONS=46} [2024-11-12 15:59:06,211 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 37 predicate places. [2024-11-12 15:59:06,211 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 46 transitions, 393 flow [2024-11-12 15:59:06,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-12 15:59:06,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 15:59:06,212 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:59:06,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 15:59:06,212 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 15:59:06,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:59:06,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1383133169, now seen corresponding path program 1 times [2024-11-12 15:59:06,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:59:06,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819326339] [2024-11-12 15:59:06,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:59:06,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:59:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:59:06,299 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-12 15:59:06,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:59:06,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819326339] [2024-11-12 15:59:06,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819326339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:59:06,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:59:06,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 15:59:06,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439691658] [2024-11-12 15:59:06,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:59:06,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 15:59:06,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:59:06,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 15:59:06,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-12 15:59:06,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-12 15:59:06,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 46 transitions, 393 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:59:06,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 15:59:06,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-12 15:59:06,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 15:59:06,502 INFO L124 PetriNetUnfolderBase]: 463/854 cut-off events. [2024-11-12 15:59:06,502 INFO L125 PetriNetUnfolderBase]: For 4628/4628 co-relation queries the response was YES. [2024-11-12 15:59:06,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3236 conditions, 854 events. 463/854 cut-off events. For 4628/4628 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3786 event pairs, 137 based on Foata normal form. 27/877 useless extension candidates. Maximal degree in co-relation 3207. Up to 486 conditions per place. [2024-11-12 15:59:06,506 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 52 selfloop transitions, 13 changer transitions 31/100 dead transitions. [2024-11-12 15:59:06,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 100 transitions, 885 flow [2024-11-12 15:59:06,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 15:59:06,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-12 15:59:06,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2024-11-12 15:59:06,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5266457680250783 [2024-11-12 15:59:06,507 INFO L175 Difference]: Start difference. First operand has 67 places, 46 transitions, 393 flow. Second operand 11 states and 168 transitions. [2024-11-12 15:59:06,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 100 transitions, 885 flow [2024-11-12 15:59:06,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 100 transitions, 822 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-11-12 15:59:06,514 INFO L231 Difference]: Finished difference. Result has 74 places, 48 transitions, 420 flow [2024-11-12 15:59:06,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=420, PETRI_PLACES=74, PETRI_TRANSITIONS=48} [2024-11-12 15:59:06,515 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 44 predicate places. [2024-11-12 15:59:06,515 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 48 transitions, 420 flow [2024-11-12 15:59:06,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:59:06,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 15:59:06,515 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:59:06,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 15:59:06,516 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 15:59:06,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:59:06,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1985942713, now seen corresponding path program 2 times [2024-11-12 15:59:06,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:59:06,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085732638] [2024-11-12 15:59:06,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:59:06,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:59:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:59:06,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:59:06,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:59:06,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085732638] [2024-11-12 15:59:06,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085732638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:59:06,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:59:06,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 15:59:06,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298846704] [2024-11-12 15:59:06,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:59:06,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 15:59:06,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:59:06,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 15:59:06,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 15:59:06,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-12 15:59:06,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 48 transitions, 420 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:59:06,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 15:59:06,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-12 15:59:06,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 15:59:06,878 INFO L124 PetriNetUnfolderBase]: 616/1148 cut-off events. [2024-11-12 15:59:06,878 INFO L125 PetriNetUnfolderBase]: For 8617/8617 co-relation queries the response was YES. [2024-11-12 15:59:06,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4694 conditions, 1148 events. 616/1148 cut-off events. For 8617/8617 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5441 event pairs, 110 based on Foata normal form. 27/1171 useless extension candidates. Maximal degree in co-relation 4662. Up to 411 conditions per place. [2024-11-12 15:59:06,884 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 72 selfloop transitions, 23 changer transitions 31/130 dead transitions. [2024-11-12 15:59:06,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 130 transitions, 1208 flow [2024-11-12 15:59:06,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 15:59:06,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-12 15:59:06,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 232 transitions. [2024-11-12 15:59:06,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-11-12 15:59:06,886 INFO L175 Difference]: Start difference. First operand has 74 places, 48 transitions, 420 flow. Second operand 15 states and 232 transitions. [2024-11-12 15:59:06,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 130 transitions, 1208 flow [2024-11-12 15:59:06,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 130 transitions, 1070 flow, removed 58 selfloop flow, removed 8 redundant places. [2024-11-12 15:59:06,896 INFO L231 Difference]: Finished difference. Result has 84 places, 54 transitions, 526 flow [2024-11-12 15:59:06,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=526, PETRI_PLACES=84, PETRI_TRANSITIONS=54} [2024-11-12 15:59:06,896 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 54 predicate places. [2024-11-12 15:59:06,896 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 54 transitions, 526 flow [2024-11-12 15:59:06,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:59:06,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 15:59:06,897 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:59:06,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 15:59:06,897 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 15:59:06,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:59:06,898 INFO L85 PathProgramCache]: Analyzing trace with hash 945130439, now seen corresponding path program 3 times [2024-11-12 15:59:06,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:59:06,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920718590] [2024-11-12 15:59:06,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:59:06,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:59:06,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:59:06,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:59:06,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:59:06,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920718590] [2024-11-12 15:59:06,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920718590] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:59:06,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34871979] [2024-11-12 15:59:06,986 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 15:59:06,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 15:59:06,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 15:59:06,988 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 15:59:06,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 15:59:07,041 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-12 15:59:07,041 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 15:59:07,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 15:59:07,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:59:07,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:59:07,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:59:07,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:59:07,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34871979] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 15:59:07,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 15:59:07,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-12 15:59:07,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051943766] [2024-11-12 15:59:07,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 15:59:07,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 15:59:07,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:59:07,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 15:59:07,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-12 15:59:07,219 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-12 15:59:07,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 54 transitions, 526 flow. Second operand has 13 states, 13 states have (on average 10.153846153846153) internal successors, (132), 13 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:59:07,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 15:59:07,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-12 15:59:07,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 15:59:07,774 INFO L124 PetriNetUnfolderBase]: 778/1414 cut-off events. [2024-11-12 15:59:07,775 INFO L125 PetriNetUnfolderBase]: For 15775/15775 co-relation queries the response was YES. [2024-11-12 15:59:07,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6500 conditions, 1414 events. 778/1414 cut-off events. For 15775/15775 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 6548 event pairs, 70 based on Foata normal form. 81/1491 useless extension candidates. Maximal degree in co-relation 6464. Up to 225 conditions per place. [2024-11-12 15:59:07,781 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 78 selfloop transitions, 41 changer transitions 81/204 dead transitions. [2024-11-12 15:59:07,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 204 transitions, 2133 flow [2024-11-12 15:59:07,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-12 15:59:07,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-11-12 15:59:07,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 383 transitions. [2024-11-12 15:59:07,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5282758620689655 [2024-11-12 15:59:07,783 INFO L175 Difference]: Start difference. First operand has 84 places, 54 transitions, 526 flow. Second operand 25 states and 383 transitions. [2024-11-12 15:59:07,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 204 transitions, 2133 flow [2024-11-12 15:59:07,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 204 transitions, 1933 flow, removed 84 selfloop flow, removed 10 redundant places. [2024-11-12 15:59:07,802 INFO L231 Difference]: Finished difference. Result has 111 places, 66 transitions, 818 flow [2024-11-12 15:59:07,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=818, PETRI_PLACES=111, PETRI_TRANSITIONS=66} [2024-11-12 15:59:07,802 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 81 predicate places. [2024-11-12 15:59:07,802 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 66 transitions, 818 flow [2024-11-12 15:59:07,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.153846153846153) internal successors, (132), 13 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:59:07,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 15:59:07,803 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:59:07,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 15:59:08,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 15:59:08,007 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 15:59:08,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:59:08,008 INFO L85 PathProgramCache]: Analyzing trace with hash 310995456, now seen corresponding path program 1 times [2024-11-12 15:59:08,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:59:08,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561421491] [2024-11-12 15:59:08,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:59:08,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:59:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:59:08,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:59:08,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:59:08,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561421491] [2024-11-12 15:59:08,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561421491] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:59:08,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012780020] [2024-11-12 15:59:08,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:59:08,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 15:59:08,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 15:59:08,109 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 15:59:08,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 15:59:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:59:08,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 15:59:08,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:59:08,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:59:08,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:59:08,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:59:08,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012780020] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 15:59:08,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 15:59:08,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-12 15:59:08,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673392308] [2024-11-12 15:59:08,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 15:59:08,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 15:59:08,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:59:08,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 15:59:08,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-11-12 15:59:08,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-12 15:59:08,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 66 transitions, 818 flow. Second operand has 16 states, 16 states have (on average 10.1875) internal successors, (163), 16 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:59:08,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 15:59:08,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-12 15:59:08,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 15:59:08,912 INFO L124 PetriNetUnfolderBase]: 1093/2043 cut-off events. [2024-11-12 15:59:08,912 INFO L125 PetriNetUnfolderBase]: For 52095/52095 co-relation queries the response was YES. [2024-11-12 15:59:08,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11718 conditions, 2043 events. 1093/2043 cut-off events. For 52095/52095 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 10823 event pairs, 66 based on Foata normal form. 72/2111 useless extension candidates. Maximal degree in co-relation 11669. Up to 397 conditions per place. [2024-11-12 15:59:08,924 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 90 selfloop transitions, 62 changer transitions 88/244 dead transitions. [2024-11-12 15:59:08,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 244 transitions, 3422 flow [2024-11-12 15:59:08,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-12 15:59:08,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2024-11-12 15:59:08,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 425 transitions. [2024-11-12 15:59:08,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5233990147783252 [2024-11-12 15:59:08,927 INFO L175 Difference]: Start difference. First operand has 111 places, 66 transitions, 818 flow. Second operand 28 states and 425 transitions. [2024-11-12 15:59:08,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 244 transitions, 3422 flow [2024-11-12 15:59:08,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 244 transitions, 2857 flow, removed 260 selfloop flow, removed 17 redundant places. [2024-11-12 15:59:08,969 INFO L231 Difference]: Finished difference. Result has 132 places, 94 transitions, 1364 flow [2024-11-12 15:59:08,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1364, PETRI_PLACES=132, PETRI_TRANSITIONS=94} [2024-11-12 15:59:08,969 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 102 predicate places. [2024-11-12 15:59:08,969 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 94 transitions, 1364 flow [2024-11-12 15:59:08,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.1875) internal successors, (163), 16 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:59:08,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 15:59:08,970 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:59:08,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 15:59:09,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-12 15:59:09,171 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 15:59:09,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:59:09,171 INFO L85 PathProgramCache]: Analyzing trace with hash -697275179, now seen corresponding path program 2 times [2024-11-12 15:59:09,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:59:09,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424911113] [2024-11-12 15:59:09,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:59:09,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:59:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:59:09,290 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:59:09,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:59:09,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424911113] [2024-11-12 15:59:09,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424911113] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:59:09,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294398920] [2024-11-12 15:59:09,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 15:59:09,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 15:59:09,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 15:59:09,293 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 15:59:09,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 15:59:09,340 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 15:59:09,340 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 15:59:09,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 15:59:09,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:59:09,395 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:59:09,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:59:09,494 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:59:09,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294398920] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 15:59:09,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 15:59:09,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2024-11-12 15:59:09,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303259815] [2024-11-12 15:59:09,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 15:59:09,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 15:59:09,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:59:09,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 15:59:09,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2024-11-12 15:59:09,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-12 15:59:09,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 94 transitions, 1364 flow. Second operand has 19 states, 19 states have (on average 10.105263157894736) internal successors, (192), 19 states have internal predecessors, (192), 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-12 15:59:09,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 15:59:09,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-12 15:59:09,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 15:59:10,211 INFO L124 PetriNetUnfolderBase]: 1336/2526 cut-off events. [2024-11-12 15:59:10,211 INFO L125 PetriNetUnfolderBase]: For 107843/107843 co-relation queries the response was YES. [2024-11-12 15:59:10,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16632 conditions, 2526 events. 1336/2526 cut-off events. For 107843/107843 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 13415 event pairs, 65 based on Foata normal form. 54/2574 useless extension candidates. Maximal degree in co-relation 16573. Up to 501 conditions per place. [2024-11-12 15:59:10,232 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 90 selfloop transitions, 90 changer transitions 75/259 dead transitions. [2024-11-12 15:59:10,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 259 transitions, 4369 flow [2024-11-12 15:59:10,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-12 15:59:10,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-11-12 15:59:10,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 397 transitions. [2024-11-12 15:59:10,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5265251989389921 [2024-11-12 15:59:10,235 INFO L175 Difference]: Start difference. First operand has 132 places, 94 transitions, 1364 flow. Second operand 26 states and 397 transitions. [2024-11-12 15:59:10,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 259 transitions, 4369 flow [2024-11-12 15:59:10,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 259 transitions, 3540 flow, removed 390 selfloop flow, removed 15 redundant places. [2024-11-12 15:59:10,306 INFO L231 Difference]: Finished difference. Result has 148 places, 118 transitions, 1795 flow [2024-11-12 15:59:10,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=993, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1795, PETRI_PLACES=148, PETRI_TRANSITIONS=118} [2024-11-12 15:59:10,307 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 118 predicate places. [2024-11-12 15:59:10,307 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 118 transitions, 1795 flow [2024-11-12 15:59:10,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.105263157894736) internal successors, (192), 19 states have internal predecessors, (192), 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-12 15:59:10,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 15:59:10,308 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:59:10,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 15:59:10,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 15:59:10,512 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 15:59:10,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:59:10,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1304326534, now seen corresponding path program 3 times [2024-11-12 15:59:10,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:59:10,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391553906] [2024-11-12 15:59:10,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:59:10,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:59:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:59:10,640 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:59:10,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:59:10,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391553906] [2024-11-12 15:59:10,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391553906] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:59:10,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392018803] [2024-11-12 15:59:10,640 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 15:59:10,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 15:59:10,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 15:59:10,642 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 15:59:10,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 15:59:10,687 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-12 15:59:10,687 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 15:59:10,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-12 15:59:10,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:59:10,743 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:59:10,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:59:10,843 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:59:10,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392018803] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 15:59:10,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 15:59:10,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 18 [2024-11-12 15:59:10,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656842327] [2024-11-12 15:59:10,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 15:59:10,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 15:59:10,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:59:10,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 15:59:10,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2024-11-12 15:59:10,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-12 15:59:10,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 118 transitions, 1795 flow. Second operand has 19 states, 19 states have (on average 10.263157894736842) internal successors, (195), 19 states have internal predecessors, (195), 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-12 15:59:10,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 15:59:10,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-12 15:59:10,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 15:59:11,764 INFO L124 PetriNetUnfolderBase]: 1660/3084 cut-off events. [2024-11-12 15:59:11,764 INFO L125 PetriNetUnfolderBase]: For 151405/151405 co-relation queries the response was YES. [2024-11-12 15:59:11,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21500 conditions, 3084 events. 1660/3084 cut-off events. For 151405/151405 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 16390 event pairs, 50 based on Foata normal form. 54/3134 useless extension candidates. Maximal degree in co-relation 21434. Up to 609 conditions per place. [2024-11-12 15:59:11,787 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 117 selfloop transitions, 116 changer transitions 91/328 dead transitions. [2024-11-12 15:59:11,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 328 transitions, 5674 flow [2024-11-12 15:59:11,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-12 15:59:11,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2024-11-12 15:59:11,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 519 transitions. [2024-11-12 15:59:11,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.526369168356998 [2024-11-12 15:59:11,790 INFO L175 Difference]: Start difference. First operand has 148 places, 118 transitions, 1795 flow. Second operand 34 states and 519 transitions. [2024-11-12 15:59:11,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 328 transitions, 5674 flow [2024-11-12 15:59:11,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 328 transitions, 4802 flow, removed 403 selfloop flow, removed 17 redundant places. [2024-11-12 15:59:11,920 INFO L231 Difference]: Finished difference. Result has 174 places, 142 transitions, 2389 flow [2024-11-12 15:59:11,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1426, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2389, PETRI_PLACES=174, PETRI_TRANSITIONS=142} [2024-11-12 15:59:11,921 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 144 predicate places. [2024-11-12 15:59:11,921 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 142 transitions, 2389 flow [2024-11-12 15:59:11,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.263157894736842) internal successors, (195), 19 states have internal predecessors, (195), 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-12 15:59:11,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 15:59:11,921 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:59:11,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 15:59:12,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 15:59:12,123 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 15:59:12,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:59:12,124 INFO L85 PathProgramCache]: Analyzing trace with hash -563459467, now seen corresponding path program 4 times [2024-11-12 15:59:12,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:59:12,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169174136] [2024-11-12 15:59:12,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:59:12,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:59:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 15:59:12,133 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 15:59:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 15:59:12,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 15:59:12,158 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 15:59:12,159 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2024-11-12 15:59:12,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2024-11-12 15:59:12,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-11-12 15:59:12,160 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-11-12 15:59:12,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 15:59:12,161 INFO L421 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1] [2024-11-12 15:59:12,215 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-12 15:59:12,219 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 15:59:12,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 03:59:12 BasicIcfg [2024-11-12 15:59:12,222 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 15:59:12,223 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 15:59:12,223 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 15:59:12,223 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 15:59:12,223 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:59:04" (3/4) ... [2024-11-12 15:59:12,225 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 15:59:12,227 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 15:59:12,227 INFO L158 Benchmark]: Toolchain (without parser) took 8967.29ms. Allocated memory was 153.1MB in the beginning and 325.1MB in the end (delta: 172.0MB). Free memory was 82.2MB in the beginning and 130.0MB in the end (delta: -47.9MB). Peak memory consumption was 127.1MB. Max. memory is 16.1GB. [2024-11-12 15:59:12,227 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 153.1MB. Free memory is still 103.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 15:59:12,228 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.96ms. Allocated memory was 153.1MB in the beginning and 224.4MB in the end (delta: 71.3MB). Free memory was 81.8MB in the beginning and 186.9MB in the end (delta: -105.1MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2024-11-12 15:59:12,228 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.37ms. Allocated memory is still 224.4MB. Free memory was 186.9MB in the beginning and 184.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 15:59:12,228 INFO L158 Benchmark]: Boogie Preprocessor took 38.30ms. Allocated memory is still 224.4MB. Free memory was 184.8MB in the beginning and 182.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 15:59:12,228 INFO L158 Benchmark]: RCFGBuilder took 345.95ms. Allocated memory is still 224.4MB. Free memory was 182.7MB in the beginning and 162.8MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-12 15:59:12,228 INFO L158 Benchmark]: TraceAbstraction took 8153.48ms. Allocated memory was 224.4MB in the beginning and 325.1MB in the end (delta: 100.7MB). Free memory was 161.7MB in the beginning and 130.0MB in the end (delta: 31.7MB). Peak memory consumption was 132.3MB. Max. memory is 16.1GB. [2024-11-12 15:59:12,229 INFO L158 Benchmark]: Witness Printer took 4.31ms. Allocated memory is still 325.1MB. Free memory was 130.0MB in the beginning and 130.0MB in the end (delta: 2.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 15:59:12,229 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 153.1MB. Free memory is still 103.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.96ms. Allocated memory was 153.1MB in the beginning and 224.4MB in the end (delta: 71.3MB). Free memory was 81.8MB in the beginning and 186.9MB in the end (delta: -105.1MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.37ms. Allocated memory is still 224.4MB. Free memory was 186.9MB in the beginning and 184.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.30ms. Allocated memory is still 224.4MB. Free memory was 184.8MB in the beginning and 182.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 345.95ms. Allocated memory is still 224.4MB. Free memory was 182.7MB in the beginning and 162.8MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8153.48ms. Allocated memory was 224.4MB in the beginning and 325.1MB in the end (delta: 100.7MB). Free memory was 161.7MB in the beginning and 130.0MB in the end (delta: 31.7MB). Peak memory consumption was 132.3MB. Max. memory is 16.1GB. * Witness Printer took 4.31ms. Allocated memory is still 325.1MB. Free memory was 130.0MB in the beginning and 130.0MB in the end (delta: 2.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 693]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 693. Possible FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, argc=49, i=3, id1=-1, j=6] [L696] 1 int k = 0; VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, argc=49, i=3, id1=-1, id2=0, j=6, k=0] [L704] 2 int k = 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L716] 0 int condI = i >= (2*5 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, arg={0:0}, argc=49, condI=0, i=7, id1=-1, id2=0, j=8, k=1, k=1] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L719] 0 int condJ = j >= (2*5 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=49, \old(argv)={50:51}, arg={0:0}, arg={0:0}, argc=49, condI=0, condJ=1, i=15, id1=-1, id2=0, j=16, k=4, k=4] [L721] COND TRUE 0 condI || condJ [L722] CALL 0 reach_error() [L693] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L693] 0 __assert_fail ("0", "triangular-2.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] - UnprovableResult [Line: 711]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 38 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.0s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1632 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1611 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3194 IncrementalHoareTripleChecker+Invalid, 3305 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 8 mSDtfsCounter, 3194 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 405 GetRequests, 179 SyntacticMatches, 4 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1552 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2389occurred in iteration=12, InterpolantAutomatonStates: 187, 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, 1.8s InterpolantComputationTime, 362 NumberOfCodeBlocks, 362 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 405 ConstructedInterpolants, 0 QuantifiedInterpolants, 1469 SizeOfPredicates, 25 NumberOfNonLiveVariables, 409 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 20 InterpolantComputations, 8 PerfectInterpolantSequences, 1/129 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 15:59:12,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/triangular-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 15:59:14,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 15:59:14,067 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-12 15:59:14,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 15:59:14,070 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 15:59:14,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 15:59:14,094 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 15:59:14,094 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 15:59:14,094 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 15:59:14,095 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 15:59:14,095 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 15:59:14,095 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 15:59:14,095 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 15:59:14,096 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 15:59:14,096 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 15:59:14,096 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 15:59:14,096 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 15:59:14,097 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 15:59:14,097 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 15:59:14,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 15:59:14,101 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 15:59:14,101 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 15:59:14,101 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 15:59:14,101 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 15:59:14,102 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 15:59:14,102 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 15:59:14,102 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 15:59:14,102 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 15:59:14,102 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 15:59:14,103 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 15:59:14,104 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 15:59:14,104 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 15:59:14,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 15:59:14,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 15:59:14,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 15:59:14,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 15:59:14,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 15:59:14,105 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 15:59:14,105 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 15:59:14,105 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 15:59:14,105 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 15:59:14,106 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 15:59:14,106 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 15:59:14,106 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 15:59:14,107 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 -> 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 [2024-11-12 15:59:14,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 15:59:14,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 15:59:14,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 15:59:14,364 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 15:59:14,364 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 15:59:14,365 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-2.i [2024-11-12 15:59:15,586 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 15:59:15,760 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 15:59:15,761 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i [2024-11-12 15:59:15,773 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4db974ef/8b36a8685c324e4ab6c474ee0c411921/FLAGb2bc1fd0e [2024-11-12 15:59:16,139 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4db974ef/8b36a8685c324e4ab6c474ee0c411921 [2024-11-12 15:59:16,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 15:59:16,141 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 15:59:16,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 15:59:16,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 15:59:16,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 15:59:16,149 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:59:16" (1/1) ... [2024-11-12 15:59:16,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@677ad11f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:59:16, skipping insertion in model container [2024-11-12 15:59:16,150 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:59:16" (1/1) ... [2024-11-12 15:59:16,188 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 15:59:16,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 15:59:16,489 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 15:59:16,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 15:59:16,562 INFO L204 MainTranslator]: Completed translation [2024-11-12 15:59:16,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:59:16 WrapperNode [2024-11-12 15:59:16,562 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 15:59:16,563 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 15:59:16,563 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 15:59:16,563 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 15:59:16,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:59:16" (1/1) ... [2024-11-12 15:59:16,583 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:59:16" (1/1) ... [2024-11-12 15:59:16,601 INFO L138 Inliner]: procedures = 169, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 40 [2024-11-12 15:59:16,602 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 15:59:16,602 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 15:59:16,602 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 15:59:16,602 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 15:59:16,610 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:59:16" (1/1) ... [2024-11-12 15:59:16,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:59:16" (1/1) ... [2024-11-12 15:59:16,614 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:59:16" (1/1) ... [2024-11-12 15:59:16,644 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-12 15:59:16,644 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:59:16" (1/1) ... [2024-11-12 15:59:16,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:59:16" (1/1) ... [2024-11-12 15:59:16,650 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:59:16" (1/1) ... [2024-11-12 15:59:16,652 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:59:16" (1/1) ... [2024-11-12 15:59:16,657 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:59:16" (1/1) ... [2024-11-12 15:59:16,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:59:16" (1/1) ... [2024-11-12 15:59:16,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 15:59:16,664 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 15:59:16,664 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 15:59:16,664 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 15:59:16,665 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:59:16" (1/1) ... [2024-11-12 15:59:16,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 15:59:16,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 15:59:16,696 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-12 15:59:16,698 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-12 15:59:16,736 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-12 15:59:16,736 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-12 15:59:16,736 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-12 15:59:16,736 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-12 15:59:16,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-12 15:59:16,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 15:59:16,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 15:59:16,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-12 15:59:16,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 15:59:16,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 15:59:16,738 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 15:59:16,858 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 15:59:16,859 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 15:59:16,975 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 15:59:16,977 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 15:59:17,079 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 15:59:17,080 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 15:59:17,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:59:17 BoogieIcfgContainer [2024-11-12 15:59:17,080 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 15:59:17,083 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 15:59:17,083 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 15:59:17,085 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 15:59:17,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:59:16" (1/3) ... [2024-11-12 15:59:17,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@558b4ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:59:17, skipping insertion in model container [2024-11-12 15:59:17,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:59:16" (2/3) ... [2024-11-12 15:59:17,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@558b4ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:59:17, skipping insertion in model container [2024-11-12 15:59:17,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:59:17" (3/3) ... [2024-11-12 15:59:17,090 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2024-11-12 15:59:17,102 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 15:59:17,103 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 15:59:17,103 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 15:59:17,139 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-12 15:59:17,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 66 flow [2024-11-12 15:59:17,193 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2024-11-12 15:59:17,193 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 15:59:17,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 27 events. 4/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2024-11-12 15:59:17,196 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 66 flow [2024-11-12 15:59:17,198 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 27 transitions, 60 flow [2024-11-12 15:59:17,208 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 15:59:17,215 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;@5b2b0c8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 15:59:17,215 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-12 15:59:17,225 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 15:59:17,225 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2024-11-12 15:59:17,225 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 15:59:17,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 15:59:17,227 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:59:17,228 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 15:59:17,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:59:17,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1944846646, now seen corresponding path program 1 times [2024-11-12 15:59:17,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:59:17,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013095010] [2024-11-12 15:59:17,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:59:17,243 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:59:17,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:59:17,245 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:59:17,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 15:59:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:59:17,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 15:59:17,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:59:17,365 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-12 15:59:17,366 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:59:17,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:59:17,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2013095010] [2024-11-12 15:59:17,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2013095010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:59:17,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:59:17,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 15:59:17,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216671846] [2024-11-12 15:59:17,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:59:17,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:59:17,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:59:17,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:59:17,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:59:17,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 29 [2024-11-12 15:59:17,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-12 15:59:17,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 15:59:17,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 29 [2024-11-12 15:59:17,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 15:59:17,462 INFO L124 PetriNetUnfolderBase]: 70/157 cut-off events. [2024-11-12 15:59:17,463 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 15:59:17,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 157 events. 70/157 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 552 event pairs, 44 based on Foata normal form. 15/161 useless extension candidates. Maximal degree in co-relation 272. Up to 113 conditions per place. [2024-11-12 15:59:17,466 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 11 selfloop transitions, 1 changer transitions 1/23 dead transitions. [2024-11-12 15:59:17,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 23 transitions, 78 flow [2024-11-12 15:59:17,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:59:17,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 15:59:17,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2024-11-12 15:59:17,474 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5977011494252874 [2024-11-12 15:59:17,475 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 60 flow. Second operand 3 states and 52 transitions. [2024-11-12 15:59:17,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 23 transitions, 78 flow [2024-11-12 15:59:17,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 23 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 15:59:17,479 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 50 flow [2024-11-12 15:59:17,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2024-11-12 15:59:17,483 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2024-11-12 15:59:17,483 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 50 flow [2024-11-12 15:59:17,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-12 15:59:17,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 15:59:17,483 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:59:17,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 15:59:17,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:59:17,684 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 15:59:17,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:59:17,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1944845514, now seen corresponding path program 1 times [2024-11-12 15:59:17,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:59:17,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42654588] [2024-11-12 15:59:17,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:59:17,686 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:59:17,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:59:17,687 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:59:17,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 15:59:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:59:17,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 15:59:17,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:59:17,858 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-12 15:59:17,859 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:59:17,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:59:17,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42654588] [2024-11-12 15:59:17,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42654588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:59:17,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:59:17,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:59:17,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836641484] [2024-11-12 15:59:17,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:59:17,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 15:59:17,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:59:17,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 15:59:17,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 15:59:17,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-12 15:59:17,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:59:17,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 15:59:17,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-12 15:59:17,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 15:59:18,105 INFO L124 PetriNetUnfolderBase]: 328/593 cut-off events. [2024-11-12 15:59:18,106 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 15:59:18,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1126 conditions, 593 events. 328/593 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2597 event pairs, 45 based on Foata normal form. 0/574 useless extension candidates. Maximal degree in co-relation 1120. Up to 243 conditions per place. [2024-11-12 15:59:18,111 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 29 selfloop transitions, 7 changer transitions 29/69 dead transitions. [2024-11-12 15:59:18,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 69 transitions, 274 flow [2024-11-12 15:59:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 15:59:18,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-12 15:59:18,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-11-12 15:59:18,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5646551724137931 [2024-11-12 15:59:18,113 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 50 flow. Second operand 8 states and 131 transitions. [2024-11-12 15:59:18,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 69 transitions, 274 flow [2024-11-12 15:59:18,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 69 transitions, 273 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 15:59:18,116 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 100 flow [2024-11-12 15:59:18,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=100, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2024-11-12 15:59:18,117 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2024-11-12 15:59:18,117 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 100 flow [2024-11-12 15:59:18,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:59:18,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 15:59:18,117 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:59:18,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 15:59:18,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:59:18,318 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 15:59:18,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:59:18,319 INFO L85 PathProgramCache]: Analyzing trace with hash 407958523, now seen corresponding path program 1 times [2024-11-12 15:59:18,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:59:18,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791710271] [2024-11-12 15:59:18,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:59:18,319 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:59:18,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:59:18,324 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:59:18,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 15:59:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:59:18,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 15:59:18,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:59:18,434 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-12 15:59:18,435 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:59:18,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:59:18,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791710271] [2024-11-12 15:59:18,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [791710271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:59:18,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:59:18,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 15:59:18,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231914099] [2024-11-12 15:59:18,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:59:18,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 15:59:18,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:59:18,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 15:59:18,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 15:59:18,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-12 15:59:18,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 100 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:59:18,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 15:59:18,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-12 15:59:18,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 15:59:18,591 INFO L124 PetriNetUnfolderBase]: 247/454 cut-off events. [2024-11-12 15:59:18,592 INFO L125 PetriNetUnfolderBase]: For 399/399 co-relation queries the response was YES. [2024-11-12 15:59:18,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1183 conditions, 454 events. 247/454 cut-off events. For 399/399 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1806 event pairs, 50 based on Foata normal form. 18/468 useless extension candidates. Maximal degree in co-relation 1170. Up to 190 conditions per place. [2024-11-12 15:59:18,594 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 30 selfloop transitions, 9 changer transitions 16/59 dead transitions. [2024-11-12 15:59:18,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 59 transitions, 316 flow [2024-11-12 15:59:18,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 15:59:18,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-12 15:59:18,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2024-11-12 15:59:18,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.541871921182266 [2024-11-12 15:59:18,598 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 100 flow. Second operand 7 states and 110 transitions. [2024-11-12 15:59:18,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 59 transitions, 316 flow [2024-11-12 15:59:18,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 59 transitions, 312 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-12 15:59:18,602 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 143 flow [2024-11-12 15:59:18,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=143, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2024-11-12 15:59:18,603 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2024-11-12 15:59:18,603 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 143 flow [2024-11-12 15:59:18,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:59:18,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 15:59:18,603 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:59:18,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 15:59:18,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:59:18,806 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 15:59:18,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:59:18,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1492998092, now seen corresponding path program 1 times [2024-11-12 15:59:18,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:59:18,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186390294] [2024-11-12 15:59:18,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:59:18,808 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:59:18,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:59:18,809 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:59:18,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 15:59:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:59:18,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 15:59:18,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:59:18,889 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-12 15:59:18,890 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:59:18,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:59:18,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186390294] [2024-11-12 15:59:18,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186390294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:59:18,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:59:18,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 15:59:18,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458175013] [2024-11-12 15:59:18,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:59:18,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 15:59:18,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:59:18,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 15:59:18,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 15:59:18,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-12 15:59:18,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 143 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:59:18,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 15:59:18,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-12 15:59:18,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 15:59:19,096 INFO L124 PetriNetUnfolderBase]: 391/725 cut-off events. [2024-11-12 15:59:19,096 INFO L125 PetriNetUnfolderBase]: For 1146/1146 co-relation queries the response was YES. [2024-11-12 15:59:19,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2115 conditions, 725 events. 391/725 cut-off events. For 1146/1146 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3195 event pairs, 95 based on Foata normal form. 27/748 useless extension candidates. Maximal degree in co-relation 2098. Up to 264 conditions per place. [2024-11-12 15:59:19,101 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 47 selfloop transitions, 11 changer transitions 20/82 dead transitions. [2024-11-12 15:59:19,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 82 transitions, 517 flow [2024-11-12 15:59:19,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 15:59:19,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-12 15:59:19,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-11-12 15:59:19,104 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2024-11-12 15:59:19,104 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 143 flow. Second operand 9 states and 144 transitions. [2024-11-12 15:59:19,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 82 transitions, 517 flow [2024-11-12 15:59:19,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 82 transitions, 478 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-11-12 15:59:19,112 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 236 flow [2024-11-12 15:59:19,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=236, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2024-11-12 15:59:19,113 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 22 predicate places. [2024-11-12 15:59:19,114 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 236 flow [2024-11-12 15:59:19,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:59:19,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 15:59:19,114 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:59:19,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-12 15:59:19,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:59:19,317 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 15:59:19,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:59:19,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1610009804, now seen corresponding path program 2 times [2024-11-12 15:59:19,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:59:19,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977389678] [2024-11-12 15:59:19,318 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 15:59:19,318 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:59:19,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:59:19,320 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:59:19,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 15:59:19,351 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 15:59:19,351 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 15:59:19,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 15:59:19,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:59:19,398 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-12 15:59:19,398 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:59:19,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:59:19,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977389678] [2024-11-12 15:59:19,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977389678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:59:19,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:59:19,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 15:59:19,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113819468] [2024-11-12 15:59:19,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:59:19,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 15:59:19,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:59:19,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 15:59:19,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 15:59:19,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-12 15:59:19,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:59:19,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 15:59:19,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-12 15:59:19,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 15:59:19,569 INFO L124 PetriNetUnfolderBase]: 346/655 cut-off events. [2024-11-12 15:59:19,569 INFO L125 PetriNetUnfolderBase]: For 2058/2058 co-relation queries the response was YES. [2024-11-12 15:59:19,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2189 conditions, 655 events. 346/655 cut-off events. For 2058/2058 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2872 event pairs, 88 based on Foata normal form. 45/696 useless extension candidates. Maximal degree in co-relation 2166. Up to 273 conditions per place. [2024-11-12 15:59:19,572 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 40 selfloop transitions, 12 changer transitions 30/86 dead transitions. [2024-11-12 15:59:19,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 86 transitions, 655 flow [2024-11-12 15:59:19,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 15:59:19,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-12 15:59:19,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2024-11-12 15:59:19,574 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5363984674329502 [2024-11-12 15:59:19,574 INFO L175 Difference]: Start difference. First operand has 52 places, 36 transitions, 236 flow. Second operand 9 states and 140 transitions. [2024-11-12 15:59:19,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 86 transitions, 655 flow [2024-11-12 15:59:19,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 86 transitions, 595 flow, removed 30 selfloop flow, removed 2 redundant places. [2024-11-12 15:59:19,579 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 278 flow [2024-11-12 15:59:19,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=278, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2024-11-12 15:59:19,580 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 30 predicate places. [2024-11-12 15:59:19,580 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 278 flow [2024-11-12 15:59:19,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:59:19,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 15:59:19,581 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:59:19,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-12 15:59:19,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:59:19,784 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 15:59:19,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:59:19,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1235422649, now seen corresponding path program 1 times [2024-11-12 15:59:19,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:59:19,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [853310233] [2024-11-12 15:59:19,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:59:19,785 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:59:19,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:59:19,786 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:59:19,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-12 15:59:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:59:19,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 15:59:19,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:59:19,885 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-12 15:59:19,885 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:59:19,885 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:59:19,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [853310233] [2024-11-12 15:59:19,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [853310233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:59:19,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:59:19,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 15:59:19,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136005442] [2024-11-12 15:59:19,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:59:19,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 15:59:19,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:59:19,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 15:59:19,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 15:59:19,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-12 15:59:19,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 39 transitions, 278 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-12 15:59:19,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 15:59:19,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-12 15:59:19,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 15:59:20,148 INFO L124 PetriNetUnfolderBase]: 427/806 cut-off events. [2024-11-12 15:59:20,148 INFO L125 PetriNetUnfolderBase]: For 3492/3492 co-relation queries the response was YES. [2024-11-12 15:59:20,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2902 conditions, 806 events. 427/806 cut-off events. For 3492/3492 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3713 event pairs, 122 based on Foata normal form. 27/829 useless extension candidates. Maximal degree in co-relation 2874. Up to 316 conditions per place. [2024-11-12 15:59:20,152 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 51 selfloop transitions, 12 changer transitions 26/93 dead transitions. [2024-11-12 15:59:20,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 93 transitions, 752 flow [2024-11-12 15:59:20,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 15:59:20,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-12 15:59:20,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions. [2024-11-12 15:59:20,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5448275862068965 [2024-11-12 15:59:20,153 INFO L175 Difference]: Start difference. First operand has 60 places, 39 transitions, 278 flow. Second operand 10 states and 158 transitions. [2024-11-12 15:59:20,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 93 transitions, 752 flow [2024-11-12 15:59:20,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 93 transitions, 718 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-11-12 15:59:20,158 INFO L231 Difference]: Finished difference. Result has 68 places, 43 transitions, 345 flow [2024-11-12 15:59:20,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=345, PETRI_PLACES=68, PETRI_TRANSITIONS=43} [2024-11-12 15:59:20,159 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 38 predicate places. [2024-11-12 15:59:20,159 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 43 transitions, 345 flow [2024-11-12 15:59:20,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-12 15:59:20,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 15:59:20,159 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:59:20,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-12 15:59:20,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:59:20,360 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 15:59:20,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:59:20,360 INFO L85 PathProgramCache]: Analyzing trace with hash -14089357, now seen corresponding path program 2 times [2024-11-12 15:59:20,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:59:20,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119750237] [2024-11-12 15:59:20,361 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 15:59:20,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:59:20,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:59:20,363 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:59:20,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-12 15:59:20,395 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 15:59:20,395 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 15:59:20,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 15:59:20,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:59:20,454 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-12 15:59:20,454 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:59:20,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:59:20,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119750237] [2024-11-12 15:59:20,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119750237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:59:20,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:59:20,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 15:59:20,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033263467] [2024-11-12 15:59:20,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:59:20,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 15:59:20,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:59:20,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 15:59:20,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 15:59:20,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-12 15:59:20,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 43 transitions, 345 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-12 15:59:20,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 15:59:20,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-12 15:59:20,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 15:59:20,714 INFO L124 PetriNetUnfolderBase]: 463/891 cut-off events. [2024-11-12 15:59:20,715 INFO L125 PetriNetUnfolderBase]: For 6473/6473 co-relation queries the response was YES. [2024-11-12 15:59:20,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3609 conditions, 891 events. 463/891 cut-off events. For 6473/6473 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4355 event pairs, 120 based on Foata normal form. 27/914 useless extension candidates. Maximal degree in co-relation 3577. Up to 340 conditions per place. [2024-11-12 15:59:20,720 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 56 selfloop transitions, 17 changer transitions 30/107 dead transitions. [2024-11-12 15:59:20,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 107 transitions, 978 flow [2024-11-12 15:59:20,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 15:59:20,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-12 15:59:20,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 186 transitions. [2024-11-12 15:59:20,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2024-11-12 15:59:20,722 INFO L175 Difference]: Start difference. First operand has 68 places, 43 transitions, 345 flow. Second operand 12 states and 186 transitions. [2024-11-12 15:59:20,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 107 transitions, 978 flow [2024-11-12 15:59:20,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 107 transitions, 842 flow, removed 59 selfloop flow, removed 7 redundant places. [2024-11-12 15:59:20,730 INFO L231 Difference]: Finished difference. Result has 75 places, 48 transitions, 395 flow [2024-11-12 15:59:20,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=395, PETRI_PLACES=75, PETRI_TRANSITIONS=48} [2024-11-12 15:59:20,731 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 45 predicate places. [2024-11-12 15:59:20,731 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 48 transitions, 395 flow [2024-11-12 15:59:20,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-12 15:59:20,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 15:59:20,732 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:59:20,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-12 15:59:20,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:59:20,935 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 15:59:20,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:59:20,939 INFO L85 PathProgramCache]: Analyzing trace with hash 476818575, now seen corresponding path program 3 times [2024-11-12 15:59:20,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:59:20,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130796945] [2024-11-12 15:59:20,939 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 15:59:20,939 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:59:20,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:59:20,940 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:59:20,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-12 15:59:20,972 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-12 15:59:20,972 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 15:59:20,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 15:59:20,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:59:21,070 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-12 15:59:21,071 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:59:21,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:59:21,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130796945] [2024-11-12 15:59:21,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [130796945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:59:21,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:59:21,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 15:59:21,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962071093] [2024-11-12 15:59:21,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:59:21,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 15:59:21,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:59:21,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 15:59:21,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 15:59:21,083 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-12 15:59:21,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 48 transitions, 395 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-12 15:59:21,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 15:59:21,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-12 15:59:21,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 15:59:21,311 INFO L124 PetriNetUnfolderBase]: 436/839 cut-off events. [2024-11-12 15:59:21,312 INFO L125 PetriNetUnfolderBase]: For 6137/6137 co-relation queries the response was YES. [2024-11-12 15:59:21,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3329 conditions, 839 events. 436/839 cut-off events. For 6137/6137 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4049 event pairs, 152 based on Foata normal form. 27/862 useless extension candidates. Maximal degree in co-relation 3295. Up to 555 conditions per place. [2024-11-12 15:59:21,315 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 54 selfloop transitions, 9 changer transitions 29/96 dead transitions. [2024-11-12 15:59:21,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 96 transitions, 875 flow [2024-11-12 15:59:21,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 15:59:21,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-12 15:59:21,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 153 transitions. [2024-11-12 15:59:21,316 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5275862068965518 [2024-11-12 15:59:21,316 INFO L175 Difference]: Start difference. First operand has 75 places, 48 transitions, 395 flow. Second operand 10 states and 153 transitions. [2024-11-12 15:59:21,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 96 transitions, 875 flow [2024-11-12 15:59:21,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 96 transitions, 804 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-11-12 15:59:21,323 INFO L231 Difference]: Finished difference. Result has 79 places, 50 transitions, 405 flow [2024-11-12 15:59:21,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=405, PETRI_PLACES=79, PETRI_TRANSITIONS=50} [2024-11-12 15:59:21,324 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 49 predicate places. [2024-11-12 15:59:21,324 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 50 transitions, 405 flow [2024-11-12 15:59:21,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-12 15:59:21,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 15:59:21,324 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:59:21,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-12 15:59:21,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:59:21,528 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 15:59:21,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:59:21,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1841714377, now seen corresponding path program 4 times [2024-11-12 15:59:21,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:59:21,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505061546] [2024-11-12 15:59:21,529 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-12 15:59:21,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:59:21,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:59:21,531 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:59:21,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-12 15:59:21,562 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-12 15:59:21,562 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 15:59:21,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 15:59:21,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:59:21,616 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-12 15:59:21,616 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:59:21,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:59:21,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505061546] [2024-11-12 15:59:21,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [505061546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:59:21,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:59:21,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 15:59:21,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425475806] [2024-11-12 15:59:21,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:59:21,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 15:59:21,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:59:21,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 15:59:21,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 15:59:21,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-12 15:59:21,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 50 transitions, 405 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-12 15:59:21,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 15:59:21,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-12 15:59:21,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 15:59:21,854 INFO L124 PetriNetUnfolderBase]: 463/887 cut-off events. [2024-11-12 15:59:21,854 INFO L125 PetriNetUnfolderBase]: For 6613/6613 co-relation queries the response was YES. [2024-11-12 15:59:21,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3508 conditions, 887 events. 463/887 cut-off events. For 6613/6613 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4332 event pairs, 152 based on Foata normal form. 18/901 useless extension candidates. Maximal degree in co-relation 3472. Up to 456 conditions per place. [2024-11-12 15:59:21,858 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 54 selfloop transitions, 16 changer transitions 21/95 dead transitions. [2024-11-12 15:59:21,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 95 transitions, 883 flow [2024-11-12 15:59:21,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 15:59:21,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-12 15:59:21,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2024-11-12 15:59:21,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5363984674329502 [2024-11-12 15:59:21,860 INFO L175 Difference]: Start difference. First operand has 79 places, 50 transitions, 405 flow. Second operand 9 states and 140 transitions. [2024-11-12 15:59:21,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 95 transitions, 883 flow [2024-11-12 15:59:21,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 95 transitions, 827 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-11-12 15:59:21,870 INFO L231 Difference]: Finished difference. Result has 81 places, 53 transitions, 468 flow [2024-11-12 15:59:21,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=468, PETRI_PLACES=81, PETRI_TRANSITIONS=53} [2024-11-12 15:59:21,870 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 51 predicate places. [2024-11-12 15:59:21,871 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 53 transitions, 468 flow [2024-11-12 15:59:21,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-12 15:59:21,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 15:59:21,871 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:59:21,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-12 15:59:22,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:59:22,072 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 15:59:22,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:59:22,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1638196562, now seen corresponding path program 1 times [2024-11-12 15:59:22,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:59:22,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1257301745] [2024-11-12 15:59:22,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:59:22,073 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:59:22,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:59:22,074 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:59:22,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-12 15:59:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:59:22,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 15:59:22,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:59:22,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:59:22,181 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:59:22,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:59:22,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:59:22,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1257301745] [2024-11-12 15:59:22,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1257301745] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 15:59:22,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:59:22,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-12 15:59:22,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942906452] [2024-11-12 15:59:22,333 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:59:22,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 15:59:22,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:59:22,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 15:59:22,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-12 15:59:22,348 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-12 15:59:22,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 53 transitions, 468 flow. Second operand has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:59:22,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 15:59:22,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-12 15:59:22,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 15:59:23,040 INFO L124 PetriNetUnfolderBase]: 697/1284 cut-off events. [2024-11-12 15:59:23,040 INFO L125 PetriNetUnfolderBase]: For 14498/14498 co-relation queries the response was YES. [2024-11-12 15:59:23,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5775 conditions, 1284 events. 697/1284 cut-off events. For 14498/14498 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6066 event pairs, 36 based on Foata normal form. 45/1325 useless extension candidates. Maximal degree in co-relation 5738. Up to 191 conditions per place. [2024-11-12 15:59:23,047 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 69 selfloop transitions, 43 changer transitions 60/176 dead transitions. [2024-11-12 15:59:23,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 176 transitions, 1752 flow [2024-11-12 15:59:23,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-12 15:59:23,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-12 15:59:23,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 323 transitions. [2024-11-12 15:59:23,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5303776683087028 [2024-11-12 15:59:23,048 INFO L175 Difference]: Start difference. First operand has 81 places, 53 transitions, 468 flow. Second operand 21 states and 323 transitions. [2024-11-12 15:59:23,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 176 transitions, 1752 flow [2024-11-12 15:59:23,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 176 transitions, 1659 flow, removed 36 selfloop flow, removed 6 redundant places. [2024-11-12 15:59:23,063 INFO L231 Difference]: Finished difference. Result has 103 places, 69 transitions, 885 flow [2024-11-12 15:59:23,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=885, PETRI_PLACES=103, PETRI_TRANSITIONS=69} [2024-11-12 15:59:23,064 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 73 predicate places. [2024-11-12 15:59:23,064 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 69 transitions, 885 flow [2024-11-12 15:59:23,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:59:23,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 15:59:23,064 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:59:23,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-12 15:59:23,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:59:23,267 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 15:59:23,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:59:23,267 INFO L85 PathProgramCache]: Analyzing trace with hash -389170009, now seen corresponding path program 1 times [2024-11-12 15:59:23,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:59:23,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1996988109] [2024-11-12 15:59:23,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:59:23,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:59:23,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:59:23,269 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:59:23,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-12 15:59:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:59:23,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 15:59:23,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:59:23,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:59:23,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:59:23,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:59:23,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:59:23,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1996988109] [2024-11-12 15:59:23,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1996988109] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 15:59:23,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:59:23,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-12 15:59:23,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317819021] [2024-11-12 15:59:23,485 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:59:23,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 15:59:23,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:59:23,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 15:59:23,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-12 15:59:23,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-12 15:59:23,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 69 transitions, 885 flow. Second operand has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:59:23,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 15:59:23,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-12 15:59:23,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 15:59:24,040 INFO L124 PetriNetUnfolderBase]: 787/1487 cut-off events. [2024-11-12 15:59:24,041 INFO L125 PetriNetUnfolderBase]: For 27581/27581 co-relation queries the response was YES. [2024-11-12 15:59:24,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7600 conditions, 1487 events. 787/1487 cut-off events. For 27581/27581 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 7270 event pairs, 239 based on Foata normal form. 63/1546 useless extension candidates. Maximal degree in co-relation 7555. Up to 828 conditions per place. [2024-11-12 15:59:24,048 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 85 selfloop transitions, 19 changer transitions 67/175 dead transitions. [2024-11-12 15:59:24,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 175 transitions, 2251 flow [2024-11-12 15:59:24,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 15:59:24,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-12 15:59:24,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 288 transitions. [2024-11-12 15:59:24,050 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5226860254083484 [2024-11-12 15:59:24,050 INFO L175 Difference]: Start difference. First operand has 103 places, 69 transitions, 885 flow. Second operand 19 states and 288 transitions. [2024-11-12 15:59:24,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 175 transitions, 2251 flow [2024-11-12 15:59:24,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 175 transitions, 1697 flow, removed 258 selfloop flow, removed 14 redundant places. [2024-11-12 15:59:24,079 INFO L231 Difference]: Finished difference. Result has 115 places, 75 transitions, 766 flow [2024-11-12 15:59:24,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=766, PETRI_PLACES=115, PETRI_TRANSITIONS=75} [2024-11-12 15:59:24,079 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 85 predicate places. [2024-11-12 15:59:24,080 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 75 transitions, 766 flow [2024-11-12 15:59:24,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:59:24,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 15:59:24,080 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:59:24,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-12 15:59:24,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:59:24,281 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 15:59:24,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:59:24,281 INFO L85 PathProgramCache]: Analyzing trace with hash -295210743, now seen corresponding path program 2 times [2024-11-12 15:59:24,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:59:24,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371448573] [2024-11-12 15:59:24,282 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 15:59:24,282 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:59:24,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:59:24,283 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:59:24,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-12 15:59:24,314 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 15:59:24,314 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 15:59:24,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 15:59:24,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:59:24,375 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-12 15:59:24,375 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:59:24,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:59:24,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1371448573] [2024-11-12 15:59:24,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1371448573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:59:24,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:59:24,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 15:59:24,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787527978] [2024-11-12 15:59:24,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:59:24,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 15:59:24,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:59:24,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 15:59:24,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 15:59:24,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-12 15:59:24,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 75 transitions, 766 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:59:24,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 15:59:24,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-12 15:59:24,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 15:59:24,771 INFO L124 PetriNetUnfolderBase]: 913/1748 cut-off events. [2024-11-12 15:59:24,772 INFO L125 PetriNetUnfolderBase]: For 34035/34035 co-relation queries the response was YES. [2024-11-12 15:59:24,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8774 conditions, 1748 events. 913/1748 cut-off events. For 34035/34035 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 9458 event pairs, 248 based on Foata normal form. 27/1771 useless extension candidates. Maximal degree in co-relation 8724. Up to 852 conditions per place. [2024-11-12 15:59:24,781 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 98 selfloop transitions, 22 changer transitions 27/151 dead transitions. [2024-11-12 15:59:24,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 151 transitions, 1902 flow [2024-11-12 15:59:24,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 15:59:24,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-12 15:59:24,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 206 transitions. [2024-11-12 15:59:24,784 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5464190981432361 [2024-11-12 15:59:24,784 INFO L175 Difference]: Start difference. First operand has 115 places, 75 transitions, 766 flow. Second operand 13 states and 206 transitions. [2024-11-12 15:59:24,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 151 transitions, 1902 flow [2024-11-12 15:59:24,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 151 transitions, 1609 flow, removed 134 selfloop flow, removed 12 redundant places. [2024-11-12 15:59:24,810 INFO L231 Difference]: Finished difference. Result has 115 places, 81 transitions, 834 flow [2024-11-12 15:59:24,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=834, PETRI_PLACES=115, PETRI_TRANSITIONS=81} [2024-11-12 15:59:24,811 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 85 predicate places. [2024-11-12 15:59:24,811 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 81 transitions, 834 flow [2024-11-12 15:59:24,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:59:24,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 15:59:24,811 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:59:24,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-12 15:59:25,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:59:25,015 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 15:59:25,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:59:25,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1659104887, now seen corresponding path program 3 times [2024-11-12 15:59:25,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:59:25,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345515358] [2024-11-12 15:59:25,016 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 15:59:25,017 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:59:25,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:59:25,018 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:59:25,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-12 15:59:25,048 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-12 15:59:25,048 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 15:59:25,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 15:59:25,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:59:25,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:59:25,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:59:25,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:59:25,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:59:25,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345515358] [2024-11-12 15:59:25,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1345515358] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 15:59:25,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:59:25,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-12 15:59:25,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243547528] [2024-11-12 15:59:25,237 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:59:25,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 15:59:25,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:59:25,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 15:59:25,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-12 15:59:25,254 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-12 15:59:25,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 81 transitions, 834 flow. Second operand has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:59:25,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 15:59:25,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-12 15:59:25,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 15:59:26,048 INFO L124 PetriNetUnfolderBase]: 1048/1950 cut-off events. [2024-11-12 15:59:26,048 INFO L125 PetriNetUnfolderBase]: For 44868/44868 co-relation queries the response was YES. [2024-11-12 15:59:26,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10487 conditions, 1950 events. 1048/1950 cut-off events. For 44868/44868 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 9955 event pairs, 102 based on Foata normal form. 90/2036 useless extension candidates. Maximal degree in co-relation 10437. Up to 445 conditions per place. [2024-11-12 15:59:26,060 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 92 selfloop transitions, 54 changer transitions 82/232 dead transitions. [2024-11-12 15:59:26,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 232 transitions, 2972 flow [2024-11-12 15:59:26,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-12 15:59:26,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-11-12 15:59:26,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 383 transitions. [2024-11-12 15:59:26,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5282758620689655 [2024-11-12 15:59:26,062 INFO L175 Difference]: Start difference. First operand has 115 places, 81 transitions, 834 flow. Second operand 25 states and 383 transitions. [2024-11-12 15:59:26,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 232 transitions, 2972 flow [2024-11-12 15:59:26,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 232 transitions, 2705 flow, removed 113 selfloop flow, removed 9 redundant places. [2024-11-12 15:59:26,112 INFO L231 Difference]: Finished difference. Result has 143 places, 93 transitions, 1215 flow [2024-11-12 15:59:26,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1215, PETRI_PLACES=143, PETRI_TRANSITIONS=93} [2024-11-12 15:59:26,113 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 113 predicate places. [2024-11-12 15:59:26,114 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 93 transitions, 1215 flow [2024-11-12 15:59:26,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.076923076923077) internal successors, (131), 13 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 15:59:26,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 15:59:26,114 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:59:26,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-12 15:59:26,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:59:26,315 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 15:59:26,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:59:26,315 INFO L85 PathProgramCache]: Analyzing trace with hash -792000172, now seen corresponding path program 1 times [2024-11-12 15:59:26,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:59:26,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1077784613] [2024-11-12 15:59:26,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:59:26,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:59:26,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:59:26,319 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:59:26,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-12 15:59:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:59:26,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 15:59:26,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:59:26,446 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 15:59:26,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:59:26,675 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 15:59:26,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:59:26,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1077784613] [2024-11-12 15:59:26,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1077784613] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 15:59:26,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:59:26,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-12 15:59:26,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561683694] [2024-11-12 15:59:26,676 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:59:26,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 15:59:26,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:59:26,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 15:59:26,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-11-12 15:59:26,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-12 15:59:26,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 93 transitions, 1215 flow. Second operand has 19 states, 19 states have (on average 10.263157894736842) internal successors, (195), 19 states have internal predecessors, (195), 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-12 15:59:26,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 15:59:26,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-12 15:59:26,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 15:59:28,283 INFO L124 PetriNetUnfolderBase]: 1624/2968 cut-off events. [2024-11-12 15:59:28,283 INFO L125 PetriNetUnfolderBase]: For 110410/110410 co-relation queries the response was YES. [2024-11-12 15:59:28,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18529 conditions, 2968 events. 1624/2968 cut-off events. For 110410/110410 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 15528 event pairs, 48 based on Foata normal form. 72/3036 useless extension candidates. Maximal degree in co-relation 18467. Up to 473 conditions per place. [2024-11-12 15:59:28,301 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 122 selfloop transitions, 104 changer transitions 105/335 dead transitions. [2024-11-12 15:59:28,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 335 transitions, 5258 flow [2024-11-12 15:59:28,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-12 15:59:28,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-11-12 15:59:28,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 551 transitions. [2024-11-12 15:59:28,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-11-12 15:59:28,303 INFO L175 Difference]: Start difference. First operand has 143 places, 93 transitions, 1215 flow. Second operand 36 states and 551 transitions. [2024-11-12 15:59:28,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 335 transitions, 5258 flow [2024-11-12 15:59:28,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 335 transitions, 4487 flow, removed 368 selfloop flow, removed 16 redundant places. [2024-11-12 15:59:28,418 INFO L231 Difference]: Finished difference. Result has 181 places, 135 transitions, 2222 flow [2024-11-12 15:59:28,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=2222, PETRI_PLACES=181, PETRI_TRANSITIONS=135} [2024-11-12 15:59:28,418 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 151 predicate places. [2024-11-12 15:59:28,419 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 135 transitions, 2222 flow [2024-11-12 15:59:28,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.263157894736842) internal successors, (195), 19 states have internal predecessors, (195), 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-12 15:59:28,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 15:59:28,419 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:59:28,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-12 15:59:28,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:59:28,621 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 15:59:28,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:59:28,622 INFO L85 PathProgramCache]: Analyzing trace with hash -480302225, now seen corresponding path program 2 times [2024-11-12 15:59:28,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:59:28,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1432820661] [2024-11-12 15:59:28,622 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 15:59:28,622 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:59:28,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:59:28,624 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:59:28,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-12 15:59:28,662 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 15:59:28,662 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-12 15:59:28,662 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 15:59:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 15:59:28,713 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-12 15:59:28,713 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 15:59:28,714 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2024-11-12 15:59:28,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2024-11-12 15:59:28,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-11-12 15:59:28,716 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-11-12 15:59:28,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-12 15:59:28,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:59:28,919 INFO L421 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1, 1, 1] [2024-11-12 15:59:28,969 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-12 15:59:28,969 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 15:59:28,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 03:59:28 BasicIcfg [2024-11-12 15:59:28,972 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 15:59:28,973 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 15:59:28,973 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 15:59:28,973 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 15:59:28,973 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:59:17" (3/4) ... [2024-11-12 15:59:28,975 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 15:59:28,976 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 15:59:28,976 INFO L158 Benchmark]: Toolchain (without parser) took 12834.84ms. Allocated memory was 62.9MB in the beginning and 247.5MB in the end (delta: 184.5MB). Free memory was 32.7MB in the beginning and 89.3MB in the end (delta: -56.6MB). Peak memory consumption was 128.3MB. Max. memory is 16.1GB. [2024-11-12 15:59:28,976 INFO L158 Benchmark]: CDTParser took 0.67ms. Allocated memory is still 48.2MB. Free memory is still 26.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 15:59:28,976 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.48ms. Allocated memory is still 62.9MB. Free memory was 32.5MB in the beginning and 27.3MB in the end (delta: 5.2MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2024-11-12 15:59:28,977 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.91ms. Allocated memory is still 62.9MB. Free memory was 27.3MB in the beginning and 25.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 15:59:28,977 INFO L158 Benchmark]: Boogie Preprocessor took 60.96ms. Allocated memory is still 62.9MB. Free memory was 25.2MB in the beginning and 40.5MB in the end (delta: -15.3MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. [2024-11-12 15:59:28,977 INFO L158 Benchmark]: RCFGBuilder took 416.77ms. Allocated memory was 62.9MB in the beginning and 79.7MB in the end (delta: 16.8MB). Free memory was 40.5MB in the beginning and 50.4MB in the end (delta: -9.8MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2024-11-12 15:59:28,977 INFO L158 Benchmark]: TraceAbstraction took 11889.44ms. Allocated memory was 79.7MB in the beginning and 247.5MB in the end (delta: 167.8MB). Free memory was 49.9MB in the beginning and 90.3MB in the end (delta: -40.4MB). Peak memory consumption was 126.1MB. Max. memory is 16.1GB. [2024-11-12 15:59:28,977 INFO L158 Benchmark]: Witness Printer took 3.10ms. Allocated memory is still 247.5MB. Free memory was 90.3MB in the beginning and 89.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 15:59:28,978 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.67ms. Allocated memory is still 48.2MB. Free memory is still 26.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 417.48ms. Allocated memory is still 62.9MB. Free memory was 32.5MB in the beginning and 27.3MB in the end (delta: 5.2MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.91ms. Allocated memory is still 62.9MB. Free memory was 27.3MB in the beginning and 25.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.96ms. Allocated memory is still 62.9MB. Free memory was 25.2MB in the beginning and 40.5MB in the end (delta: -15.3MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. * RCFGBuilder took 416.77ms. Allocated memory was 62.9MB in the beginning and 79.7MB in the end (delta: 16.8MB). Free memory was 40.5MB in the beginning and 50.4MB in the end (delta: -9.8MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11889.44ms. Allocated memory was 79.7MB in the beginning and 247.5MB in the end (delta: 167.8MB). Free memory was 49.9MB in the beginning and 90.3MB in the end (delta: -40.4MB). Peak memory consumption was 126.1MB. Max. memory is 16.1GB. * Witness Printer took 3.10ms. Allocated memory is still 247.5MB. Free memory was 90.3MB in the beginning and 89.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 693]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 693. Possible FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=17, \old(argv)={19:18}, argc=17, i=3, id1=0, j=6] [L696] 1 int k = 0; VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=17, \old(argv)={19:18}, arg={0:0}, argc=17, i=3, id1=0, id2=1, j=6, k=0] [L704] 2 int k = 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L716] 0 int condI = i >= (2*5 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=17, \old(argv)={19:18}, arg={0:0}, arg={0:0}, argc=17, condI=0, i=7, id1=0, id2=1, j=8, k=1, k=1] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L704] COND TRUE 2 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L719] 0 int condJ = j >= (2*5 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=17, \old(argv)={19:18}, arg={0:0}, arg={0:0}, argc=17, condI=0, condJ=1, i=15, id1=0, id2=1, j=16, k=4, k=4] [L721] COND TRUE 0 condI || condJ [L722] CALL 0 reach_error() [L693] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] [L693] 0 __assert_fail ("0", "triangular-2.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=4] - UnprovableResult [Line: 711]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 38 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.8s, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1585 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1565 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4136 IncrementalHoareTripleChecker+Invalid, 4211 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 12 mSDtfsCounter, 4136 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 417 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1167 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2222occurred in iteration=14, InterpolantAutomatonStates: 191, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 270 NumberOfCodeBlocks, 270 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 1741 SizeOfPredicates, 44 NumberOfNonLiveVariables, 679 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 18 InterpolantComputations, 10 PerfectInterpolantSequences, 2/58 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 15:59:28,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample