./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-theta/unwind1-100.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-theta/unwind1-100.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:26:24,707 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:26:24,775 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 18:26:24,778 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:26:24,781 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:26:24,808 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:26:24,808 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:26:24,808 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:26:24,809 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:26:24,812 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:26:24,812 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:26:24,813 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:26:24,813 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:26:24,813 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:26:24,813 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:26:24,814 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:26:24,814 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:26:24,814 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:26:24,814 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:26:24,815 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:26:24,815 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 18:26:24,817 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 18:26:24,817 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 18:26:24,817 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:26:24,817 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 18:26:24,817 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:26:24,818 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:26:24,818 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:26:24,818 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:26:24,818 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:26:24,819 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:26:24,819 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:26:24,819 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:26:24,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:26:24,820 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:26:24,820 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:26:24,820 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:26:24,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:26:24,820 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:26:24,821 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:26:24,821 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:26:24,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:26:24,821 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 -> d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 [2024-11-10 18:26:25,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:26:25,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:26:25,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:26:25,111 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:26:25,112 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:26:25,113 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind1-100.i [2024-11-10 18:26:26,527 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:26:26,734 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:26:26,735 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-100.i [2024-11-10 18:26:26,749 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c6344447/d31ad4e55dcb48cda0d66c401a0781cd/FLAGfb8fa501e [2024-11-10 18:26:26,760 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c6344447/d31ad4e55dcb48cda0d66c401a0781cd [2024-11-10 18:26:26,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:26:26,764 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:26:26,766 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:26:26,767 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:26:26,774 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:26:26,775 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:26:26" (1/1) ... [2024-11-10 18:26:26,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d2690e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:26, skipping insertion in model container [2024-11-10 18:26:26,776 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:26:26" (1/1) ... [2024-11-10 18:26:26,825 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:26:27,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:26:27,164 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:26:27,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:26:27,242 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:26:27,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:27 WrapperNode [2024-11-10 18:26:27,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:26:27,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:26:27,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:26:27,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:26:27,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:27" (1/1) ... [2024-11-10 18:26:27,268 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:27" (1/1) ... [2024-11-10 18:26:27,289 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 55 [2024-11-10 18:26:27,290 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:26:27,291 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:26:27,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:26:27,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:26:27,301 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:27" (1/1) ... [2024-11-10 18:26:27,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:27" (1/1) ... [2024-11-10 18:26:27,304 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:27" (1/1) ... [2024-11-10 18:26:27,315 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-10 18:26:27,315 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:27" (1/1) ... [2024-11-10 18:26:27,316 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:27" (1/1) ... [2024-11-10 18:26:27,319 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:27" (1/1) ... [2024-11-10 18:26:27,320 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:27" (1/1) ... [2024-11-10 18:26:27,321 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:27" (1/1) ... [2024-11-10 18:26:27,322 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:27" (1/1) ... [2024-11-10 18:26:27,324 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:26:27,325 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:26:27,325 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:26:27,325 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:26:27,326 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:27" (1/1) ... [2024-11-10 18:26:27,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:26:27,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:26:27,356 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-10 18:26:27,358 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-10 18:26:27,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:26:27,406 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-10 18:26:27,406 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-10 18:26:27,406 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-10 18:26:27,406 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-10 18:26:27,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 18:26:27,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:26:27,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:26:27,408 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 18:26:27,525 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:26:27,527 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:26:27,702 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 18:26:27,703 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:26:27,818 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:26:27,818 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:26:27,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:26:27 BoogieIcfgContainer [2024-11-10 18:26:27,822 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:26:27,824 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:26:27,824 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:26:27,830 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:26:27,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:26:26" (1/3) ... [2024-11-10 18:26:27,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@775c9299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:26:27, skipping insertion in model container [2024-11-10 18:26:27,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:26:27" (2/3) ... [2024-11-10 18:26:27,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@775c9299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:26:27, skipping insertion in model container [2024-11-10 18:26:27,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:26:27" (3/3) ... [2024-11-10 18:26:27,834 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind1-100.i [2024-11-10 18:26:27,847 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:26:27,848 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 18:26:27,848 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 18:26:27,883 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 18:26:27,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 32 transitions, 78 flow [2024-11-10 18:26:27,938 INFO L124 PetriNetUnfolderBase]: 5/30 cut-off events. [2024-11-10 18:26:27,938 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 18:26:27,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 30 events. 5/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2024-11-10 18:26:27,941 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 32 transitions, 78 flow [2024-11-10 18:26:27,943 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 29 transitions, 70 flow [2024-11-10 18:26:27,954 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:26:27,962 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;@17b54584, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:26:27,962 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-10 18:26:27,970 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 18:26:27,970 INFO L124 PetriNetUnfolderBase]: 5/25 cut-off events. [2024-11-10 18:26:27,970 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 18:26:27,970 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:27,971 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:27,971 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:27,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:27,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1717789198, now seen corresponding path program 1 times [2024-11-10 18:26:27,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:27,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673485569] [2024-11-10 18:26:27,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:27,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:28,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:28,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:26:28,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673485569] [2024-11-10 18:26:28,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673485569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:28,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:28,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:26:28,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351324973] [2024-11-10 18:26:28,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:28,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 18:26:28,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:26:28,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 18:26:28,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 18:26:28,217 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-11-10 18:26:28,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 70 flow. Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-10 18:26:28,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:28,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-11-10 18:26:28,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:28,295 INFO L124 PetriNetUnfolderBase]: 108/243 cut-off events. [2024-11-10 18:26:28,296 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-10 18:26:28,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 243 events. 108/243 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 934 event pairs, 83 based on Foata normal form. 38/262 useless extension candidates. Maximal degree in co-relation 414. Up to 189 conditions per place. [2024-11-10 18:26:28,303 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 19 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2024-11-10 18:26:28,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 25 transitions, 100 flow [2024-11-10 18:26:28,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 18:26:28,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 18:26:28,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2024-11-10 18:26:28,313 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.59375 [2024-11-10 18:26:28,315 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 70 flow. Second operand 2 states and 38 transitions. [2024-11-10 18:26:28,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 25 transitions, 100 flow [2024-11-10 18:26:28,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 25 transitions, 92 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 18:26:28,321 INFO L231 Difference]: Finished difference. Result has 27 places, 25 transitions, 54 flow [2024-11-10 18:26:28,323 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=27, PETRI_TRANSITIONS=25} [2024-11-10 18:26:28,328 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2024-11-10 18:26:28,328 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 25 transitions, 54 flow [2024-11-10 18:26:28,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-10 18:26:28,329 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:28,329 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:28,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 18:26:28,330 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:28,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:28,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1742396146, now seen corresponding path program 1 times [2024-11-10 18:26:28,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:28,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086969107] [2024-11-10 18:26:28,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:28,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:28,528 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-10 18:26:28,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:26:28,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086969107] [2024-11-10 18:26:28,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086969107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:28,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:28,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:26:28,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373575826] [2024-11-10 18:26:28,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:28,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:26:28,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:26:28,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:26:28,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:26:28,542 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-11-10 18:26:28,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 25 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:28,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:28,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-11-10 18:26:28,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:28,748 INFO L124 PetriNetUnfolderBase]: 203/424 cut-off events. [2024-11-10 18:26:28,748 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-10 18:26:28,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 784 conditions, 424 events. 203/424 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1788 event pairs, 83 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 781. Up to 188 conditions per place. [2024-11-10 18:26:28,758 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 43 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2024-11-10 18:26:28,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 55 transitions, 218 flow [2024-11-10 18:26:28,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:26:28,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 18:26:28,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2024-11-10 18:26:28,764 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.484375 [2024-11-10 18:26:28,764 INFO L175 Difference]: Start difference. First operand has 27 places, 25 transitions, 54 flow. Second operand 6 states and 93 transitions. [2024-11-10 18:26:28,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 55 transitions, 218 flow [2024-11-10 18:26:28,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 55 transitions, 218 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 18:26:28,767 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 95 flow [2024-11-10 18:26:28,767 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=95, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2024-11-10 18:26:28,768 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2024-11-10 18:26:28,768 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 95 flow [2024-11-10 18:26:28,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:28,768 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:28,769 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:28,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 18:26:28,769 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:28,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:28,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1363693425, now seen corresponding path program 1 times [2024-11-10 18:26:28,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:28,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911411103] [2024-11-10 18:26:28,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:28,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:28,855 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-10 18:26:28,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:26:28,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911411103] [2024-11-10 18:26:28,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911411103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:28,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:28,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:26:28,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761950526] [2024-11-10 18:26:28,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:28,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:26:28,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:26:28,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:26:28,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:26:28,865 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-11-10 18:26:28,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 95 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-10 18:26:28,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:28,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-11-10 18:26:28,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:28,965 INFO L124 PetriNetUnfolderBase]: 111/278 cut-off events. [2024-11-10 18:26:28,965 INFO L125 PetriNetUnfolderBase]: For 211/211 co-relation queries the response was YES. [2024-11-10 18:26:28,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 658 conditions, 278 events. 111/278 cut-off events. For 211/211 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1183 event pairs, 30 based on Foata normal form. 13/278 useless extension candidates. Maximal degree in co-relation 651. Up to 99 conditions per place. [2024-11-10 18:26:28,972 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 35 selfloop transitions, 6 changer transitions 0/48 dead transitions. [2024-11-10 18:26:28,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 48 transitions, 238 flow [2024-11-10 18:26:28,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:26:28,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:26:28,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2024-11-10 18:26:28,974 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-10 18:26:28,975 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 95 flow. Second operand 5 states and 80 transitions. [2024-11-10 18:26:28,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 48 transitions, 238 flow [2024-11-10 18:26:28,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 48 transitions, 237 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:26:28,980 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 131 flow [2024-11-10 18:26:28,981 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2024-11-10 18:26:28,981 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2024-11-10 18:26:28,981 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 131 flow [2024-11-10 18:26:28,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-10 18:26:28,982 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:28,982 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:28,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 18:26:28,982 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:28,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:28,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1712250033, now seen corresponding path program 1 times [2024-11-10 18:26:28,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:28,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210150233] [2024-11-10 18:26:28,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:28,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:29,151 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-10 18:26:29,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:26:29,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210150233] [2024-11-10 18:26:29,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210150233] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:26:29,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027703008] [2024-11-10 18:26:29,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:29,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:26:29,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:26:29,154 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-10 18:26:29,156 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-10 18:26:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:29,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 18:26:29,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:29,307 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-10 18:26:29,307 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:26:29,362 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-10 18:26:29,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027703008] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:26:29,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:26:29,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-11-10 18:26:29,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810342512] [2024-11-10 18:26:29,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:26:29,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 18:26:29,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:26:29,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 18:26:29,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-10 18:26:29,372 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-11-10 18:26:29,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 131 flow. Second operand has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:29,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:29,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-11-10 18:26:29,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:29,672 INFO L124 PetriNetUnfolderBase]: 164/353 cut-off events. [2024-11-10 18:26:29,672 INFO L125 PetriNetUnfolderBase]: For 263/263 co-relation queries the response was YES. [2024-11-10 18:26:29,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 914 conditions, 353 events. 164/353 cut-off events. For 263/263 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1240 event pairs, 24 based on Foata normal form. 20/359 useless extension candidates. Maximal degree in co-relation 904. Up to 76 conditions per place. [2024-11-10 18:26:29,677 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 53 selfloop transitions, 19 changer transitions 0/76 dead transitions. [2024-11-10 18:26:29,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 76 transitions, 396 flow [2024-11-10 18:26:29,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 18:26:29,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-10 18:26:29,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 154 transitions. [2024-11-10 18:26:29,680 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3701923076923077 [2024-11-10 18:26:29,681 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 131 flow. Second operand 13 states and 154 transitions. [2024-11-10 18:26:29,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 76 transitions, 396 flow [2024-11-10 18:26:29,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 76 transitions, 393 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:26:29,686 INFO L231 Difference]: Finished difference. Result has 56 places, 39 transitions, 220 flow [2024-11-10 18:26:29,687 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=220, PETRI_PLACES=56, PETRI_TRANSITIONS=39} [2024-11-10 18:26:29,687 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 25 predicate places. [2024-11-10 18:26:29,688 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 220 flow [2024-11-10 18:26:29,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:26:29,689 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:29,689 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:29,705 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-10 18:26:29,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:26:29,894 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:29,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:29,895 INFO L85 PathProgramCache]: Analyzing trace with hash -912126678, now seen corresponding path program 1 times [2024-11-10 18:26:29,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:29,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818416518] [2024-11-10 18:26:29,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:29,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:29,940 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-10 18:26:29,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:26:29,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818416518] [2024-11-10 18:26:29,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818416518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:26:29,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:26:29,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:26:29,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95625268] [2024-11-10 18:26:29,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:26:29,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:26:29,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:26:29,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:26:29,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:26:29,942 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-11-10 18:26:29,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 39 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-10 18:26:29,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:29,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-11-10 18:26:29,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:29,982 INFO L124 PetriNetUnfolderBase]: 116/289 cut-off events. [2024-11-10 18:26:29,982 INFO L125 PetriNetUnfolderBase]: For 669/675 co-relation queries the response was YES. [2024-11-10 18:26:29,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 903 conditions, 289 events. 116/289 cut-off events. For 669/675 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1102 event pairs, 94 based on Foata normal form. 2/275 useless extension candidates. Maximal degree in co-relation 889. Up to 225 conditions per place. [2024-11-10 18:26:29,984 INFO L140 encePairwiseOnDemand]: 30/32 looper letters, 19 selfloop transitions, 1 changer transitions 13/38 dead transitions. [2024-11-10 18:26:29,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 38 transitions, 282 flow [2024-11-10 18:26:29,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:26:29,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:26:29,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2024-11-10 18:26:29,985 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2024-11-10 18:26:29,985 INFO L175 Difference]: Start difference. First operand has 56 places, 39 transitions, 220 flow. Second operand 3 states and 41 transitions. [2024-11-10 18:26:29,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 38 transitions, 282 flow [2024-11-10 18:26:29,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 38 transitions, 228 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-11-10 18:26:29,991 INFO L231 Difference]: Finished difference. Result has 47 places, 25 transitions, 102 flow [2024-11-10 18:26:29,991 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=47, PETRI_TRANSITIONS=25} [2024-11-10 18:26:29,991 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 16 predicate places. [2024-11-10 18:26:29,992 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 25 transitions, 102 flow [2024-11-10 18:26:29,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-10 18:26:29,992 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:29,992 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:29,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 18:26:29,992 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:29,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:29,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1364713306, now seen corresponding path program 2 times [2024-11-10 18:26:29,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:29,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328665545] [2024-11-10 18:26:29,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:29,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:30,095 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 18:26:30,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:26:30,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328665545] [2024-11-10 18:26:30,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328665545] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:26:30,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092482959] [2024-11-10 18:26:30,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:26:30,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:26:30,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:26:30,098 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-10 18:26:30,100 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-10 18:26:30,156 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 18:26:30,157 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:26:30,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 18:26:30,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:30,330 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:30,330 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:26:30,462 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:30,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092482959] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:26:30,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:26:30,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 20 [2024-11-10 18:26:30,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44043437] [2024-11-10 18:26:30,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:26:30,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-10 18:26:30,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:26:30,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-10 18:26:30,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2024-11-10 18:26:30,467 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-11-10 18:26:30,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 25 transitions, 102 flow. Second operand has 20 states, 20 states have (on average 8.05) internal successors, (161), 20 states have internal predecessors, (161), 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-10 18:26:30,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:30,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-11-10 18:26:30,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:31,094 INFO L124 PetriNetUnfolderBase]: 176/475 cut-off events. [2024-11-10 18:26:31,094 INFO L125 PetriNetUnfolderBase]: For 1122/1122 co-relation queries the response was YES. [2024-11-10 18:26:31,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 475 events. 176/475 cut-off events. For 1122/1122 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1866 event pairs, 21 based on Foata normal form. 65/536 useless extension candidates. Maximal degree in co-relation 1175. Up to 120 conditions per place. [2024-11-10 18:26:31,098 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 45 selfloop transitions, 13 changer transitions 62/123 dead transitions. [2024-11-10 18:26:31,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 123 transitions, 651 flow [2024-11-10 18:26:31,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-10 18:26:31,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2024-11-10 18:26:31,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 301 transitions. [2024-11-10 18:26:31,100 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3359375 [2024-11-10 18:26:31,100 INFO L175 Difference]: Start difference. First operand has 47 places, 25 transitions, 102 flow. Second operand 28 states and 301 transitions. [2024-11-10 18:26:31,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 123 transitions, 651 flow [2024-11-10 18:26:31,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 123 transitions, 634 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-10 18:26:31,106 INFO L231 Difference]: Finished difference. Result has 76 places, 28 transitions, 185 flow [2024-11-10 18:26:31,107 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=185, PETRI_PLACES=76, PETRI_TRANSITIONS=28} [2024-11-10 18:26:31,109 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 45 predicate places. [2024-11-10 18:26:31,109 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 28 transitions, 185 flow [2024-11-10 18:26:31,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 8.05) internal successors, (161), 20 states have internal predecessors, (161), 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-10 18:26:31,109 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:31,109 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:31,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 18:26:31,313 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,SelfDestructingSolverStorable5 [2024-11-10 18:26:31,315 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:31,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:31,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1277656938, now seen corresponding path program 1 times [2024-11-10 18:26:31,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:31,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391510678] [2024-11-10 18:26:31,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:31,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:31,586 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:31,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:26:31,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391510678] [2024-11-10 18:26:31,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391510678] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:26:31,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525405259] [2024-11-10 18:26:31,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:31,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:26:31,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:26:31,590 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-10 18:26:31,598 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-10 18:26:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:31,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 18:26:31,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:31,927 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:31,928 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:26:32,216 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:32,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525405259] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:26:32,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:26:32,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 38 [2024-11-10 18:26:32,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952923929] [2024-11-10 18:26:32,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:26:32,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-10 18:26:32,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:26:32,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-10 18:26:32,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=922, Unknown=0, NotChecked=0, Total=1482 [2024-11-10 18:26:32,222 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-11-10 18:26:32,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 28 transitions, 185 flow. Second operand has 39 states, 39 states have (on average 8.333333333333334) internal successors, (325), 39 states have internal predecessors, (325), 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-10 18:26:32,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:32,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-11-10 18:26:32,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:32,841 INFO L124 PetriNetUnfolderBase]: 147/423 cut-off events. [2024-11-10 18:26:32,842 INFO L125 PetriNetUnfolderBase]: For 9695/9695 co-relation queries the response was YES. [2024-11-10 18:26:32,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1241 conditions, 423 events. 147/423 cut-off events. For 9695/9695 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1117 event pairs, 18 based on Foata normal form. 60/483 useless extension candidates. Maximal degree in co-relation 1218. Up to 120 conditions per place. [2024-11-10 18:26:32,846 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 81 selfloop transitions, 25 changer transitions 0/109 dead transitions. [2024-11-10 18:26:32,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 109 transitions, 654 flow [2024-11-10 18:26:32,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-10 18:26:32,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-11-10 18:26:32,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 300 transitions. [2024-11-10 18:26:32,848 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3605769230769231 [2024-11-10 18:26:32,848 INFO L175 Difference]: Start difference. First operand has 76 places, 28 transitions, 185 flow. Second operand 26 states and 300 transitions. [2024-11-10 18:26:32,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 109 transitions, 654 flow [2024-11-10 18:26:32,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 109 transitions, 546 flow, removed 46 selfloop flow, removed 16 redundant places. [2024-11-10 18:26:32,857 INFO L231 Difference]: Finished difference. Result has 80 places, 40 transitions, 273 flow [2024-11-10 18:26:32,858 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=273, PETRI_PLACES=80, PETRI_TRANSITIONS=40} [2024-11-10 18:26:32,859 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 49 predicate places. [2024-11-10 18:26:32,859 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 40 transitions, 273 flow [2024-11-10 18:26:32,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 8.333333333333334) internal successors, (325), 39 states have internal predecessors, (325), 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-10 18:26:32,860 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:32,860 INFO L204 CegarLoopForPetriNet]: trace histogram [23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:32,879 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-10 18:26:33,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:26:33,066 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:33,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:33,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1247076722, now seen corresponding path program 2 times [2024-11-10 18:26:33,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:33,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942507185] [2024-11-10 18:26:33,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:33,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:33,691 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:33,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:26:33,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942507185] [2024-11-10 18:26:33,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942507185] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:26:33,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182361078] [2024-11-10 18:26:33,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:26:33,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:26:33,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:26:33,696 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-10 18:26:33,711 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-10 18:26:33,776 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 18:26:33,776 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:26:33,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 18:26:33,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:34,257 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:34,257 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:26:35,147 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:35,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182361078] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:26:35,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:26:35,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 74 [2024-11-10 18:26:35,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491144460] [2024-11-10 18:26:35,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:26:35,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2024-11-10 18:26:35,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:26:35,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2024-11-10 18:26:35,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2264, Invalid=3286, Unknown=0, NotChecked=0, Total=5550 [2024-11-10 18:26:35,153 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-11-10 18:26:35,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 40 transitions, 273 flow. Second operand has 75 states, 75 states have (on average 8.173333333333334) internal successors, (613), 75 states have internal predecessors, (613), 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-10 18:26:35,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:35,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-11-10 18:26:35,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:36,718 INFO L124 PetriNetUnfolderBase]: 267/783 cut-off events. [2024-11-10 18:26:36,718 INFO L125 PetriNetUnfolderBase]: For 32717/32717 co-relation queries the response was YES. [2024-11-10 18:26:36,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2064 conditions, 783 events. 267/783 cut-off events. For 32717/32717 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2147 event pairs, 18 based on Foata normal form. 120/903 useless extension candidates. Maximal degree in co-relation 2038. Up to 240 conditions per place. [2024-11-10 18:26:36,723 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 153 selfloop transitions, 49 changer transitions 0/205 dead transitions. [2024-11-10 18:26:36,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 205 transitions, 1150 flow [2024-11-10 18:26:36,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-10 18:26:36,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2024-11-10 18:26:36,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 576 transitions. [2024-11-10 18:26:36,727 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.36 [2024-11-10 18:26:36,728 INFO L175 Difference]: Start difference. First operand has 80 places, 40 transitions, 273 flow. Second operand 50 states and 576 transitions. [2024-11-10 18:26:36,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 205 transitions, 1150 flow [2024-11-10 18:26:36,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 205 transitions, 1050 flow, removed 37 selfloop flow, removed 13 redundant places. [2024-11-10 18:26:36,740 INFO L231 Difference]: Finished difference. Result has 140 places, 64 transitions, 513 flow [2024-11-10 18:26:36,740 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=513, PETRI_PLACES=140, PETRI_TRANSITIONS=64} [2024-11-10 18:26:36,741 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 109 predicate places. [2024-11-10 18:26:36,742 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 64 transitions, 513 flow [2024-11-10 18:26:36,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 8.173333333333334) internal successors, (613), 75 states have internal predecessors, (613), 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-10 18:26:36,742 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:36,742 INFO L204 CegarLoopForPetriNet]: trace histogram [47, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:36,774 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-10 18:26:36,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:26:36,944 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:36,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:36,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1169172266, now seen corresponding path program 3 times [2024-11-10 18:26:36,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:36,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840135184] [2024-11-10 18:26:36,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:36,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:38,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:38,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:26:38,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840135184] [2024-11-10 18:26:38,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840135184] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:26:38,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038998212] [2024-11-10 18:26:38,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 18:26:38,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:26:38,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:26:38,593 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-10 18:26:38,595 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-10 18:26:38,676 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2024-11-10 18:26:38,676 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:26:38,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-10 18:26:38,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:39,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:39,953 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:26:42,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:42,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038998212] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:26:42,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:26:42,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 146 [2024-11-10 18:26:42,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455275487] [2024-11-10 18:26:42,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:26:42,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 147 states [2024-11-10 18:26:42,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:26:42,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2024-11-10 18:26:42,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9128, Invalid=12334, Unknown=0, NotChecked=0, Total=21462 [2024-11-10 18:26:42,480 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-11-10 18:26:42,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 64 transitions, 513 flow. Second operand has 147 states, 147 states have (on average 8.08843537414966) internal successors, (1189), 147 states have internal predecessors, (1189), 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-10 18:26:42,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:26:42,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-11-10 18:26:42,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:26:48,124 INFO L124 PetriNetUnfolderBase]: 507/1503 cut-off events. [2024-11-10 18:26:48,125 INFO L125 PetriNetUnfolderBase]: For 267065/267065 co-relation queries the response was YES. [2024-11-10 18:26:48,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4008 conditions, 1503 events. 507/1503 cut-off events. For 267065/267065 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 4068 event pairs, 18 based on Foata normal form. 240/1743 useless extension candidates. Maximal degree in co-relation 3958. Up to 480 conditions per place. [2024-11-10 18:26:48,136 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 297 selfloop transitions, 97 changer transitions 0/397 dead transitions. [2024-11-10 18:26:48,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 397 transitions, 2254 flow [2024-11-10 18:26:48,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2024-11-10 18:26:48,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2024-11-10 18:26:48,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 1128 transitions. [2024-11-10 18:26:48,140 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3596938775510204 [2024-11-10 18:26:48,140 INFO L175 Difference]: Start difference. First operand has 140 places, 64 transitions, 513 flow. Second operand 98 states and 1128 transitions. [2024-11-10 18:26:48,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 397 transitions, 2254 flow [2024-11-10 18:26:48,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 397 transitions, 2058 flow, removed 73 selfloop flow, removed 25 redundant places. [2024-11-10 18:26:48,197 INFO L231 Difference]: Finished difference. Result has 260 places, 112 transitions, 993 flow [2024-11-10 18:26:48,198 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=98, PETRI_FLOW=993, PETRI_PLACES=260, PETRI_TRANSITIONS=112} [2024-11-10 18:26:48,200 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 229 predicate places. [2024-11-10 18:26:48,200 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 112 transitions, 993 flow [2024-11-10 18:26:48,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 147 states, 147 states have (on average 8.08843537414966) internal successors, (1189), 147 states have internal predecessors, (1189), 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-10 18:26:48,201 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:26:48,202 INFO L204 CegarLoopForPetriNet]: trace histogram [95, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:26:48,219 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-10 18:26:48,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:26:48,403 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:26:48,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:26:48,403 INFO L85 PathProgramCache]: Analyzing trace with hash 461323622, now seen corresponding path program 4 times [2024-11-10 18:26:48,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:26:48,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831225589] [2024-11-10 18:26:48,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:26:48,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:26:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:26:53,113 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:53,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:26:53,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831225589] [2024-11-10 18:26:53,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831225589] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:26:53,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130102689] [2024-11-10 18:26:53,114 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 18:26:53,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:26:53,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:26:53,116 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-10 18:26:53,117 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-10 18:26:53,214 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 18:26:53,214 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:26:53,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-11-10 18:26:53,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:26:56,912 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:26:56,913 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:27:00,604 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:27:00,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130102689] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:27:00,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:27:00,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 201 [2024-11-10 18:27:00,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731167440] [2024-11-10 18:27:00,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:27:00,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 202 states [2024-11-10 18:27:00,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:27:00,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2024-11-10 18:27:00,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15142, Invalid=25460, Unknown=0, NotChecked=0, Total=40602 [2024-11-10 18:27:00,616 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-11-10 18:27:00,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 112 transitions, 993 flow. Second operand has 202 states, 202 states have (on average 8.069306930693068) internal successors, (1630), 202 states have internal predecessors, (1630), 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-10 18:27:00,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:27:00,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-11-10 18:27:00,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:27:08,170 INFO L124 PetriNetUnfolderBase]: 542/1608 cut-off events. [2024-11-10 18:27:08,171 INFO L125 PetriNetUnfolderBase]: For 181652/181652 co-relation queries the response was YES. [2024-11-10 18:27:08,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4781 conditions, 1608 events. 542/1608 cut-off events. For 181652/181652 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 4457 event pairs, 18 based on Foata normal form. 35/1643 useless extension candidates. Maximal degree in co-relation 4683. Up to 515 conditions per place. [2024-11-10 18:27:08,181 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 318 selfloop transitions, 104 changer transitions 0/425 dead transitions. [2024-11-10 18:27:08,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 425 transitions, 2593 flow [2024-11-10 18:27:08,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-11-10 18:27:08,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2024-11-10 18:27:08,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 1164 transitions. [2024-11-10 18:27:08,184 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3464285714285714 [2024-11-10 18:27:08,184 INFO L175 Difference]: Start difference. First operand has 260 places, 112 transitions, 993 flow. Second operand 105 states and 1164 transitions. [2024-11-10 18:27:08,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 425 transitions, 2593 flow [2024-11-10 18:27:08,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 425 transitions, 2383 flow, removed 56 selfloop flow, removed 49 redundant places. [2024-11-10 18:27:08,298 INFO L231 Difference]: Finished difference. Result has 322 places, 119 transitions, 1063 flow [2024-11-10 18:27:08,298 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=105, PETRI_FLOW=1063, PETRI_PLACES=322, PETRI_TRANSITIONS=119} [2024-11-10 18:27:08,299 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 291 predicate places. [2024-11-10 18:27:08,299 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 119 transitions, 1063 flow [2024-11-10 18:27:08,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 202 states, 202 states have (on average 8.069306930693068) internal successors, (1630), 202 states have internal predecessors, (1630), 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-10 18:27:08,300 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:27:08,300 INFO L204 CegarLoopForPetriNet]: trace histogram [102, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:27:08,313 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-10 18:27:08,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:27:08,501 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:27:08,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:27:08,502 INFO L85 PathProgramCache]: Analyzing trace with hash -965447589, now seen corresponding path program 5 times [2024-11-10 18:27:08,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:27:08,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307421478] [2024-11-10 18:27:08,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:27:08,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:27:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:27:08,558 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 18:27:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:27:08,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 18:27:08,650 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 18:27:08,650 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2024-11-10 18:27:08,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2024-11-10 18:27:08,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-10 18:27:08,654 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-10 18:27:08,654 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2024-11-10 18:27:08,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 18:27:08,654 INFO L407 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1] [2024-11-10 18:27:08,816 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 18:27:08,816 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:27:08,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:27:08 BasicIcfg [2024-11-10 18:27:08,821 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:27:08,822 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:27:08,822 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:27:08,822 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:27:08,822 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:26:27" (3/4) ... [2024-11-10 18:27:08,824 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 18:27:08,825 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:27:08,825 INFO L158 Benchmark]: Toolchain (without parser) took 42061.32ms. Allocated memory was 201.3MB in the beginning and 736.1MB in the end (delta: 534.8MB). Free memory was 129.1MB in the beginning and 503.8MB in the end (delta: -374.6MB). Peak memory consumption was 161.8MB. Max. memory is 16.1GB. [2024-11-10 18:27:08,826 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory was 157.5MB in the beginning and 157.3MB in the end (delta: 188.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:27:08,826 INFO L158 Benchmark]: CACSL2BoogieTranslator took 477.86ms. Allocated memory is still 201.3MB. Free memory was 128.9MB in the beginning and 106.4MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-10 18:27:08,826 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.49ms. Allocated memory is still 201.3MB. Free memory was 106.4MB in the beginning and 104.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:27:08,826 INFO L158 Benchmark]: Boogie Preprocessor took 32.76ms. Allocated memory is still 201.3MB. Free memory was 104.5MB in the beginning and 102.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:27:08,826 INFO L158 Benchmark]: IcfgBuilder took 497.42ms. Allocated memory is still 201.3MB. Free memory was 102.6MB in the beginning and 158.9MB in the end (delta: -56.3MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2024-11-10 18:27:08,827 INFO L158 Benchmark]: TraceAbstraction took 40996.79ms. Allocated memory was 201.3MB in the beginning and 736.1MB in the end (delta: 534.8MB). Free memory was 158.9MB in the beginning and 503.8MB in the end (delta: -344.9MB). Peak memory consumption was 192.9MB. Max. memory is 16.1GB. [2024-11-10 18:27:08,827 INFO L158 Benchmark]: Witness Printer took 3.43ms. Allocated memory is still 736.1MB. Free memory is still 503.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:27:08,828 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory was 157.5MB in the beginning and 157.3MB in the end (delta: 188.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 477.86ms. Allocated memory is still 201.3MB. Free memory was 128.9MB in the beginning and 106.4MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.49ms. Allocated memory is still 201.3MB. Free memory was 106.4MB in the beginning and 104.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.76ms. Allocated memory is still 201.3MB. Free memory was 104.5MB in the beginning and 102.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 497.42ms. Allocated memory is still 201.3MB. Free memory was 102.6MB in the beginning and 158.9MB in the end (delta: -56.3MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * TraceAbstraction took 40996.79ms. Allocated memory was 201.3MB in the beginning and 736.1MB in the end (delta: 534.8MB). Free memory was 158.9MB in the beginning and 503.8MB in the end (delta: -344.9MB). Peak memory consumption was 192.9MB. Max. memory is 16.1GB. * Witness Printer took 3.43ms. Allocated memory is still 736.1MB. Free memory is still 503.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 752]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 752. Possible FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L772] 0 _N = 100 [L773] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L773] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L774] 0 pthread_t t1, t2; [L775] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [\old(arg)={0:0}, _N=100, limit=0, t1=-1] [L757] COND FALSE 1 !(__VERIFIER_nondet_int()) [L776] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=0, t1=-1, t2=0] [L760] 1 limit = _N + 1 VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=101] [L765] 2 int i, bound; [L766] 2 bound = limit [L767] 2 i = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=0, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=1, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=2, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=3, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=4, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=5, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=6, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=7, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=8, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=9, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=10, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=11, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=12, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=13, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=14, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=15, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=16, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=17, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=18, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=19, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=20, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=21, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=22, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=23, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=24, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=25, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=26, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=27, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=28, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=29, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=30, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=31, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=32, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=33, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=34, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=35, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=36, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=37, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=38, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=39, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=40, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=41, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=42, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=43, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=44, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=45, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=46, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=47, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=48, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=49, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=50, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=51, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=52, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=53, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=54, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=55, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=56, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=57, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=58, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=59, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=60, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=61, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=62, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=63, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=64, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=65, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=66, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=67, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=68, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=69, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=70, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=71, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=72, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=73, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=74, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=75, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=76, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=77, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=78, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=79, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=80, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=81, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=82, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=83, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=84, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=85, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=86, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=87, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=88, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=89, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=90, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=91, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=92, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=93, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=94, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=95, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=96, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=97, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=98, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=99, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=100, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=101, limit=101] [L767] COND FALSE 2 !(i < bound) VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=101, limit=101] [L768] CALL 2 __VERIFIER_assert(i <= _N) [L753] COND TRUE 2 !expression [L753] CALL 2 reach_error() [L752] COND FALSE 2 !(0) VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=101] [L752] 2 __assert_fail ("0", "generated/unwind1.h", 11, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=101] - UnprovableResult [Line: 771]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 776]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 775]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 47 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 40.7s, OverallIterations: 11, TraceHistogramMax: 102, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 17.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6118 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6114 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2677 IncrementalHoareTripleChecker+Invalid, 2700 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 10 mSDtfsCounter, 2677 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1383 GetRequests, 498 SyntacticMatches, 89 SemanticMatches, 796 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66878 ImplicationChecksByTransitivity, 25.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1063occurred in iteration=10, InterpolantAutomatonStates: 336, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 21.2s InterpolantComputationTime, 1145 NumberOfCodeBlocks, 1145 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 1345 ConstructedInterpolants, 0 QuantifiedInterpolants, 6776 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1192 ConjunctsInSsa, 207 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 14/35192 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 18:27:08,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-theta/unwind1-100.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:27:10,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:27:10,831 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 18:27:10,835 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:27:10,835 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:27:10,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:27:10,855 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:27:10,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:27:10,856 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:27:10,857 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:27:10,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:27:10,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:27:10,858 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:27:10,859 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:27:10,859 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:27:10,859 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:27:10,860 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:27:10,860 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:27:10,860 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:27:10,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:27:10,861 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 18:27:10,863 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 18:27:10,864 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 18:27:10,864 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:27:10,864 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 18:27:10,864 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 18:27:10,865 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:27:10,865 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 18:27:10,865 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:27:10,865 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:27:10,866 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:27:10,866 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:27:10,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:27:10,866 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:27:10,867 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:27:10,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:27:10,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:27:10,868 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:27:10,868 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 18:27:10,868 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 18:27:10,868 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:27:10,869 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:27:10,869 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:27:10,869 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:27:10,869 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 -> d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 [2024-11-10 18:27:11,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:27:11,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:27:11,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:27:11,153 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:27:11,154 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:27:11,155 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind1-100.i [2024-11-10 18:27:12,514 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:27:12,765 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:27:12,766 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-100.i [2024-11-10 18:27:12,784 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5556cd7f7/09114bd6732b489f91dd3b0d117bb075/FLAGd56d6f977 [2024-11-10 18:27:13,085 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5556cd7f7/09114bd6732b489f91dd3b0d117bb075 [2024-11-10 18:27:13,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:27:13,089 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:27:13,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:27:13,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:27:13,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:27:13,094 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:27:13" (1/1) ... [2024-11-10 18:27:13,095 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@377eacb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:27:13, skipping insertion in model container [2024-11-10 18:27:13,095 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:27:13" (1/1) ... [2024-11-10 18:27:13,143 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:27:13,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:27:13,538 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:27:13,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:27:13,619 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:27:13,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:27:13 WrapperNode [2024-11-10 18:27:13,621 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:27:13,622 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:27:13,622 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:27:13,622 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:27:13,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:27:13" (1/1) ... [2024-11-10 18:27:13,647 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:27:13" (1/1) ... [2024-11-10 18:27:13,665 INFO L138 Inliner]: procedures = 170, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 56 [2024-11-10 18:27:13,666 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:27:13,667 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:27:13,667 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:27:13,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:27:13,675 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:27:13" (1/1) ... [2024-11-10 18:27:13,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:27:13" (1/1) ... [2024-11-10 18:27:13,683 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:27:13" (1/1) ... [2024-11-10 18:27:13,700 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-10 18:27:13,700 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:27:13" (1/1) ... [2024-11-10 18:27:13,700 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:27:13" (1/1) ... [2024-11-10 18:27:13,705 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:27:13" (1/1) ... [2024-11-10 18:27:13,710 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:27:13" (1/1) ... [2024-11-10 18:27:13,711 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:27:13" (1/1) ... [2024-11-10 18:27:13,716 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:27:13" (1/1) ... [2024-11-10 18:27:13,718 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:27:13,719 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:27:13,722 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:27:13,722 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:27:13,723 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:27:13" (1/1) ... [2024-11-10 18:27:13,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:27:13,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:27:13,753 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-10 18:27:13,758 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-10 18:27:13,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:27:13,799 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-10 18:27:13,799 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-10 18:27:13,799 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-10 18:27:13,799 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-10 18:27:13,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 18:27:13,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:27:13,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:27:13,801 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 18:27:13,935 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:27:13,937 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:27:14,038 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 18:27:14,038 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:27:14,149 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:27:14,149 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:27:14,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:27:14 BoogieIcfgContainer [2024-11-10 18:27:14,150 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:27:14,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:27:14,152 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:27:14,154 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:27:14,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:27:13" (1/3) ... [2024-11-10 18:27:14,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4564d340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:27:14, skipping insertion in model container [2024-11-10 18:27:14,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:27:13" (2/3) ... [2024-11-10 18:27:14,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4564d340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:27:14, skipping insertion in model container [2024-11-10 18:27:14,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:27:14" (3/3) ... [2024-11-10 18:27:14,156 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind1-100.i [2024-11-10 18:27:14,171 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:27:14,172 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 18:27:14,172 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 18:27:14,217 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 18:27:14,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 32 transitions, 78 flow [2024-11-10 18:27:14,272 INFO L124 PetriNetUnfolderBase]: 5/30 cut-off events. [2024-11-10 18:27:14,272 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 18:27:14,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 30 events. 5/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2024-11-10 18:27:14,275 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 32 transitions, 78 flow [2024-11-10 18:27:14,278 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 29 transitions, 70 flow [2024-11-10 18:27:14,286 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:27:14,292 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;@20d53e1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:27:14,292 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-10 18:27:14,302 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 18:27:14,302 INFO L124 PetriNetUnfolderBase]: 5/25 cut-off events. [2024-11-10 18:27:14,302 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 18:27:14,302 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:27:14,303 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:27:14,303 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:27:14,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:27:14,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1717789198, now seen corresponding path program 1 times [2024-11-10 18:27:14,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:27:14,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26056605] [2024-11-10 18:27:14,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:27:14,331 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:27:14,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:27:14,337 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:27:14,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 18:27:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:27:14,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 18:27:14,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:27:14,449 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-10 18:27:14,450 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:27:14,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:27:14,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26056605] [2024-11-10 18:27:14,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26056605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:27:14,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:27:14,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:27:14,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471629369] [2024-11-10 18:27:14,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:27:14,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 18:27:14,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:27:14,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 18:27:14,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 18:27:14,494 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-11-10 18:27:14,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 70 flow. Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-10 18:27:14,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:27:14,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-11-10 18:27:14,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:27:14,613 INFO L124 PetriNetUnfolderBase]: 108/243 cut-off events. [2024-11-10 18:27:14,614 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-10 18:27:14,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 243 events. 108/243 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 934 event pairs, 83 based on Foata normal form. 38/262 useless extension candidates. Maximal degree in co-relation 414. Up to 189 conditions per place. [2024-11-10 18:27:14,637 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 19 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2024-11-10 18:27:14,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 25 transitions, 100 flow [2024-11-10 18:27:14,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 18:27:14,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 18:27:14,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2024-11-10 18:27:14,647 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.59375 [2024-11-10 18:27:14,649 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 70 flow. Second operand 2 states and 38 transitions. [2024-11-10 18:27:14,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 25 transitions, 100 flow [2024-11-10 18:27:14,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 25 transitions, 92 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 18:27:14,656 INFO L231 Difference]: Finished difference. Result has 27 places, 25 transitions, 54 flow [2024-11-10 18:27:14,657 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=27, PETRI_TRANSITIONS=25} [2024-11-10 18:27:14,663 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2024-11-10 18:27:14,663 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 25 transitions, 54 flow [2024-11-10 18:27:14,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-10 18:27:14,664 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:27:14,664 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:27:14,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 18:27:14,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:27:14,865 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:27:14,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:27:14,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1742396146, now seen corresponding path program 1 times [2024-11-10 18:27:14,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:27:14,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433069665] [2024-11-10 18:27:14,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:27:14,866 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:27:14,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:27:14,869 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:27:14,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 18:27:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:27:14,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 18:27:14,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:27:15,014 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-10 18:27:15,014 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:27:15,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:27:15,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433069665] [2024-11-10 18:27:15,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433069665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:27:15,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:27:15,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:27:15,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6227577] [2024-11-10 18:27:15,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:27:15,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:27:15,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:27:15,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:27:15,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:27:15,027 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-11-10 18:27:15,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 25 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-10 18:27:15,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:27:15,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-11-10 18:27:15,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:27:15,177 INFO L124 PetriNetUnfolderBase]: 165/383 cut-off events. [2024-11-10 18:27:15,177 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 18:27:15,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 383 events. 165/383 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1731 event pairs, 83 based on Foata normal form. 13/371 useless extension candidates. Maximal degree in co-relation 676. Up to 188 conditions per place. [2024-11-10 18:27:15,182 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 35 selfloop transitions, 5 changer transitions 0/46 dead transitions. [2024-11-10 18:27:15,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 46 transitions, 179 flow [2024-11-10 18:27:15,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:27:15,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:27:15,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2024-11-10 18:27:15,186 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.50625 [2024-11-10 18:27:15,186 INFO L175 Difference]: Start difference. First operand has 27 places, 25 transitions, 54 flow. Second operand 5 states and 81 transitions. [2024-11-10 18:27:15,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 46 transitions, 179 flow [2024-11-10 18:27:15,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 46 transitions, 179 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 18:27:15,192 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 84 flow [2024-11-10 18:27:15,193 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=84, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2024-11-10 18:27:15,193 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2024-11-10 18:27:15,193 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 84 flow [2024-11-10 18:27:15,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-10 18:27:15,194 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:27:15,194 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:27:15,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 18:27:15,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:27:15,395 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:27:15,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:27:15,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1363693425, now seen corresponding path program 1 times [2024-11-10 18:27:15,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:27:15,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357351713] [2024-11-10 18:27:15,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:27:15,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:27:15,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:27:15,398 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:27:15,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 18:27:15,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:27:15,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:27:15,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:27:15,512 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-10 18:27:15,512 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:27:15,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:27:15,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357351713] [2024-11-10 18:27:15,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [357351713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:27:15,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:27:15,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:27:15,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884620853] [2024-11-10 18:27:15,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:27:15,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:27:15,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:27:15,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:27:15,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:27:15,518 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-11-10 18:27:15,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-10 18:27:15,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:27:15,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-11-10 18:27:15,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:27:15,647 INFO L124 PetriNetUnfolderBase]: 111/278 cut-off events. [2024-11-10 18:27:15,647 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2024-11-10 18:27:15,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 624 conditions, 278 events. 111/278 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1188 event pairs, 30 based on Foata normal form. 13/279 useless extension candidates. Maximal degree in co-relation 618. Up to 99 conditions per place. [2024-11-10 18:27:15,649 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 35 selfloop transitions, 6 changer transitions 0/47 dead transitions. [2024-11-10 18:27:15,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 47 transitions, 226 flow [2024-11-10 18:27:15,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:27:15,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:27:15,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2024-11-10 18:27:15,651 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-10 18:27:15,651 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 84 flow. Second operand 5 states and 80 transitions. [2024-11-10 18:27:15,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 47 transitions, 226 flow [2024-11-10 18:27:15,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 47 transitions, 221 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:27:15,657 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 115 flow [2024-11-10 18:27:15,657 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2024-11-10 18:27:15,658 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2024-11-10 18:27:15,658 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 115 flow [2024-11-10 18:27:15,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-10 18:27:15,658 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:27:15,659 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:27:15,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 18:27:15,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:27:15,860 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:27:15,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:27:15,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1712250033, now seen corresponding path program 1 times [2024-11-10 18:27:15,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:27:15,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1234669012] [2024-11-10 18:27:15,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:27:15,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:27:15,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:27:15,865 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:27:15,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 18:27:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:27:15,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 18:27:15,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:27:16,085 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-10 18:27:16,085 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:27:16,154 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-10 18:27:16,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:27:16,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1234669012] [2024-11-10 18:27:16,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1234669012] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:27:16,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 18:27:16,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-11-10 18:27:16,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549657522] [2024-11-10 18:27:16,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 18:27:16,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 18:27:16,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:27:16,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 18:27:16,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-10 18:27:16,157 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-11-10 18:27:16,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 115 flow. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 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-10 18:27:16,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:27:16,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-11-10 18:27:16,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:27:16,455 INFO L124 PetriNetUnfolderBase]: 197/476 cut-off events. [2024-11-10 18:27:16,455 INFO L125 PetriNetUnfolderBase]: For 324/324 co-relation queries the response was YES. [2024-11-10 18:27:16,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1141 conditions, 476 events. 197/476 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2220 event pairs, 79 based on Foata normal form. 30/490 useless extension candidates. Maximal degree in co-relation 1132. Up to 117 conditions per place. [2024-11-10 18:27:16,458 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 57 selfloop transitions, 13 changer transitions 0/75 dead transitions. [2024-11-10 18:27:16,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 75 transitions, 395 flow [2024-11-10 18:27:16,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 18:27:16,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-10 18:27:16,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2024-11-10 18:27:16,460 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.41761363636363635 [2024-11-10 18:27:16,460 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 115 flow. Second operand 11 states and 147 transitions. [2024-11-10 18:27:16,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 75 transitions, 395 flow [2024-11-10 18:27:16,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 75 transitions, 392 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:27:16,463 INFO L231 Difference]: Finished difference. Result has 53 places, 38 transitions, 200 flow [2024-11-10 18:27:16,463 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=200, PETRI_PLACES=53, PETRI_TRANSITIONS=38} [2024-11-10 18:27:16,463 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 22 predicate places. [2024-11-10 18:27:16,463 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 200 flow [2024-11-10 18:27:16,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 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-10 18:27:16,464 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:27:16,464 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:27:16,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-10 18:27:16,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:27:16,666 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:27:16,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:27:16,667 INFO L85 PathProgramCache]: Analyzing trace with hash 892475730, now seen corresponding path program 1 times [2024-11-10 18:27:16,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:27:16,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [176355767] [2024-11-10 18:27:16,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:27:16,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:27:16,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:27:16,670 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:27:16,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 18:27:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:27:16,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 18:27:16,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:27:16,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:27:16,772 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:27:16,859 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:27:16,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:27:16,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [176355767] [2024-11-10 18:27:16,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [176355767] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:27:16,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 18:27:16,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-10 18:27:16,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241043469] [2024-11-10 18:27:16,860 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 18:27:16,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 18:27:16,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:27:16,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 18:27:16,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-10 18:27:16,864 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-11-10 18:27:16,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 38 transitions, 200 flow. Second operand has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:27:16,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:27:16,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-11-10 18:27:16,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:27:17,372 INFO L124 PetriNetUnfolderBase]: 217/535 cut-off events. [2024-11-10 18:27:17,373 INFO L125 PetriNetUnfolderBase]: For 1684/1684 co-relation queries the response was YES. [2024-11-10 18:27:17,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1551 conditions, 535 events. 217/535 cut-off events. For 1684/1684 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2463 event pairs, 82 based on Foata normal form. 20/539 useless extension candidates. Maximal degree in co-relation 1536. Up to 127 conditions per place. [2024-11-10 18:27:17,381 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 67 selfloop transitions, 16 changer transitions 0/88 dead transitions. [2024-11-10 18:27:17,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 88 transitions, 541 flow [2024-11-10 18:27:17,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 18:27:17,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-10 18:27:17,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 178 transitions. [2024-11-10 18:27:17,385 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.39732142857142855 [2024-11-10 18:27:17,385 INFO L175 Difference]: Start difference. First operand has 53 places, 38 transitions, 200 flow. Second operand 14 states and 178 transitions. [2024-11-10 18:27:17,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 88 transitions, 541 flow [2024-11-10 18:27:17,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 88 transitions, 506 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-11-10 18:27:17,393 INFO L231 Difference]: Finished difference. Result has 65 places, 42 transitions, 239 flow [2024-11-10 18:27:17,393 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=239, PETRI_PLACES=65, PETRI_TRANSITIONS=42} [2024-11-10 18:27:17,394 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 34 predicate places. [2024-11-10 18:27:17,395 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 42 transitions, 239 flow [2024-11-10 18:27:17,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:27:17,396 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:27:17,396 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:27:17,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-10 18:27:17,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:27:17,599 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:27:17,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:27:17,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1605174864, now seen corresponding path program 1 times [2024-11-10 18:27:17,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:27:17,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1516504291] [2024-11-10 18:27:17,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:27:17,600 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:27:17,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:27:17,604 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:27:17,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-10 18:27:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:27:17,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 18:27:17,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:27:17,678 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-10 18:27:17,678 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:27:17,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:27:17,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1516504291] [2024-11-10 18:27:17,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1516504291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:27:17,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:27:17,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:27:17,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246215297] [2024-11-10 18:27:17,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:27:17,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:27:17,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:27:17,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:27:17,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:27:17,680 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-11-10 18:27:17,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 42 transitions, 239 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-10 18:27:17,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:27:17,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-11-10 18:27:17,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:27:17,746 INFO L124 PetriNetUnfolderBase]: 183/478 cut-off events. [2024-11-10 18:27:17,746 INFO L125 PetriNetUnfolderBase]: For 1434/1434 co-relation queries the response was YES. [2024-11-10 18:27:17,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 478 events. 183/478 cut-off events. For 1434/1434 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2226 event pairs, 173 based on Foata normal form. 4/458 useless extension candidates. Maximal degree in co-relation 1419. Up to 370 conditions per place. [2024-11-10 18:27:17,749 INFO L140 encePairwiseOnDemand]: 30/32 looper letters, 27 selfloop transitions, 1 changer transitions 8/41 dead transitions. [2024-11-10 18:27:17,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 41 transitions, 309 flow [2024-11-10 18:27:17,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:27:17,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:27:17,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2024-11-10 18:27:17,750 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2024-11-10 18:27:17,750 INFO L175 Difference]: Start difference. First operand has 65 places, 42 transitions, 239 flow. Second operand 3 states and 41 transitions. [2024-11-10 18:27:17,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 41 transitions, 309 flow [2024-11-10 18:27:17,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 41 transitions, 267 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-11-10 18:27:17,755 INFO L231 Difference]: Finished difference. Result has 57 places, 33 transitions, 160 flow [2024-11-10 18:27:17,755 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=57, PETRI_TRANSITIONS=33} [2024-11-10 18:27:17,755 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 26 predicate places. [2024-11-10 18:27:17,756 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 33 transitions, 160 flow [2024-11-10 18:27:17,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-10 18:27:17,756 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:27:17,756 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:27:17,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-10 18:27:17,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:27:17,960 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:27:17,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:27:17,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1364713306, now seen corresponding path program 2 times [2024-11-10 18:27:17,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:27:17,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750883060] [2024-11-10 18:27:17,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:27:17,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:27:17,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:27:17,963 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:27:17,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-10 18:27:18,009 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 18:27:18,009 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:27:18,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 18:27:18,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:27:18,176 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:27:18,176 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:27:18,485 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:27:18,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:27:18,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750883060] [2024-11-10 18:27:18,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750883060] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:27:18,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 18:27:18,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2024-11-10 18:27:18,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375300635] [2024-11-10 18:27:18,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 18:27:18,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 18:27:18,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:27:18,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 18:27:18,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2024-11-10 18:27:18,535 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-11-10 18:27:18,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 33 transitions, 160 flow. Second operand has 18 states, 18 states have (on average 7.666666666666667) internal successors, (138), 18 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:27:18,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:27:18,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-11-10 18:27:18,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:27:20,038 INFO L124 PetriNetUnfolderBase]: 236/583 cut-off events. [2024-11-10 18:27:20,038 INFO L125 PetriNetUnfolderBase]: For 2578/2578 co-relation queries the response was YES. [2024-11-10 18:27:20,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1699 conditions, 583 events. 236/583 cut-off events. For 2578/2578 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2409 event pairs, 52 based on Foata normal form. 30/609 useless extension candidates. Maximal degree in co-relation 1683. Up to 100 conditions per place. [2024-11-10 18:27:20,042 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 69 selfloop transitions, 19 changer transitions 50/141 dead transitions. [2024-11-10 18:27:20,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 141 transitions, 838 flow [2024-11-10 18:27:20,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-10 18:27:20,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2024-11-10 18:27:20,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 323 transitions. [2024-11-10 18:27:20,045 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.33645833333333336 [2024-11-10 18:27:20,045 INFO L175 Difference]: Start difference. First operand has 57 places, 33 transitions, 160 flow. Second operand 30 states and 323 transitions. [2024-11-10 18:27:20,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 141 transitions, 838 flow [2024-11-10 18:27:20,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 141 transitions, 812 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-11-10 18:27:20,052 INFO L231 Difference]: Finished difference. Result has 91 places, 38 transitions, 264 flow [2024-11-10 18:27:20,052 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=264, PETRI_PLACES=91, PETRI_TRANSITIONS=38} [2024-11-10 18:27:20,053 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 60 predicate places. [2024-11-10 18:27:20,055 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 38 transitions, 264 flow [2024-11-10 18:27:20,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.666666666666667) internal successors, (138), 18 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:27:20,055 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:27:20,055 INFO L204 CegarLoopForPetriNet]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:27:20,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-10 18:27:20,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:27:20,257 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:27:20,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:27:20,258 INFO L85 PathProgramCache]: Analyzing trace with hash -840519074, now seen corresponding path program 2 times [2024-11-10 18:27:20,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:27:20,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053099402] [2024-11-10 18:27:20,259 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:27:20,259 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:27:20,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:27:20,262 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:27:20,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-10 18:27:20,302 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 18:27:20,302 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:27:20,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 18:27:20,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:27:20,471 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:27:20,472 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:27:20,883 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:27:20,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:27:20,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053099402] [2024-11-10 18:27:20,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1053099402] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:27:20,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 18:27:20,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 21 [2024-11-10 18:27:20,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091278395] [2024-11-10 18:27:20,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 18:27:20,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-10 18:27:20,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:27:20,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-10 18:27:20,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2024-11-10 18:27:20,893 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-11-10 18:27:20,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 38 transitions, 264 flow. Second operand has 22 states, 22 states have (on average 7.545454545454546) internal successors, (166), 22 states have internal predecessors, (166), 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-10 18:27:20,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:27:20,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-11-10 18:27:20,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:27:23,518 INFO L124 PetriNetUnfolderBase]: 266/681 cut-off events. [2024-11-10 18:27:23,519 INFO L125 PetriNetUnfolderBase]: For 8364/8364 co-relation queries the response was YES. [2024-11-10 18:27:23,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2695 conditions, 681 events. 266/681 cut-off events. For 8364/8364 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2772 event pairs, 62 based on Foata normal form. 40/717 useless extension candidates. Maximal degree in co-relation 2665. Up to 140 conditions per place. [2024-11-10 18:27:23,526 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 89 selfloop transitions, 25 changer transitions 57/174 dead transitions. [2024-11-10 18:27:23,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 174 transitions, 1307 flow [2024-11-10 18:27:23,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-10 18:27:23,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2024-11-10 18:27:23,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 410 transitions. [2024-11-10 18:27:23,529 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.328525641025641 [2024-11-10 18:27:23,529 INFO L175 Difference]: Start difference. First operand has 91 places, 38 transitions, 264 flow. Second operand 39 states and 410 transitions. [2024-11-10 18:27:23,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 174 transitions, 1307 flow [2024-11-10 18:27:23,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 174 transitions, 1139 flow, removed 69 selfloop flow, removed 22 redundant places. [2024-11-10 18:27:23,542 INFO L231 Difference]: Finished difference. Result has 117 places, 46 transitions, 332 flow [2024-11-10 18:27:23,543 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=332, PETRI_PLACES=117, PETRI_TRANSITIONS=46} [2024-11-10 18:27:23,545 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 86 predicate places. [2024-11-10 18:27:23,545 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 46 transitions, 332 flow [2024-11-10 18:27:23,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.545454545454546) internal successors, (166), 22 states have internal predecessors, (166), 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-10 18:27:23,546 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:27:23,546 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:27:23,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-10 18:27:23,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:27:23,749 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:27:23,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:27:23,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1521077356, now seen corresponding path program 3 times [2024-11-10 18:27:23,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:27:23,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335674358] [2024-11-10 18:27:23,753 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 18:27:23,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:27:23,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:27:23,754 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:27:23,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-10 18:27:23,816 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-10 18:27:23,817 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:27:23,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 18:27:23,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:27:23,996 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-10 18:27:23,997 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:27:23,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:27:23,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335674358] [2024-11-10 18:27:23,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335674358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:27:23,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:27:23,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 18:27:23,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034139552] [2024-11-10 18:27:23,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:27:23,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 18:27:23,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:27:23,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 18:27:23,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:27:24,011 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-11-10 18:27:24,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 46 transitions, 332 flow. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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-10 18:27:24,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:27:24,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-11-10 18:27:24,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:27:24,219 INFO L124 PetriNetUnfolderBase]: 191/511 cut-off events. [2024-11-10 18:27:24,219 INFO L125 PetriNetUnfolderBase]: For 5411/5411 co-relation queries the response was YES. [2024-11-10 18:27:24,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1807 conditions, 511 events. 191/511 cut-off events. For 5411/5411 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1932 event pairs, 110 based on Foata normal form. 5/512 useless extension candidates. Maximal degree in co-relation 1765. Up to 236 conditions per place. [2024-11-10 18:27:24,225 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 28 selfloop transitions, 1 changer transitions 30/62 dead transitions. [2024-11-10 18:27:24,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 62 transitions, 549 flow [2024-11-10 18:27:24,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:27:24,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 18:27:24,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2024-11-10 18:27:24,227 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3794642857142857 [2024-11-10 18:27:24,228 INFO L175 Difference]: Start difference. First operand has 117 places, 46 transitions, 332 flow. Second operand 7 states and 85 transitions. [2024-11-10 18:27:24,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 62 transitions, 549 flow [2024-11-10 18:27:24,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 62 transitions, 453 flow, removed 30 selfloop flow, removed 30 redundant places. [2024-11-10 18:27:24,245 INFO L231 Difference]: Finished difference. Result has 82 places, 32 transitions, 185 flow [2024-11-10 18:27:24,245 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=185, PETRI_PLACES=82, PETRI_TRANSITIONS=32} [2024-11-10 18:27:24,246 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 51 predicate places. [2024-11-10 18:27:24,247 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 32 transitions, 185 flow [2024-11-10 18:27:24,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 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-10 18:27:24,248 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:27:24,248 INFO L204 CegarLoopForPetriNet]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:27:24,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-10 18:27:24,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:27:24,449 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:27:24,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:27:24,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1249935478, now seen corresponding path program 3 times [2024-11-10 18:27:24,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:27:24,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440693519] [2024-11-10 18:27:24,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 18:27:24,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:27:24,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:27:24,454 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:27:24,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-10 18:27:24,553 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2024-11-10 18:27:24,553 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:27:24,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 18:27:24,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:27:24,950 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:27:24,950 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:27:26,158 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:27:26,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:27:26,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440693519] [2024-11-10 18:27:26,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [440693519] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:27:26,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 18:27:26,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 37 [2024-11-10 18:27:26,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361456995] [2024-11-10 18:27:26,159 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 18:27:26,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-10 18:27:26,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:27:26,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-10 18:27:26,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=1042, Unknown=0, NotChecked=0, Total=1406 [2024-11-10 18:27:26,163 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-11-10 18:27:26,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 32 transitions, 185 flow. Second operand has 38 states, 38 states have (on average 7.315789473684211) internal successors, (278), 38 states have internal predecessors, (278), 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-10 18:27:26,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:27:26,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-11-10 18:27:26,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:27:31,797 INFO L124 PetriNetUnfolderBase]: 267/633 cut-off events. [2024-11-10 18:27:31,797 INFO L125 PetriNetUnfolderBase]: For 27342/27342 co-relation queries the response was YES. [2024-11-10 18:27:31,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3320 conditions, 633 events. 267/633 cut-off events. For 27342/27342 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1612 event pairs, 9 based on Foata normal form. 15/648 useless extension candidates. Maximal degree in co-relation 3289. Up to 160 conditions per place. [2024-11-10 18:27:31,803 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 107 selfloop transitions, 34 changer transitions 19/163 dead transitions. [2024-11-10 18:27:31,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 163 transitions, 1556 flow [2024-11-10 18:27:31,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-10 18:27:31,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-11-10 18:27:31,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 379 transitions. [2024-11-10 18:27:31,811 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3289930555555556 [2024-11-10 18:27:31,811 INFO L175 Difference]: Start difference. First operand has 82 places, 32 transitions, 185 flow. Second operand 36 states and 379 transitions. [2024-11-10 18:27:31,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 163 transitions, 1556 flow [2024-11-10 18:27:31,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 163 transitions, 1191 flow, removed 181 selfloop flow, removed 15 redundant places. [2024-11-10 18:27:31,826 INFO L231 Difference]: Finished difference. Result has 88 places, 48 transitions, 294 flow [2024-11-10 18:27:31,827 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=294, PETRI_PLACES=88, PETRI_TRANSITIONS=48} [2024-11-10 18:27:31,827 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 57 predicate places. [2024-11-10 18:27:31,827 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 48 transitions, 294 flow [2024-11-10 18:27:31,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 7.315789473684211) internal successors, (278), 38 states have internal predecessors, (278), 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-10 18:27:31,828 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:27:31,828 INFO L204 CegarLoopForPetriNet]: trace histogram [31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:27:31,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-10 18:27:32,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:27:32,029 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-10 18:27:32,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:27:32,030 INFO L85 PathProgramCache]: Analyzing trace with hash -205091674, now seen corresponding path program 4 times [2024-11-10 18:27:32,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:27:32,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2009082860] [2024-11-10 18:27:32,030 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 18:27:32,030 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:27:32,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:27:32,032 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:27:32,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-10 18:27:32,098 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 18:27:32,098 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:27:32,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-10 18:27:32,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:27:33,003 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:27:33,003 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:27:37,754 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:27:37,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:27:37,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2009082860] [2024-11-10 18:27:37,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2009082860] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:27:37,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 18:27:37,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 36] total 69 [2024-11-10 18:27:37,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833967848] [2024-11-10 18:27:37,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 18:27:37,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2024-11-10 18:27:37,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:27:37,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2024-11-10 18:27:37,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1228, Invalid=3602, Unknown=0, NotChecked=0, Total=4830 [2024-11-10 18:27:37,764 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-11-10 18:27:37,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 48 transitions, 294 flow. Second operand has 70 states, 70 states have (on average 7.171428571428572) internal successors, (502), 70 states have internal predecessors, (502), 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-10 18:27:37,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:27:37,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-11-10 18:27:37,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand