./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 c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/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-?-c7c6ca5-m [2024-11-09 10:22:17,423 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:22:17,482 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:22:17,489 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:22:17,489 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:22:17,511 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:22:17,511 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:22:17,512 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:22:17,512 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:22:17,512 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:22:17,513 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:22:17,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:22:17,513 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:22:17,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:22:17,514 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:22:17,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:22:17,515 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:22:17,515 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:22:17,515 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:22:17,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:22:17,516 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:22:17,516 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:22:17,516 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:22:17,517 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:22:17,517 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:22:17,517 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:22:17,517 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:22:17,517 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:22:17,518 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:22:17,518 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:22:17,518 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:22:17,518 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:22:17,519 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:22:17,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:22:17,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:22:17,519 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:22:17,520 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:22:17,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:22:17,520 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:22:17,521 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:22:17,521 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:22:17,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:22:17,523 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-09 10:22:17,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:22:17,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:22:17,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:22:17,775 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:22:17,775 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:22:17,776 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-09 10:22:19,131 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:22:19,382 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:22:19,384 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i [2024-11-09 10:22:19,400 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b6c9e6f6/bcd9b7336e044977b83fcaf37f0045b1/FLAG1cb098f91 [2024-11-09 10:22:19,414 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b6c9e6f6/bcd9b7336e044977b83fcaf37f0045b1 [2024-11-09 10:22:19,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:22:19,430 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:22:19,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:22:19,431 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:22:19,436 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:22:19,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:22:19" (1/1) ... [2024-11-09 10:22:19,439 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@704532e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:19, skipping insertion in model container [2024-11-09 10:22:19,439 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:22:19" (1/1) ... [2024-11-09 10:22:19,475 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:22:19,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:22:19,852 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:22:19,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:22:19,931 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:22:19,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:19 WrapperNode [2024-11-09 10:22:19,932 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:22:19,932 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:22:19,933 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:22:19,933 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:22:19,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:19" (1/1) ... [2024-11-09 10:22:19,954 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:19" (1/1) ... [2024-11-09 10:22:19,975 INFO L138 Inliner]: procedures = 168, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2024-11-09 10:22:19,976 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:22:19,977 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:22:19,977 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:22:19,977 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:22:19,985 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:19" (1/1) ... [2024-11-09 10:22:19,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:19" (1/1) ... [2024-11-09 10:22:19,989 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:19" (1/1) ... [2024-11-09 10:22:20,009 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 10:22:20,009 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:19" (1/1) ... [2024-11-09 10:22:20,009 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:19" (1/1) ... [2024-11-09 10:22:20,012 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:19" (1/1) ... [2024-11-09 10:22:20,015 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:19" (1/1) ... [2024-11-09 10:22:20,016 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:19" (1/1) ... [2024-11-09 10:22:20,017 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:19" (1/1) ... [2024-11-09 10:22:20,018 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:22:20,019 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:22:20,019 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:22:20,019 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:22:20,020 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:19" (1/1) ... [2024-11-09 10:22:20,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:22:20,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:22:20,065 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 10:22:20,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 10:22:20,130 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-09 10:22:20,131 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-09 10:22:20,131 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-09 10:22:20,131 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-09 10:22:20,131 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 10:22:20,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:22:20,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:22:20,131 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 10:22:20,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:22:20,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:22:20,133 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:22:20,227 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:22:20,232 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:22:20,331 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:22:20,332 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:22:20,397 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:22:20,397 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 10:22:20,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:22:20 BoogieIcfgContainer [2024-11-09 10:22:20,397 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:22:20,399 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:22:20,399 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:22:20,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:22:20,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:22:19" (1/3) ... [2024-11-09 10:22:20,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f20dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:22:20, skipping insertion in model container [2024-11-09 10:22:20,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:19" (2/3) ... [2024-11-09 10:22:20,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f20dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:22:20, skipping insertion in model container [2024-11-09 10:22:20,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:22:20" (3/3) ... [2024-11-09 10:22:20,404 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2024-11-09 10:22:20,416 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:22:20,416 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 10:22:20,416 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:22:20,443 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:22:20,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 66 flow [2024-11-09 10:22:20,495 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2024-11-09 10:22:20,496 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:22:20,498 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-09 10:22:20,498 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 66 flow [2024-11-09 10:22:20,502 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 27 transitions, 60 flow [2024-11-09 10:22:20,514 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:22:20,526 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;@3940e4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:22:20,527 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-09 10:22:20,536 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:22:20,536 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2024-11-09 10:22:20,536 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:22:20,536 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:20,537 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:20,537 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-09 10:22:20,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:20,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1038261642, now seen corresponding path program 1 times [2024-11-09 10:22:20,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:20,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391445284] [2024-11-09 10:22:20,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:20,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:20,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:20,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:20,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391445284] [2024-11-09 10:22:20,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391445284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:20,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:20,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:22:20,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091042180] [2024-11-09 10:22:20,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:20,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:22:20,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:20,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:22:20,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:22:20,779 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 29 [2024-11-09 10:22:20,781 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-09 10:22:20,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:20,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 29 [2024-11-09 10:22:20,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:20,859 INFO L124 PetriNetUnfolderBase]: 70/157 cut-off events. [2024-11-09 10:22:20,862 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:22:20,863 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-09 10:22:20,864 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 11 selfloop transitions, 1 changer transitions 1/23 dead transitions. [2024-11-09 10:22:20,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 23 transitions, 78 flow [2024-11-09 10:22:20,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:22:20,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:22:20,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2024-11-09 10:22:20,908 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5977011494252874 [2024-11-09 10:22:20,909 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 60 flow. Second operand 3 states and 52 transitions. [2024-11-09 10:22:20,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 23 transitions, 78 flow [2024-11-09 10:22:20,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 23 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:22:20,914 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 50 flow [2024-11-09 10:22:20,915 INFO L260 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-09 10:22:20,918 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2024-11-09 10:22:20,918 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 50 flow [2024-11-09 10:22:20,918 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-09 10:22:20,919 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:20,919 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:20,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:22:20,919 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-09 10:22:20,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:20,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1038262774, now seen corresponding path program 1 times [2024-11-09 10:22:20,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:20,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797703246] [2024-11-09 10:22:20,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:20,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:21,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:21,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:21,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797703246] [2024-11-09 10:22:21,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797703246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:21,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:21,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:22:21,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898448989] [2024-11-09 10:22:21,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:21,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:22:21,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:21,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:22:21,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:22:21,215 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-09 10:22:21,215 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-09 10:22:21,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:21,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-09 10:22:21,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:21,368 INFO L124 PetriNetUnfolderBase]: 273/487 cut-off events. [2024-11-09 10:22:21,368 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:22:21,370 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-09 10:22:21,373 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 25 selfloop transitions, 4 changer transitions 21/54 dead transitions. [2024-11-09 10:22:21,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 54 transitions, 212 flow [2024-11-09 10:22:21,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:22:21,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:22:21,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2024-11-09 10:22:21,375 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5689655172413793 [2024-11-09 10:22:21,375 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 50 flow. Second operand 6 states and 99 transitions. [2024-11-09 10:22:21,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 54 transitions, 212 flow [2024-11-09 10:22:21,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 54 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:22:21,377 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 74 flow [2024-11-09 10:22:21,377 INFO L260 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-09 10:22:21,378 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2024-11-09 10:22:21,378 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 74 flow [2024-11-09 10:22:21,378 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-09 10:22:21,379 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:21,379 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:21,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:22:21,379 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-09 10:22:21,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:21,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1117686194, now seen corresponding path program 1 times [2024-11-09 10:22:21,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:21,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087063705] [2024-11-09 10:22:21,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:21,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:21,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:21,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:21,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087063705] [2024-11-09 10:22:21,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087063705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:21,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:21,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:22:21,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298535818] [2024-11-09 10:22:21,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:21,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:22:21,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:21,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:22:21,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:22:21,518 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-09 10:22:21,519 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-09 10:22:21,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:21,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-09 10:22:21,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:21,672 INFO L124 PetriNetUnfolderBase]: 382/704 cut-off events. [2024-11-09 10:22:21,673 INFO L125 PetriNetUnfolderBase]: For 276/276 co-relation queries the response was YES. [2024-11-09 10:22:21,674 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-09 10:22:21,677 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 46 selfloop transitions, 9 changer transitions 20/79 dead transitions. [2024-11-09 10:22:21,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 79 transitions, 382 flow [2024-11-09 10:22:21,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 10:22:21,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 10:22:21,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-11-09 10:22:21,679 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2024-11-09 10:22:21,679 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 74 flow. Second operand 9 states and 144 transitions. [2024-11-09 10:22:21,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 79 transitions, 382 flow [2024-11-09 10:22:21,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 79 transitions, 366 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-11-09 10:22:21,683 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 159 flow [2024-11-09 10:22:21,683 INFO L260 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-09 10:22:21,683 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 14 predicate places. [2024-11-09 10:22:21,684 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 159 flow [2024-11-09 10:22:21,684 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-09 10:22:21,684 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:21,684 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:21,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:22:21,684 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-09 10:22:21,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:21,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1000674482, now seen corresponding path program 2 times [2024-11-09 10:22:21,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:21,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548592851] [2024-11-09 10:22:21,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:21,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:21,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:21,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:21,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548592851] [2024-11-09 10:22:21,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548592851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:21,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:21,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:22:21,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287204493] [2024-11-09 10:22:21,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:21,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:22:21,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:21,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:22:21,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:22:21,777 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-09 10:22:21,777 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-09 10:22:21,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:21,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-09 10:22:21,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:21,943 INFO L124 PetriNetUnfolderBase]: 328/611 cut-off events. [2024-11-09 10:22:21,944 INFO L125 PetriNetUnfolderBase]: For 971/971 co-relation queries the response was YES. [2024-11-09 10:22:21,945 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-09 10:22:21,947 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 38 selfloop transitions, 9 changer transitions 28/79 dead transitions. [2024-11-09 10:22:21,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 79 transitions, 499 flow [2024-11-09 10:22:21,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:22:21,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 10:22:21,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2024-11-09 10:22:21,949 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5474137931034483 [2024-11-09 10:22:21,949 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 159 flow. Second operand 8 states and 127 transitions. [2024-11-09 10:22:21,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 79 transitions, 499 flow [2024-11-09 10:22:21,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 79 transitions, 491 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-11-09 10:22:21,953 INFO L231 Difference]: Finished difference. Result has 51 places, 34 transitions, 213 flow [2024-11-09 10:22:21,953 INFO L260 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-09 10:22:21,954 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2024-11-09 10:22:21,954 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 34 transitions, 213 flow [2024-11-09 10:22:21,954 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-09 10:22:21,954 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:21,955 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:21,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:22:21,955 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-09 10:22:21,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:21,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1356857717, now seen corresponding path program 1 times [2024-11-09 10:22:21,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:21,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666306749] [2024-11-09 10:22:21,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:21,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:22,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:22,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:22,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666306749] [2024-11-09 10:22:22,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666306749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:22,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:22,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:22:22,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068727757] [2024-11-09 10:22:22,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:22,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:22:22,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:22,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:22:22,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:22:22,058 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-09 10:22:22,059 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-09 10:22:22,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:22,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-09 10:22:22,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:22,255 INFO L124 PetriNetUnfolderBase]: 337/620 cut-off events. [2024-11-09 10:22:22,255 INFO L125 PetriNetUnfolderBase]: For 1649/1649 co-relation queries the response was YES. [2024-11-09 10:22:22,257 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-09 10:22:22,259 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 46 selfloop transitions, 16 changer transitions 24/90 dead transitions. [2024-11-09 10:22:22,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 90 transitions, 610 flow [2024-11-09 10:22:22,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:22:22,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 10:22:22,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2024-11-09 10:22:22,261 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5266457680250783 [2024-11-09 10:22:22,261 INFO L175 Difference]: Start difference. First operand has 51 places, 34 transitions, 213 flow. Second operand 11 states and 168 transitions. [2024-11-09 10:22:22,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 90 transitions, 610 flow [2024-11-09 10:22:22,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 90 transitions, 543 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-11-09 10:22:22,268 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 282 flow [2024-11-09 10:22:22,268 INFO L260 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-09 10:22:22,268 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 26 predicate places. [2024-11-09 10:22:22,269 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 282 flow [2024-11-09 10:22:22,269 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-09 10:22:22,269 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:22,269 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:22,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:22:22,269 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-09 10:22:22,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:22,270 INFO L85 PathProgramCache]: Analyzing trace with hash 392343623, now seen corresponding path program 2 times [2024-11-09 10:22:22,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:22,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292042072] [2024-11-09 10:22:22,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:22,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:22,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:22,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:22,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292042072] [2024-11-09 10:22:22,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292042072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:22,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:22,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:22:22,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984811037] [2024-11-09 10:22:22,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:22,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:22:22,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:22,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:22:22,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:22:22,354 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-09 10:22:22,354 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-09 10:22:22,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:22,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-09 10:22:22,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:22,572 INFO L124 PetriNetUnfolderBase]: 445/807 cut-off events. [2024-11-09 10:22:22,573 INFO L125 PetriNetUnfolderBase]: For 2473/2473 co-relation queries the response was YES. [2024-11-09 10:22:22,576 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-09 10:22:22,579 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 44 selfloop transitions, 23 changer transitions 30/101 dead transitions. [2024-11-09 10:22:22,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 101 transitions, 742 flow [2024-11-09 10:22:22,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:22:22,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 10:22:22,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 171 transitions. [2024-11-09 10:22:22,580 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5360501567398119 [2024-11-09 10:22:22,580 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 282 flow. Second operand 11 states and 171 transitions. [2024-11-09 10:22:22,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 101 transitions, 742 flow [2024-11-09 10:22:22,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 101 transitions, 688 flow, removed 21 selfloop flow, removed 4 redundant places. [2024-11-09 10:22:22,588 INFO L231 Difference]: Finished difference. Result has 67 places, 46 transitions, 393 flow [2024-11-09 10:22:22,588 INFO L260 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-09 10:22:22,589 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 37 predicate places. [2024-11-09 10:22:22,590 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 46 transitions, 393 flow [2024-11-09 10:22:22,590 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-09 10:22:22,590 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:22,590 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:22,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:22:22,591 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-09 10:22:22,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:22,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1383133169, now seen corresponding path program 1 times [2024-11-09 10:22:22,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:22,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121444298] [2024-11-09 10:22:22,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:22,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:22,703 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-09 10:22:22,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:22,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121444298] [2024-11-09 10:22:22,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121444298] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:22:22,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062823514] [2024-11-09 10:22:22,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:22,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:22:22,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:22:22,713 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-09 10:22:22,716 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-09 10:22:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:22,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:22:22,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:22,829 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-09 10:22:22,829 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:22:22,931 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-09 10:22:22,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062823514] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:22:22,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:22:22,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-09 10:22:22,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239542718] [2024-11-09 10:22:22,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:22:22,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 10:22:22,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:22,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 10:22:22,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-09 10:22:22,946 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-09 10:22:22,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 46 transitions, 393 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-09 10:22:22,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:22,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-09 10:22:22,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:23,338 INFO L124 PetriNetUnfolderBase]: 571/1058 cut-off events. [2024-11-09 10:22:23,338 INFO L125 PetriNetUnfolderBase]: For 6872/6872 co-relation queries the response was YES. [2024-11-09 10:22:23,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4148 conditions, 1058 events. 571/1058 cut-off events. For 6872/6872 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4466 event pairs, 137 based on Foata normal form. 63/1117 useless extension candidates. Maximal degree in co-relation 4119. Up to 486 conditions per place. [2024-11-09 10:22:23,344 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 64 selfloop transitions, 17 changer transitions 67/152 dead transitions. [2024-11-09 10:22:23,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 152 transitions, 1349 flow [2024-11-09 10:22:23,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 10:22:23,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-09 10:22:23,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 288 transitions. [2024-11-09 10:22:23,346 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5226860254083484 [2024-11-09 10:22:23,346 INFO L175 Difference]: Start difference. First operand has 67 places, 46 transitions, 393 flow. Second operand 19 states and 288 transitions. [2024-11-09 10:22:23,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 152 transitions, 1349 flow [2024-11-09 10:22:23,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 152 transitions, 1270 flow, removed 32 selfloop flow, removed 5 redundant places. [2024-11-09 10:22:23,356 INFO L231 Difference]: Finished difference. Result has 90 places, 52 transitions, 524 flow [2024-11-09 10:22:23,356 INFO L260 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=19, PETRI_FLOW=524, PETRI_PLACES=90, PETRI_TRANSITIONS=52} [2024-11-09 10:22:23,357 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 60 predicate places. [2024-11-09 10:22:23,357 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 52 transitions, 524 flow [2024-11-09 10:22:23,357 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-09 10:22:23,357 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:23,357 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:23,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 10:22:23,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:22:23,558 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-09 10:22:23,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:23,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1985942713, now seen corresponding path program 2 times [2024-11-09 10:22:23,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:23,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140986714] [2024-11-09 10:22:23,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:23,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:23,680 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-09 10:22:23,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:23,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140986714] [2024-11-09 10:22:23,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140986714] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:22:23,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456255543] [2024-11-09 10:22:23,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:22:23,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:22:23,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:22:23,685 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-09 10:22:23,686 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-09 10:22:23,735 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:22:23,736 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:22:23,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:22:23,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:23,797 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-09 10:22:23,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:22:23,920 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-09 10:22:23,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456255543] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:22:23,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:22:23,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-09 10:22:23,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193226710] [2024-11-09 10:22:23,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:22:23,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 10:22:23,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:23,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 10:22:23,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-09 10:22:23,948 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-09 10:22:23,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 52 transitions, 524 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-09 10:22:23,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:23,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-09 10:22:23,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:24,569 INFO L124 PetriNetUnfolderBase]: 877/1628 cut-off events. [2024-11-09 10:22:24,569 INFO L125 PetriNetUnfolderBase]: For 29480/29480 co-relation queries the response was YES. [2024-11-09 10:22:24,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8520 conditions, 1628 events. 877/1628 cut-off events. For 29480/29480 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 7913 event pairs, 70 based on Foata normal form. 72/1696 useless extension candidates. Maximal degree in co-relation 8480. Up to 249 conditions per place. [2024-11-09 10:22:24,581 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 88 selfloop transitions, 46 changer transitions 80/218 dead transitions. [2024-11-09 10:22:24,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 218 transitions, 2565 flow [2024-11-09 10:22:24,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-09 10:22:24,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-11-09 10:22:24,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 415 transitions. [2024-11-09 10:22:24,583 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5300127713920817 [2024-11-09 10:22:24,583 INFO L175 Difference]: Start difference. First operand has 90 places, 52 transitions, 524 flow. Second operand 27 states and 415 transitions. [2024-11-09 10:22:24,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 218 transitions, 2565 flow [2024-11-09 10:22:24,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 218 transitions, 2089 flow, removed 227 selfloop flow, removed 12 redundant places. [2024-11-09 10:22:24,599 INFO L231 Difference]: Finished difference. Result has 116 places, 70 transitions, 908 flow [2024-11-09 10:22:24,599 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=908, PETRI_PLACES=116, PETRI_TRANSITIONS=70} [2024-11-09 10:22:24,600 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 86 predicate places. [2024-11-09 10:22:24,600 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 70 transitions, 908 flow [2024-11-09 10:22:24,601 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-09 10:22:24,601 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:24,601 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:24,618 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-09 10:22:24,805 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,SelfDestructingSolverStorable7 [2024-11-09 10:22:24,809 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-09 10:22:24,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:24,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1216840336, now seen corresponding path program 1 times [2024-11-09 10:22:24,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:24,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662214548] [2024-11-09 10:22:24,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:24,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:24,981 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-09 10:22:24,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:24,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662214548] [2024-11-09 10:22:24,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662214548] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:22:24,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698406542] [2024-11-09 10:22:24,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:24,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:22:24,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:22:24,990 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-09 10:22:24,992 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-09 10:22:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:25,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 10:22:25,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:25,132 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-09 10:22:25,132 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:22:25,297 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-09 10:22:25,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698406542] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:22:25,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:22:25,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-09 10:22:25,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109426205] [2024-11-09 10:22:25,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:22:25,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 10:22:25,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:25,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 10:22:25,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-11-09 10:22:25,336 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-09 10:22:25,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 70 transitions, 908 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-09 10:22:25,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:25,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-09 10:22:25,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:26,115 INFO L124 PetriNetUnfolderBase]: 1093/2114 cut-off events. [2024-11-09 10:22:26,115 INFO L125 PetriNetUnfolderBase]: For 73277/73277 co-relation queries the response was YES. [2024-11-09 10:22:26,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13414 conditions, 2114 events. 1093/2114 cut-off events. For 73277/73277 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 11488 event pairs, 94 based on Foata normal form. 72/2182 useless extension candidates. Maximal degree in co-relation 13362. Up to 409 conditions per place. [2024-11-09 10:22:26,134 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 86 selfloop transitions, 64 changer transitions 88/242 dead transitions. [2024-11-09 10:22:26,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 242 transitions, 3738 flow [2024-11-09 10:22:26,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-09 10:22:26,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2024-11-09 10:22:26,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 425 transitions. [2024-11-09 10:22:26,137 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5233990147783252 [2024-11-09 10:22:26,138 INFO L175 Difference]: Start difference. First operand has 116 places, 70 transitions, 908 flow. Second operand 28 states and 425 transitions. [2024-11-09 10:22:26,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 242 transitions, 3738 flow [2024-11-09 10:22:26,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 242 transitions, 3143 flow, removed 281 selfloop flow, removed 15 redundant places. [2024-11-09 10:22:26,198 INFO L231 Difference]: Finished difference. Result has 138 places, 92 transitions, 1417 flow [2024-11-09 10:22:26,198 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1417, PETRI_PLACES=138, PETRI_TRANSITIONS=92} [2024-11-09 10:22:26,199 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 108 predicate places. [2024-11-09 10:22:26,200 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 92 transitions, 1417 flow [2024-11-09 10:22:26,200 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-09 10:22:26,200 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:26,200 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:26,217 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-09 10:22:26,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:22:26,401 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-09 10:22:26,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:26,402 INFO L85 PathProgramCache]: Analyzing trace with hash -974308042, now seen corresponding path program 2 times [2024-11-09 10:22:26,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:26,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833066424] [2024-11-09 10:22:26,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:26,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:26,503 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:26,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:26,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833066424] [2024-11-09 10:22:26,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833066424] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:22:26,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593457258] [2024-11-09 10:22:26,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:22:26,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:22:26,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:22:26,506 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-09 10:22:26,509 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-09 10:22:26,554 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:22:26,555 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:22:26,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 10:22:26,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:26,609 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:26,609 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:22:26,744 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:26,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593457258] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:22:26,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:22:26,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-11-09 10:22:26,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630955708] [2024-11-09 10:22:26,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:22:26,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 10:22:26,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:26,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 10:22:26,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-11-09 10:22:26,763 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-09 10:22:26,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 92 transitions, 1417 flow. Second operand has 18 states, 18 states have (on average 10.055555555555555) internal successors, (181), 18 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:22:26,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:26,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-09 10:22:26,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:27,820 INFO L124 PetriNetUnfolderBase]: 1399/2654 cut-off events. [2024-11-09 10:22:27,821 INFO L125 PetriNetUnfolderBase]: For 156808/156808 co-relation queries the response was YES. [2024-11-09 10:22:27,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19910 conditions, 2654 events. 1399/2654 cut-off events. For 156808/156808 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 14350 event pairs, 50 based on Foata normal form. 99/2749 useless extension candidates. Maximal degree in co-relation 19848. Up to 528 conditions per place. [2024-11-09 10:22:27,841 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 112 selfloop transitions, 95 changer transitions 113/324 dead transitions. [2024-11-09 10:22:27,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 324 transitions, 6002 flow [2024-11-09 10:22:27,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-09 10:22:27,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-11-09 10:22:27,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 551 transitions. [2024-11-09 10:22:27,843 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-11-09 10:22:27,843 INFO L175 Difference]: Start difference. First operand has 138 places, 92 transitions, 1417 flow. Second operand 36 states and 551 transitions. [2024-11-09 10:22:27,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 324 transitions, 6002 flow [2024-11-09 10:22:28,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 324 transitions, 5013 flow, removed 469 selfloop flow, removed 16 redundant places. [2024-11-09 10:22:28,065 INFO L231 Difference]: Finished difference. Result has 172 places, 120 transitions, 2180 flow [2024-11-09 10:22:28,066 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1016, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=2180, PETRI_PLACES=172, PETRI_TRANSITIONS=120} [2024-11-09 10:22:28,069 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 142 predicate places. [2024-11-09 10:22:28,070 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 120 transitions, 2180 flow [2024-11-09 10:22:28,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.055555555555555) internal successors, (181), 18 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:22:28,070 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:28,070 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:28,089 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-09 10:22:28,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:22:28,271 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-09 10:22:28,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:28,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1191975869, now seen corresponding path program 3 times [2024-11-09 10:22:28,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:28,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440299631] [2024-11-09 10:22:28,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:28,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:28,558 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:28,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:28,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440299631] [2024-11-09 10:22:28,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440299631] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:22:28,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121014491] [2024-11-09 10:22:28,561 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:22:28,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:22:28,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:22:28,562 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:22:28,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 10:22:28,606 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-09 10:22:28,607 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:22:28,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 10:22:28,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:28,668 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:28,669 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:22:28,739 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:28,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121014491] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:22:28,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:22:28,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 15 [2024-11-09 10:22:28,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66555316] [2024-11-09 10:22:28,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:22:28,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 10:22:28,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:28,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 10:22:28,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-09 10:22:28,764 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-09 10:22:28,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 120 transitions, 2180 flow. Second operand has 16 states, 16 states have (on average 9.8125) internal successors, (157), 16 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:22:28,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:28,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-09 10:22:28,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:29,577 INFO L124 PetriNetUnfolderBase]: 1444/2765 cut-off events. [2024-11-09 10:22:29,578 INFO L125 PetriNetUnfolderBase]: For 202456/202456 co-relation queries the response was YES. [2024-11-09 10:22:29,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21212 conditions, 2765 events. 1444/2765 cut-off events. For 202456/202456 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 14718 event pairs, 74 based on Foata normal form. 18/2779 useless extension candidates. Maximal degree in co-relation 21135. Up to 486 conditions per place. [2024-11-09 10:22:29,603 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 104 selfloop transitions, 98 changer transitions 51/257 dead transitions. [2024-11-09 10:22:29,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 257 transitions, 4926 flow [2024-11-09 10:22:29,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 10:22:29,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-11-09 10:22:29,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 365 transitions. [2024-11-09 10:22:29,605 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5244252873563219 [2024-11-09 10:22:29,605 INFO L175 Difference]: Start difference. First operand has 172 places, 120 transitions, 2180 flow. Second operand 24 states and 365 transitions. [2024-11-09 10:22:29,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 257 transitions, 4926 flow [2024-11-09 10:22:29,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 257 transitions, 3755 flow, removed 551 selfloop flow, removed 24 redundant places. [2024-11-09 10:22:29,824 INFO L231 Difference]: Finished difference. Result has 172 places, 133 transitions, 2094 flow [2024-11-09 10:22:29,824 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1517, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2094, PETRI_PLACES=172, PETRI_TRANSITIONS=133} [2024-11-09 10:22:29,824 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 142 predicate places. [2024-11-09 10:22:29,825 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 133 transitions, 2094 flow [2024-11-09 10:22:29,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.8125) internal successors, (157), 16 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:22:29,825 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:29,825 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:29,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 10:22:30,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 10:22:30,027 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-09 10:22:30,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:30,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1362475303, now seen corresponding path program 4 times [2024-11-09 10:22:30,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:30,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539563609] [2024-11-09 10:22:30,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:30,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:22:30,037 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:22:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:22:30,060 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:22:30,060 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:22:30,061 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2024-11-09 10:22:30,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2024-11-09 10:22:30,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-11-09 10:22:30,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-11-09 10:22:30,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 10:22:30,063 INFO L407 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 1, 1] [2024-11-09 10:22:30,109 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:22:30,110 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:22:30,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:22:30 BasicIcfg [2024-11-09 10:22:30,114 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:22:30,114 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:22:30,115 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:22:30,115 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:22:30,115 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:22:20" (3/4) ... [2024-11-09 10:22:30,117 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:22:30,118 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:22:30,119 INFO L158 Benchmark]: Toolchain (without parser) took 10688.68ms. Allocated memory was 142.6MB in the beginning and 547.4MB in the end (delta: 404.8MB). Free memory was 70.7MB in the beginning and 344.1MB in the end (delta: -273.4MB). Peak memory consumption was 131.8MB. Max. memory is 16.1GB. [2024-11-09 10:22:30,119 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 142.6MB. Free memory is still 97.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:22:30,119 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.55ms. Allocated memory was 142.6MB in the beginning and 216.0MB in the end (delta: 73.4MB). Free memory was 70.4MB in the beginning and 175.3MB in the end (delta: -104.9MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-11-09 10:22:30,119 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.88ms. Allocated memory is still 216.0MB. Free memory was 175.3MB in the beginning and 173.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:22:30,120 INFO L158 Benchmark]: Boogie Preprocessor took 41.43ms. Allocated memory is still 216.0MB. Free memory was 173.2MB in the beginning and 171.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:22:30,120 INFO L158 Benchmark]: RCFGBuilder took 378.71ms. Allocated memory is still 216.0MB. Free memory was 171.1MB in the beginning and 152.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 10:22:30,120 INFO L158 Benchmark]: TraceAbstraction took 9714.85ms. Allocated memory was 216.0MB in the beginning and 547.4MB in the end (delta: 331.4MB). Free memory was 151.2MB in the beginning and 345.1MB in the end (delta: -193.9MB). Peak memory consumption was 137.4MB. Max. memory is 16.1GB. [2024-11-09 10:22:30,120 INFO L158 Benchmark]: Witness Printer took 3.84ms. Allocated memory is still 547.4MB. Free memory is still 344.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:22:30,121 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 142.6MB. Free memory is still 97.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 500.55ms. Allocated memory was 142.6MB in the beginning and 216.0MB in the end (delta: 73.4MB). Free memory was 70.4MB in the beginning and 175.3MB in the end (delta: -104.9MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.88ms. Allocated memory is still 216.0MB. Free memory was 175.3MB in the beginning and 173.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.43ms. Allocated memory is still 216.0MB. Free memory was 173.2MB in the beginning and 171.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 378.71ms. Allocated memory is still 216.0MB. Free memory was 171.1MB in the beginning and 152.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9714.85ms. Allocated memory was 216.0MB in the beginning and 547.4MB in the end (delta: 331.4MB). Free memory was 151.2MB in the beginning and 345.1MB in the end (delta: -193.9MB). Peak memory consumption was 137.4MB. Max. memory is 16.1GB. * Witness Printer took 3.84ms. Allocated memory is still 547.4MB. Free memory is still 344.1MB. 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] [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)=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] [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] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [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=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] [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] [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] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [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=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] [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] [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] [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=13, id1=-1, id2=0, 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: 9.6s, OverallIterations: 12, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1658 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1631 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2966 IncrementalHoareTripleChecker+Invalid, 3077 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 10 mSDtfsCounter, 2966 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 435 GetRequests, 209 SyntacticMatches, 8 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1599 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2180occurred in iteration=10, InterpolantAutomatonStates: 182, 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.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 362 NumberOfCodeBlocks, 362 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 423 ConstructedInterpolants, 0 QuantifiedInterpolants, 1586 SizeOfPredicates, 29 NumberOfNonLiveVariables, 500 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 0/174 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 10:22:30,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/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-?-c7c6ca5-m [2024-11-09 10:22:32,294 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:22:32,365 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:22:32,371 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:22:32,372 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:22:32,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:22:32,401 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:22:32,401 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:22:32,402 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:22:32,403 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:22:32,403 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:22:32,403 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:22:32,404 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:22:32,404 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:22:32,404 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:22:32,406 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:22:32,406 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:22:32,406 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:22:32,406 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:22:32,407 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:22:32,407 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:22:32,410 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:22:32,410 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:22:32,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:22:32,411 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:22:32,411 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:22:32,411 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:22:32,411 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:22:32,411 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:22:32,411 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:22:32,411 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:22:32,412 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:22:32,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:22:32,412 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:22:32,412 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:22:32,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:22:32,413 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:22:32,415 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:22:32,415 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:22:32,416 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:22:32,416 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:22:32,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:22:32,416 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:22:32,416 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:22:32,417 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-09 10:22:32,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:22:32,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:22:32,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:22:32,713 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:22:32,713 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:22:32,714 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-09 10:22:34,938 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:22:35,198 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:22:35,199 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i [2024-11-09 10:22:35,213 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dbc204d5/552467b684a444fe9dbffbc29cb5d1c7/FLAG5c19cd51c [2024-11-09 10:22:35,228 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dbc204d5/552467b684a444fe9dbffbc29cb5d1c7 [2024-11-09 10:22:35,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:22:35,232 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:22:35,237 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:22:35,237 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:22:35,244 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:22:35,245 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:22:35" (1/1) ... [2024-11-09 10:22:35,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c1cb214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:35, skipping insertion in model container [2024-11-09 10:22:35,246 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:22:35" (1/1) ... [2024-11-09 10:22:35,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:22:35,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:22:35,729 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:22:35,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:22:35,812 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:22:35,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:35 WrapperNode [2024-11-09 10:22:35,813 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:22:35,813 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:22:35,814 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:22:35,814 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:22:35,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:35" (1/1) ... [2024-11-09 10:22:35,835 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:35" (1/1) ... [2024-11-09 10:22:35,854 INFO L138 Inliner]: procedures = 169, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 40 [2024-11-09 10:22:35,855 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:22:35,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:22:35,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:22:35,856 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:22:35,863 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:35" (1/1) ... [2024-11-09 10:22:35,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:35" (1/1) ... [2024-11-09 10:22:35,866 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:35" (1/1) ... [2024-11-09 10:22:35,879 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 10:22:35,880 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:35" (1/1) ... [2024-11-09 10:22:35,881 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:35" (1/1) ... [2024-11-09 10:22:35,887 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:35" (1/1) ... [2024-11-09 10:22:35,890 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:35" (1/1) ... [2024-11-09 10:22:35,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:35" (1/1) ... [2024-11-09 10:22:35,894 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:35" (1/1) ... [2024-11-09 10:22:35,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:22:35,896 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:22:35,896 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:22:35,896 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:22:35,897 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:35" (1/1) ... [2024-11-09 10:22:35,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:22:35,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:22:35,931 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 10:22:35,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 10:22:35,984 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-09 10:22:35,985 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-09 10:22:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-09 10:22:35,985 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-09 10:22:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 10:22:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:22:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:22:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 10:22:35,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:22:35,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:22:35,988 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:22:36,116 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:22:36,118 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:22:36,251 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:22:36,253 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:22:36,359 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:22:36,360 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 10:22:36,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:22:36 BoogieIcfgContainer [2024-11-09 10:22:36,360 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:22:36,363 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:22:36,364 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:22:36,366 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:22:36,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:22:35" (1/3) ... [2024-11-09 10:22:36,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@200cd417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:22:36, skipping insertion in model container [2024-11-09 10:22:36,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:35" (2/3) ... [2024-11-09 10:22:36,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@200cd417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:22:36, skipping insertion in model container [2024-11-09 10:22:36,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:22:36" (3/3) ... [2024-11-09 10:22:36,369 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2024-11-09 10:22:36,382 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:22:36,383 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 10:22:36,383 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:22:36,427 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 10:22:36,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 66 flow [2024-11-09 10:22:36,506 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2024-11-09 10:22:36,506 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:22:36,508 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-09 10:22:36,508 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 66 flow [2024-11-09 10:22:36,514 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 27 transitions, 60 flow [2024-11-09 10:22:36,524 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:22:36,536 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;@1f678606, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:22:36,536 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-09 10:22:36,547 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:22:36,547 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2024-11-09 10:22:36,547 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:22:36,547 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:36,548 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:36,548 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-09 10:22:36,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:36,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1944846646, now seen corresponding path program 1 times [2024-11-09 10:22:36,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:36,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [65905005] [2024-11-09 10:22:36,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:36,562 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:22:36,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:36,565 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:22:36,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 10:22:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:36,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:22:36,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:36,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:36,700 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:22:36,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:22:36,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [65905005] [2024-11-09 10:22:36,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [65905005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:36,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:36,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:22:36,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741400022] [2024-11-09 10:22:36,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:36,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:22:36,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:22:36,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:22:36,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:22:36,735 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 29 [2024-11-09 10:22:36,736 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-09 10:22:36,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:36,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 29 [2024-11-09 10:22:36,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:36,799 INFO L124 PetriNetUnfolderBase]: 70/157 cut-off events. [2024-11-09 10:22:36,799 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:22:36,800 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-09 10:22:36,802 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 11 selfloop transitions, 1 changer transitions 1/23 dead transitions. [2024-11-09 10:22:36,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 23 transitions, 78 flow [2024-11-09 10:22:36,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:22:36,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:22:36,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2024-11-09 10:22:36,814 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5977011494252874 [2024-11-09 10:22:36,815 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 60 flow. Second operand 3 states and 52 transitions. [2024-11-09 10:22:36,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 23 transitions, 78 flow [2024-11-09 10:22:36,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 23 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:22:36,819 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 50 flow [2024-11-09 10:22:36,820 INFO L260 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-09 10:22:36,822 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2024-11-09 10:22:36,823 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 50 flow [2024-11-09 10:22:36,823 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-09 10:22:36,823 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:36,823 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:36,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 10:22:37,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:22:37,026 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-09 10:22:37,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:37,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1944845514, now seen corresponding path program 1 times [2024-11-09 10:22:37,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:37,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1529085149] [2024-11-09 10:22:37,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:37,027 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:22:37,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:37,052 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:22:37,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 10:22:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:37,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:22:37,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:37,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:37,184 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:22:37,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:22:37,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1529085149] [2024-11-09 10:22:37,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1529085149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:37,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:37,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:22:37,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590445960] [2024-11-09 10:22:37,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:37,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:22:37,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:22:37,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:22:37,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:22:37,207 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-09 10:22:37,207 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-09 10:22:37,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:37,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-09 10:22:37,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:37,388 INFO L124 PetriNetUnfolderBase]: 328/593 cut-off events. [2024-11-09 10:22:37,389 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:22:37,390 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-09 10:22:37,392 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 29 selfloop transitions, 7 changer transitions 29/69 dead transitions. [2024-11-09 10:22:37,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 69 transitions, 274 flow [2024-11-09 10:22:37,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:22:37,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 10:22:37,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-11-09 10:22:37,395 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5646551724137931 [2024-11-09 10:22:37,395 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 50 flow. Second operand 8 states and 131 transitions. [2024-11-09 10:22:37,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 69 transitions, 274 flow [2024-11-09 10:22:37,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 69 transitions, 273 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:22:37,397 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 100 flow [2024-11-09 10:22:37,397 INFO L260 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-09 10:22:37,398 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2024-11-09 10:22:37,398 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 100 flow [2024-11-09 10:22:37,399 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-09 10:22:37,399 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:37,399 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:37,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 10:22:37,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:22:37,600 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-09 10:22:37,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:37,601 INFO L85 PathProgramCache]: Analyzing trace with hash 407958523, now seen corresponding path program 1 times [2024-11-09 10:22:37,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:37,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578214088] [2024-11-09 10:22:37,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:37,602 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:22:37,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:37,604 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:22:37,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 10:22:37,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:37,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:22:37,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:37,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:37,746 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:22:37,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:22:37,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578214088] [2024-11-09 10:22:37,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [578214088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:37,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:37,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:22:37,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637776370] [2024-11-09 10:22:37,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:37,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:22:37,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:22:37,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:22:37,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:22:37,774 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-09 10:22:37,774 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-09 10:22:37,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:37,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-09 10:22:37,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:37,911 INFO L124 PetriNetUnfolderBase]: 247/454 cut-off events. [2024-11-09 10:22:37,912 INFO L125 PetriNetUnfolderBase]: For 399/399 co-relation queries the response was YES. [2024-11-09 10:22:37,913 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-09 10:22:37,915 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 30 selfloop transitions, 9 changer transitions 16/59 dead transitions. [2024-11-09 10:22:37,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 59 transitions, 316 flow [2024-11-09 10:22:37,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:22:37,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 10:22:37,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2024-11-09 10:22:37,917 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.541871921182266 [2024-11-09 10:22:37,917 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 100 flow. Second operand 7 states and 110 transitions. [2024-11-09 10:22:37,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 59 transitions, 316 flow [2024-11-09 10:22:37,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 59 transitions, 312 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-09 10:22:37,920 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 143 flow [2024-11-09 10:22:37,921 INFO L260 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-09 10:22:37,921 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2024-11-09 10:22:37,921 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 143 flow [2024-11-09 10:22:37,922 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-09 10:22:37,922 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:37,922 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:37,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 10:22:38,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:22:38,124 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-09 10:22:38,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:38,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1492998092, now seen corresponding path program 1 times [2024-11-09 10:22:38,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:38,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726898542] [2024-11-09 10:22:38,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:38,125 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:22:38,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:38,127 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:22:38,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 10:22:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:38,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:22:38,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:38,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:38,209 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:22:38,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:22:38,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [726898542] [2024-11-09 10:22:38,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [726898542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:38,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:38,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:22:38,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298349603] [2024-11-09 10:22:38,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:38,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:22:38,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:22:38,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:22:38,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:22:38,219 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-09 10:22:38,219 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-09 10:22:38,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:38,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-09 10:22:38,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:38,419 INFO L124 PetriNetUnfolderBase]: 391/725 cut-off events. [2024-11-09 10:22:38,420 INFO L125 PetriNetUnfolderBase]: For 1146/1146 co-relation queries the response was YES. [2024-11-09 10:22:38,421 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-09 10:22:38,423 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 47 selfloop transitions, 11 changer transitions 20/82 dead transitions. [2024-11-09 10:22:38,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 82 transitions, 517 flow [2024-11-09 10:22:38,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 10:22:38,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 10:22:38,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-11-09 10:22:38,425 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2024-11-09 10:22:38,425 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 143 flow. Second operand 9 states and 144 transitions. [2024-11-09 10:22:38,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 82 transitions, 517 flow [2024-11-09 10:22:38,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 82 transitions, 478 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-11-09 10:22:38,429 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 236 flow [2024-11-09 10:22:38,429 INFO L260 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-09 10:22:38,430 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 22 predicate places. [2024-11-09 10:22:38,430 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 236 flow [2024-11-09 10:22:38,430 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-09 10:22:38,430 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:38,430 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:38,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 10:22:38,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:22:38,634 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-09 10:22:38,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:38,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1610009804, now seen corresponding path program 2 times [2024-11-09 10:22:38,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:38,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535303500] [2024-11-09 10:22:38,636 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:22:38,636 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:22:38,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:38,641 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:22:38,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 10:22:38,690 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 10:22:38,691 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:22:38,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:22:38,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:38,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:38,736 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:22:38,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:22:38,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535303500] [2024-11-09 10:22:38,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535303500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:38,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:38,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:22:38,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863792789] [2024-11-09 10:22:38,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:38,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:22:38,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:22:38,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:22:38,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:22:38,754 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-09 10:22:38,754 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-09 10:22:38,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:38,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-09 10:22:38,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:38,916 INFO L124 PetriNetUnfolderBase]: 346/655 cut-off events. [2024-11-09 10:22:38,916 INFO L125 PetriNetUnfolderBase]: For 2058/2058 co-relation queries the response was YES. [2024-11-09 10:22:38,918 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-09 10:22:38,920 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 40 selfloop transitions, 12 changer transitions 30/86 dead transitions. [2024-11-09 10:22:38,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 86 transitions, 655 flow [2024-11-09 10:22:38,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 10:22:38,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 10:22:38,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2024-11-09 10:22:38,922 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5363984674329502 [2024-11-09 10:22:38,922 INFO L175 Difference]: Start difference. First operand has 52 places, 36 transitions, 236 flow. Second operand 9 states and 140 transitions. [2024-11-09 10:22:38,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 86 transitions, 655 flow [2024-11-09 10:22:38,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 86 transitions, 595 flow, removed 30 selfloop flow, removed 2 redundant places. [2024-11-09 10:22:38,928 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 278 flow [2024-11-09 10:22:38,928 INFO L260 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-09 10:22:38,929 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 30 predicate places. [2024-11-09 10:22:38,929 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 278 flow [2024-11-09 10:22:38,929 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-09 10:22:38,929 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:38,929 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:38,933 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-09 10:22:39,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:22:39,134 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-09 10:22:39,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:39,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1235422649, now seen corresponding path program 1 times [2024-11-09 10:22:39,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:39,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847609084] [2024-11-09 10:22:39,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:39,135 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:22:39,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:39,137 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:22:39,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 10:22:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:39,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:22:39,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:39,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:39,222 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:22:39,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:22:39,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [847609084] [2024-11-09 10:22:39,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [847609084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:39,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:39,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:22:39,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277131271] [2024-11-09 10:22:39,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:39,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:22:39,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:22:39,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:22:39,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:22:39,231 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-09 10:22:39,231 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-09 10:22:39,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:39,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-09 10:22:39,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:39,586 INFO L124 PetriNetUnfolderBase]: 427/806 cut-off events. [2024-11-09 10:22:39,586 INFO L125 PetriNetUnfolderBase]: For 3492/3492 co-relation queries the response was YES. [2024-11-09 10:22:39,595 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-09 10:22:39,600 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 51 selfloop transitions, 12 changer transitions 26/93 dead transitions. [2024-11-09 10:22:39,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 93 transitions, 752 flow [2024-11-09 10:22:39,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:22:39,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-09 10:22:39,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions. [2024-11-09 10:22:39,609 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5448275862068965 [2024-11-09 10:22:39,609 INFO L175 Difference]: Start difference. First operand has 60 places, 39 transitions, 278 flow. Second operand 10 states and 158 transitions. [2024-11-09 10:22:39,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 93 transitions, 752 flow [2024-11-09 10:22:39,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 93 transitions, 718 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-11-09 10:22:39,634 INFO L231 Difference]: Finished difference. Result has 68 places, 43 transitions, 345 flow [2024-11-09 10:22:39,634 INFO L260 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-09 10:22:39,640 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 38 predicate places. [2024-11-09 10:22:39,640 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 43 transitions, 345 flow [2024-11-09 10:22:39,640 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-09 10:22:39,640 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:39,640 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:39,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 10:22:39,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:22:39,843 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-09 10:22:39,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:39,843 INFO L85 PathProgramCache]: Analyzing trace with hash -14089357, now seen corresponding path program 2 times [2024-11-09 10:22:39,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:39,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232503877] [2024-11-09 10:22:39,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:22:39,848 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:22:39,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:39,851 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:22:39,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 10:22:39,889 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 10:22:39,889 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:22:39,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:22:39,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:39,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:39,949 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:22:39,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:22:39,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232503877] [2024-11-09 10:22:39,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1232503877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:39,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:39,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:22:39,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584714767] [2024-11-09 10:22:39,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:39,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:22:39,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:22:39,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:22:39,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:22:39,960 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-09 10:22:39,960 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-09 10:22:39,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:39,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-09 10:22:39,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:40,207 INFO L124 PetriNetUnfolderBase]: 463/891 cut-off events. [2024-11-09 10:22:40,208 INFO L125 PetriNetUnfolderBase]: For 6473/6473 co-relation queries the response was YES. [2024-11-09 10:22:40,211 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-09 10:22:40,214 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 56 selfloop transitions, 17 changer transitions 30/107 dead transitions. [2024-11-09 10:22:40,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 107 transitions, 978 flow [2024-11-09 10:22:40,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:22:40,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 10:22:40,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 186 transitions. [2024-11-09 10:22:40,216 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2024-11-09 10:22:40,216 INFO L175 Difference]: Start difference. First operand has 68 places, 43 transitions, 345 flow. Second operand 12 states and 186 transitions. [2024-11-09 10:22:40,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 107 transitions, 978 flow [2024-11-09 10:22:40,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 107 transitions, 842 flow, removed 59 selfloop flow, removed 7 redundant places. [2024-11-09 10:22:40,225 INFO L231 Difference]: Finished difference. Result has 75 places, 48 transitions, 395 flow [2024-11-09 10:22:40,227 INFO L260 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-09 10:22:40,228 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 45 predicate places. [2024-11-09 10:22:40,228 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 48 transitions, 395 flow [2024-11-09 10:22:40,229 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-09 10:22:40,229 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:40,229 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:40,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 10:22:40,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:22:40,430 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-09 10:22:40,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:40,430 INFO L85 PathProgramCache]: Analyzing trace with hash 476818575, now seen corresponding path program 3 times [2024-11-09 10:22:40,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:40,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408807934] [2024-11-09 10:22:40,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:22:40,431 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:22:40,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:40,433 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:22:40,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 10:22:40,478 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-09 10:22:40,478 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:22:40,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 10:22:40,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:40,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:40,618 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:22:40,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:22:40,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [408807934] [2024-11-09 10:22:40,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [408807934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:40,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:40,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:22:40,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950664204] [2024-11-09 10:22:40,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:40,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:22:40,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:22:40,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:22:40,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:22:40,636 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-09 10:22:40,636 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-09 10:22:40,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:40,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-09 10:22:40,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:40,868 INFO L124 PetriNetUnfolderBase]: 436/839 cut-off events. [2024-11-09 10:22:40,868 INFO L125 PetriNetUnfolderBase]: For 6137/6137 co-relation queries the response was YES. [2024-11-09 10:22:40,871 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-09 10:22:40,873 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 54 selfloop transitions, 9 changer transitions 29/96 dead transitions. [2024-11-09 10:22:40,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 96 transitions, 875 flow [2024-11-09 10:22:40,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:22:40,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-09 10:22:40,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 153 transitions. [2024-11-09 10:22:40,875 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5275862068965518 [2024-11-09 10:22:40,875 INFO L175 Difference]: Start difference. First operand has 75 places, 48 transitions, 395 flow. Second operand 10 states and 153 transitions. [2024-11-09 10:22:40,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 96 transitions, 875 flow [2024-11-09 10:22:40,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 96 transitions, 804 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-11-09 10:22:40,885 INFO L231 Difference]: Finished difference. Result has 79 places, 50 transitions, 405 flow [2024-11-09 10:22:40,885 INFO L260 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-09 10:22:40,886 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 49 predicate places. [2024-11-09 10:22:40,887 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 50 transitions, 405 flow [2024-11-09 10:22:40,887 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-09 10:22:40,887 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:40,887 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:40,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-09 10:22:41,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:22:41,088 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-09 10:22:41,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:41,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1841714377, now seen corresponding path program 4 times [2024-11-09 10:22:41,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:41,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192526586] [2024-11-09 10:22:41,088 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 10:22:41,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:22:41,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:41,092 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:22:41,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 10:22:41,124 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 10:22:41,124 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:22:41,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:22:41,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:41,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:41,171 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:22:41,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:22:41,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1192526586] [2024-11-09 10:22:41,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1192526586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:41,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:41,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:22:41,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254521794] [2024-11-09 10:22:41,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:41,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:22:41,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:22:41,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:22:41,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:22:41,183 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-09 10:22:41,183 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-09 10:22:41,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:41,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-09 10:22:41,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:41,395 INFO L124 PetriNetUnfolderBase]: 463/887 cut-off events. [2024-11-09 10:22:41,396 INFO L125 PetriNetUnfolderBase]: For 6613/6613 co-relation queries the response was YES. [2024-11-09 10:22:41,397 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-09 10:22:41,400 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 54 selfloop transitions, 16 changer transitions 21/95 dead transitions. [2024-11-09 10:22:41,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 95 transitions, 883 flow [2024-11-09 10:22:41,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 10:22:41,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 10:22:41,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2024-11-09 10:22:41,401 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5363984674329502 [2024-11-09 10:22:41,401 INFO L175 Difference]: Start difference. First operand has 79 places, 50 transitions, 405 flow. Second operand 9 states and 140 transitions. [2024-11-09 10:22:41,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 95 transitions, 883 flow [2024-11-09 10:22:41,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 95 transitions, 827 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-11-09 10:22:41,413 INFO L231 Difference]: Finished difference. Result has 81 places, 53 transitions, 468 flow [2024-11-09 10:22:41,413 INFO L260 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-09 10:22:41,413 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 51 predicate places. [2024-11-09 10:22:41,414 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 53 transitions, 468 flow [2024-11-09 10:22:41,414 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-09 10:22:41,414 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:41,414 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:41,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-09 10:22:41,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:22:41,617 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-09 10:22:41,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:41,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1638196562, now seen corresponding path program 1 times [2024-11-09 10:22:41,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:41,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526174601] [2024-11-09 10:22:41,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:41,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:22:41,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:41,620 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-09 10:22:41,621 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-09 10:22:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:41,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 10:22:41,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:41,706 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-09 10:22:41,706 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:22:41,916 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-09 10:22:41,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:22:41,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526174601] [2024-11-09 10:22:41,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526174601] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:22:41,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:22:41,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-09 10:22:41,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981791934] [2024-11-09 10:22:41,916 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:22:41,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 10:22:41,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:22:41,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 10:22:41,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-09 10:22:41,944 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-09 10:22:41,944 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-09 10:22:41,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:41,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-09 10:22:41,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:42,582 INFO L124 PetriNetUnfolderBase]: 697/1284 cut-off events. [2024-11-09 10:22:42,582 INFO L125 PetriNetUnfolderBase]: For 14498/14498 co-relation queries the response was YES. [2024-11-09 10:22:42,585 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-09 10:22:42,589 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 69 selfloop transitions, 43 changer transitions 60/176 dead transitions. [2024-11-09 10:22:42,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 176 transitions, 1752 flow [2024-11-09 10:22:42,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 10:22:42,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-09 10:22:42,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 323 transitions. [2024-11-09 10:22:42,590 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5303776683087028 [2024-11-09 10:22:42,590 INFO L175 Difference]: Start difference. First operand has 81 places, 53 transitions, 468 flow. Second operand 21 states and 323 transitions. [2024-11-09 10:22:42,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 176 transitions, 1752 flow [2024-11-09 10:22:42,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 176 transitions, 1659 flow, removed 36 selfloop flow, removed 6 redundant places. [2024-11-09 10:22:42,607 INFO L231 Difference]: Finished difference. Result has 103 places, 69 transitions, 885 flow [2024-11-09 10:22:42,607 INFO L260 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-09 10:22:42,608 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 73 predicate places. [2024-11-09 10:22:42,608 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 69 transitions, 885 flow [2024-11-09 10:22:42,608 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-09 10:22:42,608 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:42,608 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:42,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-09 10:22:42,809 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-09 10:22:42,809 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-09 10:22:42,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:42,809 INFO L85 PathProgramCache]: Analyzing trace with hash -389170009, now seen corresponding path program 1 times [2024-11-09 10:22:42,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:42,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2040164251] [2024-11-09 10:22:42,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:42,810 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:22:42,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:42,812 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-09 10:22:42,813 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-09 10:22:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:42,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 10:22:42,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:42,908 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-09 10:22:42,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:22:43,041 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-09 10:22:43,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:22:43,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2040164251] [2024-11-09 10:22:43,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2040164251] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:22:43,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:22:43,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-09 10:22:43,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343010245] [2024-11-09 10:22:43,042 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:22:43,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 10:22:43,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:22:43,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 10:22:43,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-09 10:22:43,075 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-09 10:22:43,075 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-09 10:22:43,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:43,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-09 10:22:43,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:43,677 INFO L124 PetriNetUnfolderBase]: 787/1487 cut-off events. [2024-11-09 10:22:43,677 INFO L125 PetriNetUnfolderBase]: For 27581/27581 co-relation queries the response was YES. [2024-11-09 10:22:43,681 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-09 10:22:43,686 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 85 selfloop transitions, 19 changer transitions 67/175 dead transitions. [2024-11-09 10:22:43,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 175 transitions, 2251 flow [2024-11-09 10:22:43,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 10:22:43,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-09 10:22:43,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 288 transitions. [2024-11-09 10:22:43,688 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5226860254083484 [2024-11-09 10:22:43,688 INFO L175 Difference]: Start difference. First operand has 103 places, 69 transitions, 885 flow. Second operand 19 states and 288 transitions. [2024-11-09 10:22:43,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 175 transitions, 2251 flow [2024-11-09 10:22:43,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 175 transitions, 1697 flow, removed 258 selfloop flow, removed 14 redundant places. [2024-11-09 10:22:43,723 INFO L231 Difference]: Finished difference. Result has 115 places, 75 transitions, 766 flow [2024-11-09 10:22:43,724 INFO L260 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-09 10:22:43,724 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 85 predicate places. [2024-11-09 10:22:43,724 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 75 transitions, 766 flow [2024-11-09 10:22:43,725 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-09 10:22:43,725 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:43,725 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:43,728 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 (12)] Forceful destruction successful, exit code 0 [2024-11-09 10:22:43,925 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-09 10:22:43,926 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-09 10:22:43,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:43,926 INFO L85 PathProgramCache]: Analyzing trace with hash -295210743, now seen corresponding path program 2 times [2024-11-09 10:22:43,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:43,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020615774] [2024-11-09 10:22:43,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:22:43,927 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:22:43,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:43,929 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-09 10:22:43,936 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-09 10:22:43,969 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:22:43,969 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:22:43,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 10:22:43,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:44,020 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-09 10:22:44,020 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:22:44,137 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-09 10:22:44,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:22:44,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020615774] [2024-11-09 10:22:44,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020615774] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:22:44,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:22:44,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-09 10:22:44,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83059068] [2024-11-09 10:22:44,138 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:22:44,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 10:22:44,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:22:44,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 10:22:44,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-09 10:22:44,155 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-09 10:22:44,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 75 transitions, 766 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-09 10:22:44,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:44,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-09 10:22:44,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:45,429 INFO L124 PetriNetUnfolderBase]: 1246/2341 cut-off events. [2024-11-09 10:22:45,429 INFO L125 PetriNetUnfolderBase]: For 56993/56993 co-relation queries the response was YES. [2024-11-09 10:22:45,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13174 conditions, 2341 events. 1246/2341 cut-off events. For 56993/56993 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 12828 event pairs, 88 based on Foata normal form. 63/2400 useless extension candidates. Maximal degree in co-relation 13124. Up to 478 conditions per place. [2024-11-09 10:22:45,448 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 129 selfloop transitions, 54 changer transitions 59/246 dead transitions. [2024-11-09 10:22:45,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 246 transitions, 3242 flow [2024-11-09 10:22:45,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-09 10:22:45,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-11-09 10:22:45,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 421 transitions. [2024-11-09 10:22:45,451 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5376756066411239 [2024-11-09 10:22:45,451 INFO L175 Difference]: Start difference. First operand has 115 places, 75 transitions, 766 flow. Second operand 27 states and 421 transitions. [2024-11-09 10:22:45,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 246 transitions, 3242 flow [2024-11-09 10:22:45,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 246 transitions, 2735 flow, removed 241 selfloop flow, removed 12 redundant places. [2024-11-09 10:22:45,502 INFO L231 Difference]: Finished difference. Result has 139 places, 97 transitions, 1308 flow [2024-11-09 10:22:45,502 INFO L260 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=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1308, PETRI_PLACES=139, PETRI_TRANSITIONS=97} [2024-11-09 10:22:45,503 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 109 predicate places. [2024-11-09 10:22:45,503 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 97 transitions, 1308 flow [2024-11-09 10:22:45,503 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-09 10:22:45,503 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:45,503 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:45,508 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 (13)] Forceful destruction successful, exit code 0 [2024-11-09 10:22:45,703 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-09 10:22:45,704 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-09 10:22:45,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:45,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1659104887, now seen corresponding path program 3 times [2024-11-09 10:22:45,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:45,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350925434] [2024-11-09 10:22:45,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:22:45,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:22:45,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:45,709 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-09 10:22:45,710 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-09 10:22:45,761 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 10:22:45,762 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:22:45,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 10:22:45,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:45,827 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-09 10:22:45,827 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:22:46,009 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-09 10:22:46,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:22:46,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [350925434] [2024-11-09 10:22:46,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [350925434] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:22:46,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:22:46,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-09 10:22:46,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146555936] [2024-11-09 10:22:46,011 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:22:46,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 10:22:46,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:22:46,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 10:22:46,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-09 10:22:46,042 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-09 10:22:46,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 97 transitions, 1308 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-09 10:22:46,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:46,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-09 10:22:46,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:47,255 INFO L124 PetriNetUnfolderBase]: 1318/2463 cut-off events. [2024-11-09 10:22:47,255 INFO L125 PetriNetUnfolderBase]: For 90317/90317 co-relation queries the response was YES. [2024-11-09 10:22:47,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15105 conditions, 2463 events. 1318/2463 cut-off events. For 90317/90317 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 13451 event pairs, 122 based on Foata normal form. 162/2621 useless extension candidates. Maximal degree in co-relation 15045. Up to 454 conditions per place. [2024-11-09 10:22:47,279 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 99 selfloop transitions, 68 changer transitions 95/266 dead transitions. [2024-11-09 10:22:47,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 266 transitions, 4146 flow [2024-11-09 10:22:47,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 10:22:47,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-11-09 10:22:47,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 383 transitions. [2024-11-09 10:22:47,282 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5282758620689655 [2024-11-09 10:22:47,282 INFO L175 Difference]: Start difference. First operand has 139 places, 97 transitions, 1308 flow. Second operand 25 states and 383 transitions. [2024-11-09 10:22:47,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 266 transitions, 4146 flow [2024-11-09 10:22:47,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 266 transitions, 3311 flow, removed 402 selfloop flow, removed 14 redundant places. [2024-11-09 10:22:47,422 INFO L231 Difference]: Finished difference. Result has 158 places, 115 transitions, 1613 flow [2024-11-09 10:22:47,422 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1613, PETRI_PLACES=158, PETRI_TRANSITIONS=115} [2024-11-09 10:22:47,423 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 128 predicate places. [2024-11-09 10:22:47,423 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 115 transitions, 1613 flow [2024-11-09 10:22:47,423 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-09 10:22:47,423 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:47,423 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:47,429 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-09 10:22:47,626 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-09 10:22:47,627 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-09 10:22:47,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:47,628 INFO L85 PathProgramCache]: Analyzing trace with hash -627287686, now seen corresponding path program 1 times [2024-11-09 10:22:47,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:47,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354594769] [2024-11-09 10:22:47,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:47,629 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:22:47,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:47,632 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-09 10:22:47,633 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-09 10:22:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:47,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 10:22:47,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:47,869 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 10:22:47,869 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:22:48,245 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 10:22:48,245 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:22:48,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354594769] [2024-11-09 10:22:48,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1354594769] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:22:48,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:22:48,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-09 10:22:48,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984072203] [2024-11-09 10:22:48,246 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:22:48,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 10:22:48,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:22:48,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 10:22:48,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-11-09 10:22:48,310 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-09 10:22:48,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 115 transitions, 1613 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-09 10:22:48,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:48,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-09 10:22:48,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:50,008 INFO L124 PetriNetUnfolderBase]: 1687/3115 cut-off events. [2024-11-09 10:22:50,008 INFO L125 PetriNetUnfolderBase]: For 123387/123387 co-relation queries the response was YES. [2024-11-09 10:22:50,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19174 conditions, 3115 events. 1687/3115 cut-off events. For 123387/123387 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 16798 event pairs, 48 based on Foata normal form. 72/3183 useless extension candidates. Maximal degree in co-relation 19107. Up to 477 conditions per place. [2024-11-09 10:22:50,027 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 125 selfloop transitions, 111 changer transitions 105/345 dead transitions. [2024-11-09 10:22:50,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 345 transitions, 5341 flow [2024-11-09 10:22:50,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-09 10:22:50,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-11-09 10:22:50,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 551 transitions. [2024-11-09 10:22:50,029 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-11-09 10:22:50,029 INFO L175 Difference]: Start difference. First operand has 158 places, 115 transitions, 1613 flow. Second operand 36 states and 551 transitions. [2024-11-09 10:22:50,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 345 transitions, 5341 flow [2024-11-09 10:22:50,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 345 transitions, 4700 flow, removed 296 selfloop flow, removed 19 redundant places. [2024-11-09 10:22:50,189 INFO L231 Difference]: Finished difference. Result has 186 places, 154 transitions, 2535 flow [2024-11-09 10:22:50,190 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1230, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=2535, PETRI_PLACES=186, PETRI_TRANSITIONS=154} [2024-11-09 10:22:50,190 INFO L277 CegarLoopForPetriNet]: 30 programPoint places, 156 predicate places. [2024-11-09 10:22:50,190 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 154 transitions, 2535 flow [2024-11-09 10:22:50,190 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-09 10:22:50,190 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:50,191 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:50,194 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 (15)] Forceful destruction successful, exit code 0 [2024-11-09 10:22:50,391 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-09 10:22:50,392 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-09 10:22:50,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:50,392 INFO L85 PathProgramCache]: Analyzing trace with hash 291804209, now seen corresponding path program 2 times [2024-11-09 10:22:50,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:50,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868005463] [2024-11-09 10:22:50,392 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:22:50,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:22:50,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:50,395 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-09 10:22:50,396 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-09 10:22:50,434 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:22:50,434 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-09 10:22:50,434 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:22:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:22:50,504 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 10:22:50,504 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:22:50,505 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2024-11-09 10:22:50,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2024-11-09 10:22:50,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-11-09 10:22:50,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-11-09 10:22:50,517 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-09 10:22:50,710 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-09 10:22:50,711 INFO L407 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1, 1, 1] [2024-11-09 10:22:50,773 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:22:50,773 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:22:50,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:22:50 BasicIcfg [2024-11-09 10:22:50,777 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:22:50,777 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:22:50,777 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:22:50,777 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:22:50,778 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:22:36" (3/4) ... [2024-11-09 10:22:50,780 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:22:50,780 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:22:50,781 INFO L158 Benchmark]: Toolchain (without parser) took 15549.29ms. Allocated memory was 77.6MB in the beginning and 270.5MB in the end (delta: 192.9MB). Free memory was 37.9MB in the beginning and 118.6MB in the end (delta: -80.7MB). Peak memory consumption was 114.0MB. Max. memory is 16.1GB. [2024-11-09 10:22:50,781 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 77.6MB. Free memory is still 57.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:22:50,781 INFO L158 Benchmark]: CACSL2BoogieTranslator took 576.17ms. Allocated memory is still 77.6MB. Free memory was 37.7MB in the beginning and 38.4MB in the end (delta: -771.8kB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2024-11-09 10:22:50,781 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.65ms. Allocated memory is still 77.6MB. Free memory was 38.4MB in the beginning and 36.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:22:50,781 INFO L158 Benchmark]: Boogie Preprocessor took 39.43ms. Allocated memory is still 77.6MB. Free memory was 36.5MB in the beginning and 34.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:22:50,782 INFO L158 Benchmark]: RCFGBuilder took 464.34ms. Allocated memory was 77.6MB in the beginning and 155.2MB in the end (delta: 77.6MB). Free memory was 34.1MB in the beginning and 111.0MB in the end (delta: -76.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 10:22:50,782 INFO L158 Benchmark]: TraceAbstraction took 14414.20ms. Allocated memory was 155.2MB in the beginning and 270.5MB in the end (delta: 115.3MB). Free memory was 110.3MB in the beginning and 119.6MB in the end (delta: -9.3MB). Peak memory consumption was 104.6MB. Max. memory is 16.1GB. [2024-11-09 10:22:50,782 INFO L158 Benchmark]: Witness Printer took 3.20ms. Allocated memory is still 270.5MB. Free memory was 119.6MB in the beginning and 118.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:22:50,783 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.42ms. Allocated memory is still 77.6MB. Free memory is still 57.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 576.17ms. Allocated memory is still 77.6MB. Free memory was 37.7MB in the beginning and 38.4MB in the end (delta: -771.8kB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.65ms. Allocated memory is still 77.6MB. Free memory was 38.4MB in the beginning and 36.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.43ms. Allocated memory is still 77.6MB. Free memory was 36.5MB in the beginning and 34.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 464.34ms. Allocated memory was 77.6MB in the beginning and 155.2MB in the end (delta: 77.6MB). Free memory was 34.1MB in the beginning and 111.0MB in the end (delta: -76.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 14414.20ms. Allocated memory was 155.2MB in the beginning and 270.5MB in the end (delta: 115.3MB). Free memory was 110.3MB in the beginning and 119.6MB in the end (delta: -9.3MB). Peak memory consumption was 104.6MB. Max. memory is 16.1GB. * Witness Printer took 3.20ms. Allocated memory is still 270.5MB. Free memory was 119.6MB in the beginning and 118.6MB 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] [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] [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] [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] [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] [L696] COND TRUE 1 k < 5 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [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=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] [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] [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] [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)=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: 14.2s, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1701 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1681 mSDsluCounter, 64 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4443 IncrementalHoareTripleChecker+Invalid, 4526 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 11 mSDtfsCounter, 4443 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 451 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1371 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2535occurred in iteration=14, InterpolantAutomatonStates: 205, 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, 2.0s InterpolantComputationTime, 270 NumberOfCodeBlocks, 270 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 1930 SizeOfPredicates, 44 NumberOfNonLiveVariables, 679 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 19 InterpolantComputations, 9 PerfectInterpolantSequences, 4/60 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 10:22:50,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample