./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/parallel-misc-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/parallel-misc-2.wvr.c -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 c558e00c0dd9b5f4cf40cba6e03e276a996696c71c282947f4c8d13390dc25bf --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 16:25:32,249 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 16:25:32,319 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 16:25:32,328 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 16:25:32,329 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 16:25:32,372 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 16:25:32,373 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 16:25:32,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 16:25:32,374 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 16:25:32,376 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 16:25:32,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 16:25:32,377 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 16:25:32,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 16:25:32,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 16:25:32,380 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 16:25:32,380 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 16:25:32,381 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 16:25:32,381 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 16:25:32,381 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 16:25:32,381 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 16:25:32,382 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 16:25:32,384 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 16:25:32,385 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 16:25:32,385 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 16:25:32,385 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 16:25:32,385 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 16:25:32,385 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 16:25:32,386 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 16:25:32,386 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 16:25:32,386 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 16:25:32,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 16:25:32,387 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 16:25:32,387 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 16:25:32,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:25:32,387 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 16:25:32,388 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 16:25:32,388 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 16:25:32,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 16:25:32,388 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 16:25:32,388 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 16:25:32,388 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 16:25:32,390 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 16:25:32,390 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 -> c558e00c0dd9b5f4cf40cba6e03e276a996696c71c282947f4c8d13390dc25bf [2024-11-12 16:25:32,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 16:25:32,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 16:25:32,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 16:25:32,710 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 16:25:32,711 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 16:25:32,712 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-2.wvr.c [2024-11-12 16:25:34,148 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 16:25:34,316 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 16:25:34,317 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-2.wvr.c [2024-11-12 16:25:34,328 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/947ad7c8a/bf3e4698e29148988910b9fcb5408906/FLAGb1be046f0 [2024-11-12 16:25:34,347 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/947ad7c8a/bf3e4698e29148988910b9fcb5408906 [2024-11-12 16:25:34,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 16:25:34,351 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 16:25:34,357 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 16:25:34,357 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 16:25:34,363 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 16:25:34,364 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:25:34" (1/1) ... [2024-11-12 16:25:34,364 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bc22c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:25:34, skipping insertion in model container [2024-11-12 16:25:34,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:25:34" (1/1) ... [2024-11-12 16:25:34,388 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 16:25:34,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:25:34,635 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 16:25:34,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:25:34,680 INFO L204 MainTranslator]: Completed translation [2024-11-12 16:25:34,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:25:34 WrapperNode [2024-11-12 16:25:34,682 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 16:25:34,683 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 16:25:34,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 16:25:34,684 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 16:25:34,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:25:34" (1/1) ... [2024-11-12 16:25:34,699 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:25:34" (1/1) ... [2024-11-12 16:25:34,720 INFO L138 Inliner]: procedures = 18, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 64 [2024-11-12 16:25:34,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 16:25:34,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 16:25:34,722 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 16:25:34,722 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 16:25:34,732 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:25:34" (1/1) ... [2024-11-12 16:25:34,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:25:34" (1/1) ... [2024-11-12 16:25:34,734 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:25:34" (1/1) ... [2024-11-12 16:25:34,746 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 16:25:34,746 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:25:34" (1/1) ... [2024-11-12 16:25:34,746 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:25:34" (1/1) ... [2024-11-12 16:25:34,751 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:25:34" (1/1) ... [2024-11-12 16:25:34,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:25:34" (1/1) ... [2024-11-12 16:25:34,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:25:34" (1/1) ... [2024-11-12 16:25:34,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:25:34" (1/1) ... [2024-11-12 16:25:34,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 16:25:34,762 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 16:25:34,762 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 16:25:34,763 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 16:25:34,767 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:25:34" (1/1) ... [2024-11-12 16:25:34,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:25:34,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:25:34,811 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 16:25:34,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 16:25:34,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 16:25:34,865 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-12 16:25:34,865 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-12 16:25:34,866 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-12 16:25:34,866 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-12 16:25:34,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 16:25:34,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 16:25:34,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 16:25:34,868 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 16:25:34,975 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 16:25:34,977 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 16:25:35,203 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 16:25:35,207 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 16:25:35,369 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 16:25:35,371 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 16:25:35,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:25:35 BoogieIcfgContainer [2024-11-12 16:25:35,372 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 16:25:35,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 16:25:35,374 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 16:25:35,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 16:25:35,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:25:34" (1/3) ... [2024-11-12 16:25:35,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15902bd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:25:35, skipping insertion in model container [2024-11-12 16:25:35,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:25:34" (2/3) ... [2024-11-12 16:25:35,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15902bd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:25:35, skipping insertion in model container [2024-11-12 16:25:35,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:25:35" (3/3) ... [2024-11-12 16:25:35,383 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2024-11-12 16:25:35,397 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 16:25:35,398 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 16:25:35,398 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 16:25:35,447 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-12 16:25:35,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 34 transitions, 82 flow [2024-11-12 16:25:35,510 INFO L124 PetriNetUnfolderBase]: 4/32 cut-off events. [2024-11-12 16:25:35,510 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-12 16:25:35,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 32 events. 4/32 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 56 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2024-11-12 16:25:35,517 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 34 transitions, 82 flow [2024-11-12 16:25:35,520 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 31 transitions, 74 flow [2024-11-12 16:25:35,529 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 16:25:35,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;@193ded9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 16:25:35,537 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-12 16:25:35,546 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 16:25:35,546 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2024-11-12 16:25:35,546 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-12 16:25:35,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:25:35,547 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:25:35,548 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 16:25:35,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:25:35,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1272023409, now seen corresponding path program 1 times [2024-11-12 16:25:35,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:25:35,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550559938] [2024-11-12 16:25:35,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:25:35,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:25:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:25:35,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:25:35,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:25:35,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550559938] [2024-11-12 16:25:35,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550559938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:25:35,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:25:35,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:25:35,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867927604] [2024-11-12 16:25:35,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:25:35,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:25:35,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:25:35,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:25:35,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:25:35,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2024-11-12 16:25:35,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:35,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:25:35,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2024-11-12 16:25:35,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:25:36,047 INFO L124 PetriNetUnfolderBase]: 146/286 cut-off events. [2024-11-12 16:25:36,047 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-11-12 16:25:36,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 286 events. 146/286 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 12 based on Foata normal form. 2/258 useless extension candidates. Maximal degree in co-relation 458. Up to 186 conditions per place. [2024-11-12 16:25:36,055 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 21 selfloop transitions, 7 changer transitions 1/40 dead transitions. [2024-11-12 16:25:36,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 159 flow [2024-11-12 16:25:36,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:25:36,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:25:36,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-11-12 16:25:36,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7156862745098039 [2024-11-12 16:25:36,067 INFO L175 Difference]: Start difference. First operand has 34 places, 31 transitions, 74 flow. Second operand 3 states and 73 transitions. [2024-11-12 16:25:36,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 159 flow [2024-11-12 16:25:36,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 40 transitions, 145 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-12 16:25:36,072 INFO L231 Difference]: Finished difference. Result has 31 places, 33 transitions, 101 flow [2024-11-12 16:25:36,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=31, PETRI_TRANSITIONS=33} [2024-11-12 16:25:36,078 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2024-11-12 16:25:36,079 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 33 transitions, 101 flow [2024-11-12 16:25:36,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:36,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:25:36,079 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:25:36,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 16:25:36,080 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 16:25:36,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:25:36,081 INFO L85 PathProgramCache]: Analyzing trace with hash 886991089, now seen corresponding path program 1 times [2024-11-12 16:25:36,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:25:36,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343486678] [2024-11-12 16:25:36,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:25:36,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:25:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:25:36,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:25:36,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:25:36,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343486678] [2024-11-12 16:25:36,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343486678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:25:36,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:25:36,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:25:36,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087644115] [2024-11-12 16:25:36,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:25:36,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:25:36,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:25:36,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:25:36,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:25:36,314 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 34 [2024-11-12 16:25:36,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 33 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:36,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:25:36,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 34 [2024-11-12 16:25:36,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:25:36,505 INFO L124 PetriNetUnfolderBase]: 191/376 cut-off events. [2024-11-12 16:25:36,505 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-11-12 16:25:36,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 777 conditions, 376 events. 191/376 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1705 event pairs, 20 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 276. Up to 143 conditions per place. [2024-11-12 16:25:36,513 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 36 selfloop transitions, 10 changer transitions 5/65 dead transitions. [2024-11-12 16:25:36,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 65 transitions, 290 flow [2024-11-12 16:25:36,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:25:36,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 16:25:36,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2024-11-12 16:25:36,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7235294117647059 [2024-11-12 16:25:36,518 INFO L175 Difference]: Start difference. First operand has 31 places, 33 transitions, 101 flow. Second operand 5 states and 123 transitions. [2024-11-12 16:25:36,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 65 transitions, 290 flow [2024-11-12 16:25:36,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 65 transitions, 281 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 16:25:36,521 INFO L231 Difference]: Finished difference. Result has 37 places, 40 transitions, 155 flow [2024-11-12 16:25:36,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=37, PETRI_TRANSITIONS=40} [2024-11-12 16:25:36,522 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2024-11-12 16:25:36,522 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 40 transitions, 155 flow [2024-11-12 16:25:36,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:36,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:25:36,523 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:25:36,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 16:25:36,523 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 16:25:36,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:25:36,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1876960269, now seen corresponding path program 2 times [2024-11-12 16:25:36,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:25:36,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015671719] [2024-11-12 16:25:36,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:25:36,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:25:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:25:36,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:25:36,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:25:36,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015671719] [2024-11-12 16:25:36,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015671719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:25:36,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:25:36,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:25:36,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040949396] [2024-11-12 16:25:36,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:25:36,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:25:36,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:25:36,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:25:36,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:25:36,684 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 34 [2024-11-12 16:25:36,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 40 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:36,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:25:36,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 34 [2024-11-12 16:25:36,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:25:36,830 INFO L124 PetriNetUnfolderBase]: 185/391 cut-off events. [2024-11-12 16:25:36,831 INFO L125 PetriNetUnfolderBase]: For 233/237 co-relation queries the response was YES. [2024-11-12 16:25:36,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 391 events. 185/391 cut-off events. For 233/237 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1844 event pairs, 12 based on Foata normal form. 12/373 useless extension candidates. Maximal degree in co-relation 345. Up to 88 conditions per place. [2024-11-12 16:25:36,838 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 35 selfloop transitions, 12 changer transitions 4/65 dead transitions. [2024-11-12 16:25:36,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 65 transitions, 348 flow [2024-11-12 16:25:36,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:25:36,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 16:25:36,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2024-11-12 16:25:36,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2024-11-12 16:25:36,842 INFO L175 Difference]: Start difference. First operand has 37 places, 40 transitions, 155 flow. Second operand 5 states and 120 transitions. [2024-11-12 16:25:36,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 65 transitions, 348 flow [2024-11-12 16:25:36,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 65 transitions, 348 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 16:25:36,846 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 241 flow [2024-11-12 16:25:36,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2024-11-12 16:25:36,847 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2024-11-12 16:25:36,847 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 241 flow [2024-11-12 16:25:36,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:36,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:25:36,847 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:25:36,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 16:25:36,848 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 16:25:36,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:25:36,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1246876582, now seen corresponding path program 1 times [2024-11-12 16:25:36,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:25:36,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889453776] [2024-11-12 16:25:36,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:25:36,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:25:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:25:36,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:25:36,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:25:36,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889453776] [2024-11-12 16:25:36,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889453776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:25:36,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:25:36,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:25:36,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183211396] [2024-11-12 16:25:36,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:25:36,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:25:36,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:25:36,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:25:36,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:25:37,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 34 [2024-11-12 16:25:37,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 241 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:37,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:25:37,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 34 [2024-11-12 16:25:37,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:25:37,156 INFO L124 PetriNetUnfolderBase]: 182/379 cut-off events. [2024-11-12 16:25:37,157 INFO L125 PetriNetUnfolderBase]: For 590/593 co-relation queries the response was YES. [2024-11-12 16:25:37,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1172 conditions, 379 events. 182/379 cut-off events. For 590/593 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1803 event pairs, 17 based on Foata normal form. 4/350 useless extension candidates. Maximal degree in co-relation 572. Up to 163 conditions per place. [2024-11-12 16:25:37,163 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 41 selfloop transitions, 9 changer transitions 2/66 dead transitions. [2024-11-12 16:25:37,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 66 transitions, 436 flow [2024-11-12 16:25:37,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:25:37,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 16:25:37,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2024-11-12 16:25:37,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6882352941176471 [2024-11-12 16:25:37,165 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 241 flow. Second operand 5 states and 117 transitions. [2024-11-12 16:25:37,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 66 transitions, 436 flow [2024-11-12 16:25:37,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 66 transitions, 432 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-11-12 16:25:37,171 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 292 flow [2024-11-12 16:25:37,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=292, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2024-11-12 16:25:37,172 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2024-11-12 16:25:37,172 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 292 flow [2024-11-12 16:25:37,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:37,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:25:37,172 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:25:37,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 16:25:37,173 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 16:25:37,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:25:37,173 INFO L85 PathProgramCache]: Analyzing trace with hash -565039444, now seen corresponding path program 2 times [2024-11-12 16:25:37,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:25:37,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639644543] [2024-11-12 16:25:37,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:25:37,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:25:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:25:37,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:25:37,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:25:37,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639644543] [2024-11-12 16:25:37,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639644543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:25:37,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:25:37,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:25:37,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192425167] [2024-11-12 16:25:37,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:25:37,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:25:37,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:25:37,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:25:37,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:25:37,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 34 [2024-11-12 16:25:37,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 292 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:37,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:25:37,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 34 [2024-11-12 16:25:37,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:25:37,423 INFO L124 PetriNetUnfolderBase]: 168/379 cut-off events. [2024-11-12 16:25:37,423 INFO L125 PetriNetUnfolderBase]: For 801/805 co-relation queries the response was YES. [2024-11-12 16:25:37,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 379 events. 168/379 cut-off events. For 801/805 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1704 event pairs, 6 based on Foata normal form. 21/366 useless extension candidates. Maximal degree in co-relation 751. Up to 99 conditions per place. [2024-11-12 16:25:37,429 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 43 selfloop transitions, 12 changer transitions 1/70 dead transitions. [2024-11-12 16:25:37,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 512 flow [2024-11-12 16:25:37,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:25:37,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 16:25:37,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2024-11-12 16:25:37,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6941176470588235 [2024-11-12 16:25:37,432 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 292 flow. Second operand 5 states and 118 transitions. [2024-11-12 16:25:37,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 70 transitions, 512 flow [2024-11-12 16:25:37,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 496 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-11-12 16:25:37,441 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 355 flow [2024-11-12 16:25:37,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=355, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2024-11-12 16:25:37,445 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 23 predicate places. [2024-11-12 16:25:37,446 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 355 flow [2024-11-12 16:25:37,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:37,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:25:37,446 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:25:37,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 16:25:37,447 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 16:25:37,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:25:37,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1009803054, now seen corresponding path program 1 times [2024-11-12 16:25:37,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:25:37,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167828745] [2024-11-12 16:25:37,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:25:37,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:25:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:25:37,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:25:37,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:25:37,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167828745] [2024-11-12 16:25:37,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167828745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:25:37,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:25:37,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 16:25:37,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888373715] [2024-11-12 16:25:37,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:25:37,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 16:25:37,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:25:37,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 16:25:37,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:25:37,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 34 [2024-11-12 16:25:37,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 355 flow. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:37,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:25:37,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 34 [2024-11-12 16:25:37,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:25:37,911 INFO L124 PetriNetUnfolderBase]: 251/511 cut-off events. [2024-11-12 16:25:37,911 INFO L125 PetriNetUnfolderBase]: For 1454/1502 co-relation queries the response was YES. [2024-11-12 16:25:37,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1794 conditions, 511 events. 251/511 cut-off events. For 1454/1502 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2416 event pairs, 14 based on Foata normal form. 20/471 useless extension candidates. Maximal degree in co-relation 712. Up to 163 conditions per place. [2024-11-12 16:25:37,918 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 47 selfloop transitions, 23 changer transitions 0/84 dead transitions. [2024-11-12 16:25:37,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 84 transitions, 694 flow [2024-11-12 16:25:37,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:25:37,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 16:25:37,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2024-11-12 16:25:37,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6323529411764706 [2024-11-12 16:25:37,920 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 355 flow. Second operand 6 states and 129 transitions. [2024-11-12 16:25:37,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 84 transitions, 694 flow [2024-11-12 16:25:37,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 84 transitions, 679 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-11-12 16:25:37,928 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 490 flow [2024-11-12 16:25:37,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=490, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2024-11-12 16:25:37,931 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 29 predicate places. [2024-11-12 16:25:37,931 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 490 flow [2024-11-12 16:25:37,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:37,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:25:37,931 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:25:37,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 16:25:37,932 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 16:25:37,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:25:37,933 INFO L85 PathProgramCache]: Analyzing trace with hash -691476658, now seen corresponding path program 2 times [2024-11-12 16:25:37,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:25:37,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847906099] [2024-11-12 16:25:37,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:25:37,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:25:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:25:38,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:25:38,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:25:38,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847906099] [2024-11-12 16:25:38,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847906099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:25:38,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:25:38,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 16:25:38,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323123954] [2024-11-12 16:25:38,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:25:38,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:25:38,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:25:38,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:25:38,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:25:38,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 34 [2024-11-12 16:25:38,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 490 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:38,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:25:38,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 34 [2024-11-12 16:25:38,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:25:38,246 INFO L124 PetriNetUnfolderBase]: 367/782 cut-off events. [2024-11-12 16:25:38,246 INFO L125 PetriNetUnfolderBase]: For 2674/2682 co-relation queries the response was YES. [2024-11-12 16:25:38,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2822 conditions, 782 events. 367/782 cut-off events. For 2674/2682 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4239 event pairs, 26 based on Foata normal form. 21/726 useless extension candidates. Maximal degree in co-relation 1168. Up to 214 conditions per place. [2024-11-12 16:25:38,255 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 63 selfloop transitions, 10 changer transitions 0/89 dead transitions. [2024-11-12 16:25:38,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 89 transitions, 881 flow [2024-11-12 16:25:38,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:25:38,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 16:25:38,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2024-11-12 16:25:38,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6823529411764706 [2024-11-12 16:25:38,257 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 490 flow. Second operand 5 states and 116 transitions. [2024-11-12 16:25:38,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 89 transitions, 881 flow [2024-11-12 16:25:38,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 89 transitions, 868 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-12 16:25:38,266 INFO L231 Difference]: Finished difference. Result has 67 places, 64 transitions, 560 flow [2024-11-12 16:25:38,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=560, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2024-11-12 16:25:38,266 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 33 predicate places. [2024-11-12 16:25:38,267 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 560 flow [2024-11-12 16:25:38,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:38,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:25:38,267 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:25:38,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 16:25:38,267 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 16:25:38,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:25:38,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1598070576, now seen corresponding path program 3 times [2024-11-12 16:25:38,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:25:38,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115809099] [2024-11-12 16:25:38,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:25:38,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:25:38,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:25:38,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:25:38,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:25:38,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115809099] [2024-11-12 16:25:38,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115809099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:25:38,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:25:38,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:25:38,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521551902] [2024-11-12 16:25:38,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:25:38,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:25:38,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:25:38,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:25:38,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:25:38,402 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 34 [2024-11-12 16:25:38,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 560 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:38,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:25:38,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 34 [2024-11-12 16:25:38,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:25:38,632 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([265] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][37], [44#true, Black: 69#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296)))), Black: 67#(<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296))), Black: 42#(= (mod ~pos~0 4294967296) 0), 87#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), 94#(and (<= 1 (mod ~N~0 2147483648)) (<= (mod ~i2~0 4294967296) 1)), Black: 73#true, 57#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), Black: 78#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0))), 4#L86true, 27#L61-1true, Black: 49#(and (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)) (<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296)))), Black: 47#(<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296))), Black: 46#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), 96#true, Black: 82#true, 76#(<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0)), 64#true, 19#L46-2true, Black: 59#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)) (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296))), Black: 56#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), Black: 54#true]) [2024-11-12 16:25:38,632 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-12 16:25:38,632 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-12 16:25:38,632 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-12 16:25:38,632 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-12 16:25:38,632 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([264] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][38], [44#true, Black: 69#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296)))), Black: 67#(<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296))), Black: 42#(= (mod ~pos~0 4294967296) 0), 87#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), 94#(and (<= 1 (mod ~N~0 2147483648)) (<= (mod ~i2~0 4294967296) 1)), Black: 73#true, 57#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), Black: 78#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0))), 4#L86true, 27#L61-1true, Black: 49#(and (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)) (<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296)))), Black: 47#(<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296))), Black: 46#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), 96#true, Black: 82#true, 76#(<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0)), 11#L43-2true, 64#true, Black: 59#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)) (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296))), Black: 56#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), Black: 54#true]) [2024-11-12 16:25:38,633 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-12 16:25:38,633 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-12 16:25:38,633 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-12 16:25:38,633 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-12 16:25:38,674 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([265] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][37], [44#true, Black: 69#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296)))), Black: 67#(<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296))), Black: 42#(= (mod ~pos~0 4294967296) 0), 87#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), Black: 73#true, Black: 78#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0))), 57#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), 4#L86true, 27#L61-1true, Black: 49#(and (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)) (<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296)))), Black: 47#(<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296))), 90#true, Black: 46#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), 96#true, Black: 82#true, 76#(<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0)), 64#true, 19#L46-2true, Black: 59#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)) (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296))), Black: 56#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), Black: 94#(and (<= 1 (mod ~N~0 2147483648)) (<= (mod ~i2~0 4294967296) 1)), Black: 54#true]) [2024-11-12 16:25:38,674 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-12 16:25:38,674 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-12 16:25:38,675 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-12 16:25:38,675 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-12 16:25:38,675 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([264] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][38], [44#true, Black: 69#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296)))), Black: 67#(<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296))), Black: 42#(= (mod ~pos~0 4294967296) 0), 87#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), Black: 73#true, Black: 78#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0))), 57#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), 4#L86true, 27#L61-1true, Black: 49#(and (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)) (<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296)))), Black: 47#(<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296))), 90#true, Black: 46#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), 96#true, Black: 82#true, 76#(<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0)), 11#L43-2true, 64#true, Black: 59#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)) (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296))), Black: 56#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), Black: 94#(and (<= 1 (mod ~N~0 2147483648)) (<= (mod ~i2~0 4294967296) 1)), Black: 54#true]) [2024-11-12 16:25:38,675 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-12 16:25:38,675 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-12 16:25:38,675 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-12 16:25:38,675 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-12 16:25:38,680 INFO L124 PetriNetUnfolderBase]: 930/1794 cut-off events. [2024-11-12 16:25:38,681 INFO L125 PetriNetUnfolderBase]: For 7334/7413 co-relation queries the response was YES. [2024-11-12 16:25:38,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6820 conditions, 1794 events. 930/1794 cut-off events. For 7334/7413 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 11826 event pairs, 220 based on Foata normal form. 15/1525 useless extension candidates. Maximal degree in co-relation 2026. Up to 541 conditions per place. [2024-11-12 16:25:38,704 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 72 selfloop transitions, 19 changer transitions 0/118 dead transitions. [2024-11-12 16:25:38,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 118 transitions, 1289 flow [2024-11-12 16:25:38,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:25:38,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:25:38,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2024-11-12 16:25:38,706 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7426470588235294 [2024-11-12 16:25:38,706 INFO L175 Difference]: Start difference. First operand has 67 places, 64 transitions, 560 flow. Second operand 4 states and 101 transitions. [2024-11-12 16:25:38,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 118 transitions, 1289 flow [2024-11-12 16:25:38,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 118 transitions, 1280 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-12 16:25:38,719 INFO L231 Difference]: Finished difference. Result has 72 places, 81 transitions, 853 flow [2024-11-12 16:25:38,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=853, PETRI_PLACES=72, PETRI_TRANSITIONS=81} [2024-11-12 16:25:38,720 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 38 predicate places. [2024-11-12 16:25:38,720 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 81 transitions, 853 flow [2024-11-12 16:25:38,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:38,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:25:38,721 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:25:38,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 16:25:38,721 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 16:25:38,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:25:38,722 INFO L85 PathProgramCache]: Analyzing trace with hash -831000144, now seen corresponding path program 1 times [2024-11-12 16:25:38,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:25:38,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498011908] [2024-11-12 16:25:38,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:25:38,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:25:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:25:38,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:25:38,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:25:38,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498011908] [2024-11-12 16:25:38,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498011908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:25:38,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:25:38,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 16:25:38,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317599771] [2024-11-12 16:25:38,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:25:38,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:25:38,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:25:38,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:25:38,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:25:38,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 34 [2024-11-12 16:25:38,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 81 transitions, 853 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:38,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:25:38,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 34 [2024-11-12 16:25:38,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:25:39,227 INFO L124 PetriNetUnfolderBase]: 1133/2350 cut-off events. [2024-11-12 16:25:39,227 INFO L125 PetriNetUnfolderBase]: For 13957/14031 co-relation queries the response was YES. [2024-11-12 16:25:39,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10090 conditions, 2350 events. 1133/2350 cut-off events. For 13957/14031 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 16254 event pairs, 260 based on Foata normal form. 46/2286 useless extension candidates. Maximal degree in co-relation 4725. Up to 628 conditions per place. [2024-11-12 16:25:39,253 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 92 selfloop transitions, 13 changer transitions 0/122 dead transitions. [2024-11-12 16:25:39,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 122 transitions, 1469 flow [2024-11-12 16:25:39,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:25:39,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 16:25:39,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2024-11-12 16:25:39,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6941176470588235 [2024-11-12 16:25:39,255 INFO L175 Difference]: Start difference. First operand has 72 places, 81 transitions, 853 flow. Second operand 5 states and 118 transitions. [2024-11-12 16:25:39,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 122 transitions, 1469 flow [2024-11-12 16:25:39,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 122 transitions, 1469 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 16:25:39,277 INFO L231 Difference]: Finished difference. Result has 77 places, 86 transitions, 965 flow [2024-11-12 16:25:39,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=853, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=965, PETRI_PLACES=77, PETRI_TRANSITIONS=86} [2024-11-12 16:25:39,278 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 43 predicate places. [2024-11-12 16:25:39,281 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 86 transitions, 965 flow [2024-11-12 16:25:39,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:39,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:25:39,281 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:25:39,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 16:25:39,281 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 16:25:39,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:25:39,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1718824083, now seen corresponding path program 2 times [2024-11-12 16:25:39,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:25:39,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952727994] [2024-11-12 16:25:39,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:25:39,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:25:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:25:39,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:25:39,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:25:39,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952727994] [2024-11-12 16:25:39,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952727994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:25:39,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:25:39,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:25:39,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56369986] [2024-11-12 16:25:39,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:25:39,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:25:39,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:25:39,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:25:39,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:25:39,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 34 [2024-11-12 16:25:39,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 86 transitions, 965 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:39,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:25:39,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 34 [2024-11-12 16:25:39,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:25:39,968 INFO L124 PetriNetUnfolderBase]: 1874/3995 cut-off events. [2024-11-12 16:25:39,968 INFO L125 PetriNetUnfolderBase]: For 32531/33035 co-relation queries the response was YES. [2024-11-12 16:25:39,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18586 conditions, 3995 events. 1874/3995 cut-off events. For 32531/33035 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 31197 event pairs, 625 based on Foata normal form. 100/3764 useless extension candidates. Maximal degree in co-relation 8514. Up to 1086 conditions per place. [2024-11-12 16:25:40,013 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 128 selfloop transitions, 22 changer transitions 0/178 dead transitions. [2024-11-12 16:25:40,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 178 transitions, 2495 flow [2024-11-12 16:25:40,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:25:40,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:25:40,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2024-11-12 16:25:40,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-11-12 16:25:40,015 INFO L175 Difference]: Start difference. First operand has 77 places, 86 transitions, 965 flow. Second operand 4 states and 102 transitions. [2024-11-12 16:25:40,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 178 transitions, 2495 flow [2024-11-12 16:25:40,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 178 transitions, 2486 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-12 16:25:40,078 INFO L231 Difference]: Finished difference. Result has 82 places, 106 transitions, 1388 flow [2024-11-12 16:25:40,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=960, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1388, PETRI_PLACES=82, PETRI_TRANSITIONS=106} [2024-11-12 16:25:40,080 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 48 predicate places. [2024-11-12 16:25:40,081 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 106 transitions, 1388 flow [2024-11-12 16:25:40,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:40,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:25:40,081 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:25:40,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 16:25:40,082 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 16:25:40,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:25:40,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1231989786, now seen corresponding path program 1 times [2024-11-12 16:25:40,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:25:40,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881325195] [2024-11-12 16:25:40,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:25:40,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:25:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:25:40,367 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:25:40,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:25:40,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881325195] [2024-11-12 16:25:40,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881325195] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:25:40,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358697648] [2024-11-12 16:25:40,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:25:40,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:25:40,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:25:40,370 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:25:40,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 16:25:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:25:40,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 16:25:40,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:25:40,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:25:40,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:25:40,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:25:40,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358697648] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:25:40,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:25:40,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-11-12 16:25:40,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395938006] [2024-11-12 16:25:40,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:25:40,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:25:40,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:25:40,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:25:40,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:25:40,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2024-11-12 16:25:40,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 106 transitions, 1388 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:40,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:25:40,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2024-11-12 16:25:40,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:25:42,052 INFO L124 PetriNetUnfolderBase]: 3871/8241 cut-off events. [2024-11-12 16:25:42,052 INFO L125 PetriNetUnfolderBase]: For 68457/68838 co-relation queries the response was YES. [2024-11-12 16:25:42,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40211 conditions, 8241 events. 3871/8241 cut-off events. For 68457/68838 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 65820 event pairs, 737 based on Foata normal form. 99/8132 useless extension candidates. Maximal degree in co-relation 19652. Up to 3244 conditions per place. [2024-11-12 16:25:42,129 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 205 selfloop transitions, 21 changer transitions 1/251 dead transitions. [2024-11-12 16:25:42,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 251 transitions, 3870 flow [2024-11-12 16:25:42,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:25:42,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 16:25:42,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2024-11-12 16:25:42,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7647058823529411 [2024-11-12 16:25:42,131 INFO L175 Difference]: Start difference. First operand has 82 places, 106 transitions, 1388 flow. Second operand 5 states and 130 transitions. [2024-11-12 16:25:42,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 251 transitions, 3870 flow [2024-11-12 16:25:42,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 251 transitions, 3870 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 16:25:42,194 INFO L231 Difference]: Finished difference. Result has 87 places, 118 transitions, 1503 flow [2024-11-12 16:25:42,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1388, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1503, PETRI_PLACES=87, PETRI_TRANSITIONS=118} [2024-11-12 16:25:42,195 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 53 predicate places. [2024-11-12 16:25:42,195 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 118 transitions, 1503 flow [2024-11-12 16:25:42,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:42,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:25:42,196 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:25:42,214 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-12 16:25:42,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-12 16:25:42,401 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 16:25:42,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:25:42,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1939449575, now seen corresponding path program 1 times [2024-11-12 16:25:42,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:25:42,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276040941] [2024-11-12 16:25:42,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:25:42,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:25:42,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:25:42,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 16:25:42,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:25:42,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276040941] [2024-11-12 16:25:42,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276040941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:25:42,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:25:42,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:25:42,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683157135] [2024-11-12 16:25:42,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:25:42,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:25:42,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:25:42,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:25:42,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:25:42,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 34 [2024-11-12 16:25:42,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 118 transitions, 1503 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:42,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:25:42,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 34 [2024-11-12 16:25:42,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:25:43,394 INFO L124 PetriNetUnfolderBase]: 2221/4794 cut-off events. [2024-11-12 16:25:43,395 INFO L125 PetriNetUnfolderBase]: For 47834/48405 co-relation queries the response was YES. [2024-11-12 16:25:43,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24836 conditions, 4794 events. 2221/4794 cut-off events. For 47834/48405 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 37653 event pairs, 524 based on Foata normal form. 169/4716 useless extension candidates. Maximal degree in co-relation 8997. Up to 1463 conditions per place. [2024-11-12 16:25:43,436 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 110 selfloop transitions, 22 changer transitions 0/165 dead transitions. [2024-11-12 16:25:43,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 165 transitions, 2307 flow [2024-11-12 16:25:43,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:25:43,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:25:43,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2024-11-12 16:25:43,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7132352941176471 [2024-11-12 16:25:43,438 INFO L175 Difference]: Start difference. First operand has 87 places, 118 transitions, 1503 flow. Second operand 4 states and 97 transitions. [2024-11-12 16:25:43,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 165 transitions, 2307 flow [2024-11-12 16:25:43,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 165 transitions, 2281 flow, removed 13 selfloop flow, removed 0 redundant places. [2024-11-12 16:25:43,476 INFO L231 Difference]: Finished difference. Result has 92 places, 112 transitions, 1446 flow [2024-11-12 16:25:43,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1370, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1446, PETRI_PLACES=92, PETRI_TRANSITIONS=112} [2024-11-12 16:25:43,477 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 58 predicate places. [2024-11-12 16:25:43,478 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 112 transitions, 1446 flow [2024-11-12 16:25:43,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:43,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:25:43,478 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:25:43,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 16:25:43,479 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 16:25:43,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:25:43,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1888546522, now seen corresponding path program 2 times [2024-11-12 16:25:43,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:25:43,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475516579] [2024-11-12 16:25:43,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:25:43,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:25:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:25:43,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:25:43,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:25:43,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475516579] [2024-11-12 16:25:43,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475516579] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:25:43,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046579217] [2024-11-12 16:25:43,734 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 16:25:43,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:25:43,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:25:43,738 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:25:43,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 16:25:43,811 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 16:25:43,811 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:25:43,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 16:25:43,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:25:43,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:25:43,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:25:43,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:25:43,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046579217] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:25:43,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:25:43,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-11-12 16:25:43,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473258601] [2024-11-12 16:25:43,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:25:43,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:25:43,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:25:43,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:25:43,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:25:43,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2024-11-12 16:25:43,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 112 transitions, 1446 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:43,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:25:43,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2024-11-12 16:25:43,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:25:44,750 INFO L124 PetriNetUnfolderBase]: 2415/5215 cut-off events. [2024-11-12 16:25:44,750 INFO L125 PetriNetUnfolderBase]: For 57625/57960 co-relation queries the response was YES. [2024-11-12 16:25:44,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27619 conditions, 5215 events. 2415/5215 cut-off events. For 57625/57960 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 42286 event pairs, 568 based on Foata normal form. 118/5196 useless extension candidates. Maximal degree in co-relation 10846. Up to 3193 conditions per place. [2024-11-12 16:25:44,789 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 140 selfloop transitions, 23 changer transitions 1/189 dead transitions. [2024-11-12 16:25:44,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 189 transitions, 2740 flow [2024-11-12 16:25:44,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:25:44,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 16:25:44,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2024-11-12 16:25:44,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7411764705882353 [2024-11-12 16:25:44,791 INFO L175 Difference]: Start difference. First operand has 92 places, 112 transitions, 1446 flow. Second operand 5 states and 126 transitions. [2024-11-12 16:25:44,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 189 transitions, 2740 flow [2024-11-12 16:25:44,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 189 transitions, 2740 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 16:25:44,837 INFO L231 Difference]: Finished difference. Result has 99 places, 126 transitions, 1613 flow [2024-11-12 16:25:44,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1446, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1613, PETRI_PLACES=99, PETRI_TRANSITIONS=126} [2024-11-12 16:25:44,838 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 65 predicate places. [2024-11-12 16:25:44,838 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 126 transitions, 1613 flow [2024-11-12 16:25:44,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:44,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:25:44,838 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:25:44,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 16:25:45,041 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,SelfDestructingSolverStorable12 [2024-11-12 16:25:45,042 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 16:25:45,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:25:45,042 INFO L85 PathProgramCache]: Analyzing trace with hash 558553874, now seen corresponding path program 3 times [2024-11-12 16:25:45,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:25:45,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450996630] [2024-11-12 16:25:45,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:25:45,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:25:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:25:45,307 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:25:45,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:25:45,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450996630] [2024-11-12 16:25:45,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450996630] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:25:45,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537878010] [2024-11-12 16:25:45,308 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 16:25:45,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:25:45,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:25:45,310 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:25:45,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 16:25:45,394 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-12 16:25:45,394 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:25:45,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 16:25:45,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:25:45,480 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:25:45,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:25:45,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:25:45,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537878010] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:25:45,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:25:45,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-11-12 16:25:45,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074119122] [2024-11-12 16:25:45,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:25:45,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 16:25:45,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:25:45,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 16:25:45,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:25:45,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2024-11-12 16:25:45,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 126 transitions, 1613 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:45,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:25:45,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2024-11-12 16:25:45,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:25:46,652 INFO L124 PetriNetUnfolderBase]: 2781/6020 cut-off events. [2024-11-12 16:25:46,652 INFO L125 PetriNetUnfolderBase]: For 70439/70976 co-relation queries the response was YES. [2024-11-12 16:25:46,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33520 conditions, 6020 events. 2781/6020 cut-off events. For 70439/70976 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 50024 event pairs, 596 based on Foata normal form. 215/6076 useless extension candidates. Maximal degree in co-relation 20440. Up to 2559 conditions per place. [2024-11-12 16:25:46,695 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 191 selfloop transitions, 34 changer transitions 1/251 dead transitions. [2024-11-12 16:25:46,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 251 transitions, 4036 flow [2024-11-12 16:25:46,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:25:46,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 16:25:46,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-11-12 16:25:46,697 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7401960784313726 [2024-11-12 16:25:46,697 INFO L175 Difference]: Start difference. First operand has 99 places, 126 transitions, 1613 flow. Second operand 6 states and 151 transitions. [2024-11-12 16:25:46,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 251 transitions, 4036 flow [2024-11-12 16:25:46,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 251 transitions, 4030 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-11-12 16:25:46,755 INFO L231 Difference]: Finished difference. Result has 105 places, 134 transitions, 1756 flow [2024-11-12 16:25:46,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1607, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1756, PETRI_PLACES=105, PETRI_TRANSITIONS=134} [2024-11-12 16:25:46,756 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 71 predicate places. [2024-11-12 16:25:46,756 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 134 transitions, 1756 flow [2024-11-12 16:25:46,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:46,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:25:46,757 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:25:46,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 16:25:46,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:25:46,962 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 16:25:46,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:25:46,962 INFO L85 PathProgramCache]: Analyzing trace with hash -238160900, now seen corresponding path program 4 times [2024-11-12 16:25:46,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:25:46,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323339570] [2024-11-12 16:25:46,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:25:46,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:25:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:25:47,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:25:47,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:25:47,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323339570] [2024-11-12 16:25:47,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323339570] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:25:47,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678473480] [2024-11-12 16:25:47,145 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-12 16:25:47,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:25:47,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:25:47,147 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:25:47,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 16:25:47,207 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-12 16:25:47,208 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:25:47,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 16:25:47,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:25:47,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:25:47,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:25:47,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:25:47,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678473480] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:25:47,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:25:47,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-11-12 16:25:47,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006253031] [2024-11-12 16:25:47,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:25:47,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 16:25:47,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:25:47,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 16:25:47,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:25:47,376 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2024-11-12 16:25:47,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 134 transitions, 1756 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:47,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:25:47,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2024-11-12 16:25:47,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:25:48,527 INFO L124 PetriNetUnfolderBase]: 3778/8123 cut-off events. [2024-11-12 16:25:48,527 INFO L125 PetriNetUnfolderBase]: For 99818/100558 co-relation queries the response was YES. [2024-11-12 16:25:48,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46941 conditions, 8123 events. 3778/8123 cut-off events. For 99818/100558 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 70683 event pairs, 601 based on Foata normal form. 174/8081 useless extension candidates. Maximal degree in co-relation 33458. Up to 4148 conditions per place. [2024-11-12 16:25:48,592 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 227 selfloop transitions, 36 changer transitions 1/289 dead transitions. [2024-11-12 16:25:48,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 289 transitions, 4625 flow [2024-11-12 16:25:48,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:25:48,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 16:25:48,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2024-11-12 16:25:48,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7549019607843137 [2024-11-12 16:25:48,593 INFO L175 Difference]: Start difference. First operand has 105 places, 134 transitions, 1756 flow. Second operand 6 states and 154 transitions. [2024-11-12 16:25:48,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 289 transitions, 4625 flow [2024-11-12 16:25:48,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 289 transitions, 4579 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-11-12 16:25:48,661 INFO L231 Difference]: Finished difference. Result has 112 places, 158 transitions, 2055 flow [2024-11-12 16:25:48,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1719, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2055, PETRI_PLACES=112, PETRI_TRANSITIONS=158} [2024-11-12 16:25:48,661 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 78 predicate places. [2024-11-12 16:25:48,662 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 158 transitions, 2055 flow [2024-11-12 16:25:48,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:48,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:25:48,662 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:25:48,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 16:25:48,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-12 16:25:48,867 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 16:25:48,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:25:48,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1875114232, now seen corresponding path program 1 times [2024-11-12 16:25:48,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:25:48,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404579744] [2024-11-12 16:25:48,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:25:48,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:25:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:25:49,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:25:49,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:25:49,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404579744] [2024-11-12 16:25:49,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404579744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:25:49,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:25:49,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:25:49,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327145392] [2024-11-12 16:25:49,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:25:49,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:25:49,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:25:49,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:25:49,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:25:49,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 34 [2024-11-12 16:25:49,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 158 transitions, 2055 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:49,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:25:49,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 34 [2024-11-12 16:25:49,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:25:50,084 INFO L124 PetriNetUnfolderBase]: 3513/7361 cut-off events. [2024-11-12 16:25:50,085 INFO L125 PetriNetUnfolderBase]: For 99004/99547 co-relation queries the response was YES. [2024-11-12 16:25:50,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43551 conditions, 7361 events. 3513/7361 cut-off events. For 99004/99547 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 62101 event pairs, 578 based on Foata normal form. 201/7306 useless extension candidates. Maximal degree in co-relation 28120. Up to 2411 conditions per place. [2024-11-12 16:25:50,136 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 168 selfloop transitions, 19 changer transitions 0/243 dead transitions. [2024-11-12 16:25:50,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 243 transitions, 3623 flow [2024-11-12 16:25:50,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:25:50,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 16:25:50,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2024-11-12 16:25:50,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7132352941176471 [2024-11-12 16:25:50,138 INFO L175 Difference]: Start difference. First operand has 112 places, 158 transitions, 2055 flow. Second operand 4 states and 97 transitions. [2024-11-12 16:25:50,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 243 transitions, 3623 flow [2024-11-12 16:25:50,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 243 transitions, 3553 flow, removed 35 selfloop flow, removed 0 redundant places. [2024-11-12 16:25:50,316 INFO L231 Difference]: Finished difference. Result has 117 places, 152 transitions, 1987 flow [2024-11-12 16:25:50,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1922, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1987, PETRI_PLACES=117, PETRI_TRANSITIONS=152} [2024-11-12 16:25:50,317 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 83 predicate places. [2024-11-12 16:25:50,317 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 152 transitions, 1987 flow [2024-11-12 16:25:50,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:50,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:25:50,317 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:25:50,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 16:25:50,318 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 16:25:50,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:25:50,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1561250606, now seen corresponding path program 5 times [2024-11-12 16:25:50,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:25:50,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578042748] [2024-11-12 16:25:50,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:25:50,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:25:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:25:50,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:25:50,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:25:50,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578042748] [2024-11-12 16:25:50,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578042748] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:25:50,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552056535] [2024-11-12 16:25:50,503 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-12 16:25:50,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:25:50,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:25:50,505 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-12 16:25:50,506 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-12 16:25:50,574 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 16:25:50,574 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:25:50,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 16:25:50,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:25:50,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:25:50,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:25:50,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:25:50,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552056535] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:25:50,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:25:50,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-11-12 16:25:50,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118291510] [2024-11-12 16:25:50,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:25:50,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 16:25:50,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:25:50,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 16:25:50,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:25:50,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2024-11-12 16:25:50,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 152 transitions, 1987 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:50,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:25:50,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2024-11-12 16:25:50,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:25:52,116 INFO L124 PetriNetUnfolderBase]: 3683/8098 cut-off events. [2024-11-12 16:25:52,116 INFO L125 PetriNetUnfolderBase]: For 114668/115414 co-relation queries the response was YES. [2024-11-12 16:25:52,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49394 conditions, 8098 events. 3683/8098 cut-off events. For 114668/115414 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 71001 event pairs, 631 based on Foata normal form. 280/8164 useless extension candidates. Maximal degree in co-relation 34607. Up to 2867 conditions per place. [2024-11-12 16:25:52,161 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 211 selfloop transitions, 61 changer transitions 1/299 dead transitions. [2024-11-12 16:25:52,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 299 transitions, 4942 flow [2024-11-12 16:25:52,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:25:52,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 16:25:52,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2024-11-12 16:25:52,162 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-11-12 16:25:52,162 INFO L175 Difference]: Start difference. First operand has 117 places, 152 transitions, 1987 flow. Second operand 6 states and 153 transitions. [2024-11-12 16:25:52,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 299 transitions, 4942 flow [2024-11-12 16:25:52,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 299 transitions, 4942 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 16:25:52,213 INFO L231 Difference]: Finished difference. Result has 125 places, 168 transitions, 2377 flow [2024-11-12 16:25:52,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1987, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2377, PETRI_PLACES=125, PETRI_TRANSITIONS=168} [2024-11-12 16:25:52,213 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 91 predicate places. [2024-11-12 16:25:52,214 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 168 transitions, 2377 flow [2024-11-12 16:25:52,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:52,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:25:52,214 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:25:52,228 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-12 16:25:52,418 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,SelfDestructingSolverStorable16 [2024-11-12 16:25:52,418 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 16:25:52,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:25:52,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1498999340, now seen corresponding path program 6 times [2024-11-12 16:25:52,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:25:52,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798333630] [2024-11-12 16:25:52,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:25:52,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:25:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:25:52,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:25:52,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:25:52,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798333630] [2024-11-12 16:25:52,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798333630] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:25:52,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665690942] [2024-11-12 16:25:52,578 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-12 16:25:52,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:25:52,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:25:52,580 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:25:52,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-12 16:25:52,645 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-11-12 16:25:52,645 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:25:52,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 16:25:52,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:25:52,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:25:52,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:25:52,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:25:52,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665690942] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:25:52,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:25:52,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-11-12 16:25:52,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296336870] [2024-11-12 16:25:52,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:25:52,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 16:25:52,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:25:52,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 16:25:52,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:25:52,812 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2024-11-12 16:25:52,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 168 transitions, 2377 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:52,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:25:52,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2024-11-12 16:25:52,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:25:54,143 INFO L124 PetriNetUnfolderBase]: 3935/8776 cut-off events. [2024-11-12 16:25:54,144 INFO L125 PetriNetUnfolderBase]: For 131709/132540 co-relation queries the response was YES. [2024-11-12 16:25:54,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55416 conditions, 8776 events. 3935/8776 cut-off events. For 131709/132540 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 78650 event pairs, 746 based on Foata normal form. 248/8775 useless extension candidates. Maximal degree in co-relation 39682. Up to 4632 conditions per place. [2024-11-12 16:25:54,358 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 235 selfloop transitions, 33 changer transitions 1/295 dead transitions. [2024-11-12 16:25:54,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 295 transitions, 5017 flow [2024-11-12 16:25:54,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:25:54,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 16:25:54,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-11-12 16:25:54,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7401960784313726 [2024-11-12 16:25:54,360 INFO L175 Difference]: Start difference. First operand has 125 places, 168 transitions, 2377 flow. Second operand 6 states and 151 transitions. [2024-11-12 16:25:54,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 295 transitions, 5017 flow [2024-11-12 16:25:54,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 295 transitions, 4993 flow, removed 12 selfloop flow, removed 0 redundant places. [2024-11-12 16:25:54,464 INFO L231 Difference]: Finished difference. Result has 133 places, 178 transitions, 2590 flow [2024-11-12 16:25:54,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2359, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2590, PETRI_PLACES=133, PETRI_TRANSITIONS=178} [2024-11-12 16:25:54,465 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 99 predicate places. [2024-11-12 16:25:54,465 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 178 transitions, 2590 flow [2024-11-12 16:25:54,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:25:54,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:25:54,465 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:25:54,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-12 16:25:54,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-12 16:25:54,667 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 16:25:54,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:25:54,667 INFO L85 PathProgramCache]: Analyzing trace with hash -299860880, now seen corresponding path program 7 times [2024-11-12 16:25:54,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:25:54,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598101758] [2024-11-12 16:25:54,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:25:54,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:25:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:25:55,147 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:25:55,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:25:55,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598101758] [2024-11-12 16:25:55,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598101758] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:25:55,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359130416] [2024-11-12 16:25:55,148 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-12 16:25:55,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:25:55,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:25:55,150 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:25:55,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-12 16:25:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:25:55,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 16:25:55,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:25:56,686 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-12 16:25:56,687 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:26:23,288 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:26:23,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359130416] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:26:23,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:26:23,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2024-11-12 16:26:23,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738104436] [2024-11-12 16:26:23,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:26:23,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-12 16:26:23,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:26:23,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-12 16:26:23,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=413, Unknown=5, NotChecked=0, Total=506 [2024-11-12 16:26:23,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 34 [2024-11-12 16:26:23,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 178 transitions, 2590 flow. Second operand has 23 states, 23 states have (on average 17.217391304347824) internal successors, (396), 23 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:26:23,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:26:23,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 34 [2024-11-12 16:26:23,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:26:29,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 16:26:33,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 16:26:34,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 16:26:45,149 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification. DAG size of input: 48 DAG size of output: 41 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-12 16:26:46,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []