./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 3289d67d 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-3289d67-m [2024-11-17 03:44:58,117 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:44:58,179 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 03:44:58,182 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:44:58,182 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:44:58,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:44:58,206 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:44:58,207 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:44:58,207 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:44:58,207 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:44:58,207 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:44:58,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:44:58,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:44:58,212 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:44:58,212 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:44:58,212 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:44:58,213 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:44:58,213 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:44:58,213 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:44:58,213 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:44:58,214 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 03:44:58,215 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 03:44:58,215 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 03:44:58,215 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:44:58,215 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 03:44:58,216 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:44:58,216 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:44:58,216 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:44:58,216 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:44:58,216 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:44:58,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:44:58,217 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:44:58,217 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:44:58,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:44:58,217 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:44:58,218 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:44:58,218 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 03:44:58,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 03:44:58,219 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:44:58,219 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:44:58,219 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:44:58,219 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:44:58,220 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-17 03:44:58,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:44:58,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:44:58,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:44:58,449 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:44:58,450 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:44:58,451 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-17 03:44:59,709 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:44:59,910 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:44:59,910 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-100.i [2024-11-17 03:44:59,921 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/810c92550/cbc9f2614c264669bfe3efb8df5b5fa2/FLAGd949d34fe [2024-11-17 03:44:59,934 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/810c92550/cbc9f2614c264669bfe3efb8df5b5fa2 [2024-11-17 03:44:59,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:44:59,937 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:44:59,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:44:59,938 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:44:59,943 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:44:59,943 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:44:59" (1/1) ... [2024-11-17 03:44:59,945 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78a97f09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:44:59, skipping insertion in model container [2024-11-17 03:44:59,946 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:44:59" (1/1) ... [2024-11-17 03:44:59,984 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:45:00,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:45:00,282 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:45:00,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:45:00,373 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:45:00,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:45:00 WrapperNode [2024-11-17 03:45:00,373 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:45:00,375 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:45:00,375 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:45:00,375 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:45:00,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:45:00" (1/1) ... [2024-11-17 03:45:00,393 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:45:00" (1/1) ... [2024-11-17 03:45:00,423 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 55 [2024-11-17 03:45:00,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:45:00,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:45:00,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:45:00,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:45:00,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:45:00" (1/1) ... [2024-11-17 03:45:00,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:45:00" (1/1) ... [2024-11-17 03:45:00,436 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:45:00" (1/1) ... [2024-11-17 03:45:00,454 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-17 03:45:00,454 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:45:00" (1/1) ... [2024-11-17 03:45:00,454 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:45:00" (1/1) ... [2024-11-17 03:45:00,457 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:45:00" (1/1) ... [2024-11-17 03:45:00,457 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:45:00" (1/1) ... [2024-11-17 03:45:00,458 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:45:00" (1/1) ... [2024-11-17 03:45:00,459 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:45:00" (1/1) ... [2024-11-17 03:45:00,460 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:45:00,461 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:45:00,461 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:45:00,461 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:45:00,462 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:45:00" (1/1) ... [2024-11-17 03:45:00,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:45:00,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:45:00,491 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-17 03:45:00,493 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-17 03:45:00,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:45:00,532 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-17 03:45:00,532 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-17 03:45:00,532 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-17 03:45:00,533 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-17 03:45:00,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 03:45:00,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:45:00,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:45:00,537 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-17 03:45:00,662 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:45:00,664 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:45:00,787 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-17 03:45:00,788 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:45:00,856 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:45:00,856 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 03:45:00,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:45:00 BoogieIcfgContainer [2024-11-17 03:45:00,857 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:45:00,859 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:45:00,859 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:45:00,861 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:45:00,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:44:59" (1/3) ... [2024-11-17 03:45:00,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77759892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:45:00, skipping insertion in model container [2024-11-17 03:45:00,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:45:00" (2/3) ... [2024-11-17 03:45:00,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77759892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:45:00, skipping insertion in model container [2024-11-17 03:45:00,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:45:00" (3/3) ... [2024-11-17 03:45:00,864 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind1-100.i [2024-11-17 03:45:00,876 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:45:00,877 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 03:45:00,877 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-17 03:45:00,912 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-17 03:45:00,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 32 transitions, 78 flow [2024-11-17 03:45:00,954 INFO L124 PetriNetUnfolderBase]: 5/30 cut-off events. [2024-11-17 03:45:00,955 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-17 03:45:00,961 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-17 03:45:00,961 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 32 transitions, 78 flow [2024-11-17 03:45:00,964 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 29 transitions, 70 flow [2024-11-17 03:45:00,975 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:45:00,980 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;@62c2c31c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:45:00,981 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-17 03:45:00,992 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-17 03:45:00,993 INFO L124 PetriNetUnfolderBase]: 5/25 cut-off events. [2024-11-17 03:45:00,993 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-17 03:45:00,993 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:45:00,994 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:45:00,996 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-17 03:45:01,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:45:01,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1717789198, now seen corresponding path program 1 times [2024-11-17 03:45:01,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:45:01,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479850215] [2024-11-17 03:45:01,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:45:01,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:45:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:45:01,155 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-17 03:45:01,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:45:01,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479850215] [2024-11-17 03:45:01,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479850215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:45:01,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:45:01,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:45:01,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141563644] [2024-11-17 03:45:01,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:45:01,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 03:45:01,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:45:01,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 03:45:01,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 03:45:01,201 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-11-17 03:45:01,203 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-17 03:45:01,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:45:01,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-11-17 03:45:01,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:45:01,337 INFO L124 PetriNetUnfolderBase]: 108/243 cut-off events. [2024-11-17 03:45:01,337 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-17 03:45:01,338 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-17 03:45:01,345 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 19 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2024-11-17 03:45:01,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 25 transitions, 100 flow [2024-11-17 03:45:01,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 03:45:01,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-17 03:45:01,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2024-11-17 03:45:01,355 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.59375 [2024-11-17 03:45:01,357 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 70 flow. Second operand 2 states and 38 transitions. [2024-11-17 03:45:01,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 25 transitions, 100 flow [2024-11-17 03:45:01,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 25 transitions, 92 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-17 03:45:01,361 INFO L231 Difference]: Finished difference. Result has 27 places, 25 transitions, 54 flow [2024-11-17 03:45:01,363 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-17 03:45:01,367 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2024-11-17 03:45:01,367 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 25 transitions, 54 flow [2024-11-17 03:45:01,368 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-17 03:45:01,368 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:45:01,368 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:45:01,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 03:45:01,369 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-17 03:45:01,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:45:01,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1742396146, now seen corresponding path program 1 times [2024-11-17 03:45:01,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:45:01,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710230692] [2024-11-17 03:45:01,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:45:01,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:45:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:45:01,530 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-17 03:45:01,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:45:01,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710230692] [2024-11-17 03:45:01,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710230692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:45:01,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:45:01,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:45:01,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250745176] [2024-11-17 03:45:01,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:45:01,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:45:01,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:45:01,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:45:01,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:45:01,540 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-11-17 03:45:01,541 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-17 03:45:01,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:45:01,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-11-17 03:45:01,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:45:01,690 INFO L124 PetriNetUnfolderBase]: 203/424 cut-off events. [2024-11-17 03:45:01,690 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-17 03:45:01,692 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-17 03:45:01,695 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 43 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2024-11-17 03:45:01,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 55 transitions, 218 flow [2024-11-17 03:45:01,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:45:01,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-17 03:45:01,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2024-11-17 03:45:01,698 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.484375 [2024-11-17 03:45:01,699 INFO L175 Difference]: Start difference. First operand has 27 places, 25 transitions, 54 flow. Second operand 6 states and 93 transitions. [2024-11-17 03:45:01,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 55 transitions, 218 flow [2024-11-17 03:45:01,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 55 transitions, 218 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-17 03:45:01,703 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 95 flow [2024-11-17 03:45:01,703 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-17 03:45:01,704 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2024-11-17 03:45:01,704 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 95 flow [2024-11-17 03:45:01,705 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-17 03:45:01,705 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:45:01,705 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:45:01,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 03:45:01,705 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-17 03:45:01,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:45:01,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1363693425, now seen corresponding path program 1 times [2024-11-17 03:45:01,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:45:01,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202867232] [2024-11-17 03:45:01,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:45:01,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:45:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:45:01,793 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-17 03:45:01,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:45:01,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202867232] [2024-11-17 03:45:01,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202867232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:45:01,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:45:01,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:45:01,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451203545] [2024-11-17 03:45:01,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:45:01,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:45:01,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:45:01,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:45:01,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:45:01,801 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-11-17 03:45:01,801 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-17 03:45:01,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:45:01,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-11-17 03:45:01,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:45:01,891 INFO L124 PetriNetUnfolderBase]: 111/278 cut-off events. [2024-11-17 03:45:01,891 INFO L125 PetriNetUnfolderBase]: For 211/211 co-relation queries the response was YES. [2024-11-17 03:45:01,893 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-17 03:45:01,895 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 35 selfloop transitions, 6 changer transitions 0/48 dead transitions. [2024-11-17 03:45:01,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 48 transitions, 238 flow [2024-11-17 03:45:01,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:45:01,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:45:01,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2024-11-17 03:45:01,898 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-17 03:45:01,898 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 95 flow. Second operand 5 states and 80 transitions. [2024-11-17 03:45:01,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 48 transitions, 238 flow [2024-11-17 03:45:01,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 48 transitions, 237 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:45:01,903 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 131 flow [2024-11-17 03:45:01,904 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-17 03:45:01,904 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2024-11-17 03:45:01,904 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 131 flow [2024-11-17 03:45:01,904 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-17 03:45:01,904 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:45:01,904 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:45:01,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 03:45:01,905 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-17 03:45:01,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:45:01,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1712250033, now seen corresponding path program 1 times [2024-11-17 03:45:01,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:45:01,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281373201] [2024-11-17 03:45:01,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:45:01,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:45:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:45:02,015 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-17 03:45:02,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:45:02,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281373201] [2024-11-17 03:45:02,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281373201] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:45:02,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918222574] [2024-11-17 03:45:02,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:45:02,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:45:02,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:45:02,020 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-17 03:45:02,022 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-17 03:45:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:45:02,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 03:45:02,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:45:02,180 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-17 03:45:02,182 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:45:02,240 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-17 03:45:02,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918222574] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:45:02,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:45:02,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-11-17 03:45:02,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139007914] [2024-11-17 03:45:02,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:45:02,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 03:45:02,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:45:02,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 03:45:02,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-17 03:45:02,249 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-11-17 03:45:02,249 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-17 03:45:02,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:45:02,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-11-17 03:45:02,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:45:02,528 INFO L124 PetriNetUnfolderBase]: 164/353 cut-off events. [2024-11-17 03:45:02,528 INFO L125 PetriNetUnfolderBase]: For 263/263 co-relation queries the response was YES. [2024-11-17 03:45:02,530 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-17 03:45:02,533 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 53 selfloop transitions, 19 changer transitions 0/76 dead transitions. [2024-11-17 03:45:02,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 76 transitions, 396 flow [2024-11-17 03:45:02,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 03:45:02,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-17 03:45:02,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 154 transitions. [2024-11-17 03:45:02,536 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3701923076923077 [2024-11-17 03:45:02,536 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 131 flow. Second operand 13 states and 154 transitions. [2024-11-17 03:45:02,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 76 transitions, 396 flow [2024-11-17 03:45:02,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 76 transitions, 393 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:45:02,542 INFO L231 Difference]: Finished difference. Result has 56 places, 39 transitions, 220 flow [2024-11-17 03:45:02,542 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-17 03:45:02,543 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 25 predicate places. [2024-11-17 03:45:02,543 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 220 flow [2024-11-17 03:45:02,544 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-17 03:45:02,544 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:45:02,544 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-17 03:45:02,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-17 03:45:02,744 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-17 03:45:02,745 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-17 03:45:02,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:45:02,745 INFO L85 PathProgramCache]: Analyzing trace with hash -912126678, now seen corresponding path program 1 times [2024-11-17 03:45:02,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:45:02,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252980296] [2024-11-17 03:45:02,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:45:02,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:45:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:45:02,777 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-17 03:45:02,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:45:02,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252980296] [2024-11-17 03:45:02,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252980296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:45:02,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:45:02,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:45:02,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329890771] [2024-11-17 03:45:02,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:45:02,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:45:02,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:45:02,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:45:02,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:45:02,779 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-11-17 03:45:02,779 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-17 03:45:02,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:45:02,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-11-17 03:45:02,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:45:02,820 INFO L124 PetriNetUnfolderBase]: 116/289 cut-off events. [2024-11-17 03:45:02,820 INFO L125 PetriNetUnfolderBase]: For 669/675 co-relation queries the response was YES. [2024-11-17 03:45:02,821 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-17 03:45:02,822 INFO L140 encePairwiseOnDemand]: 30/32 looper letters, 19 selfloop transitions, 1 changer transitions 13/38 dead transitions. [2024-11-17 03:45:02,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 38 transitions, 282 flow [2024-11-17 03:45:02,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:45:02,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:45:02,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2024-11-17 03:45:02,825 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2024-11-17 03:45:02,825 INFO L175 Difference]: Start difference. First operand has 56 places, 39 transitions, 220 flow. Second operand 3 states and 41 transitions. [2024-11-17 03:45:02,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 38 transitions, 282 flow [2024-11-17 03:45:02,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 38 transitions, 228 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-11-17 03:45:02,828 INFO L231 Difference]: Finished difference. Result has 47 places, 25 transitions, 102 flow [2024-11-17 03:45:02,828 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-17 03:45:02,829 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 16 predicate places. [2024-11-17 03:45:02,829 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 25 transitions, 102 flow [2024-11-17 03:45:02,829 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-17 03:45:02,829 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:45:02,831 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:45:02,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 03:45:02,832 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-17 03:45:02,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:45:02,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1364713306, now seen corresponding path program 2 times [2024-11-17 03:45:02,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:45:02,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423688991] [2024-11-17 03:45:02,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:45:02,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:45:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:45:02,912 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-17 03:45:02,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:45:02,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423688991] [2024-11-17 03:45:02,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423688991] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:45:02,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014648892] [2024-11-17 03:45:02,913 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 03:45:02,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:45:02,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:45:02,915 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-17 03:45:02,916 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-17 03:45:02,963 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 03:45:02,963 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:45:02,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 03:45:02,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:45:03,076 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-17 03:45:03,078 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:45:03,206 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-17 03:45:03,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014648892] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:45:03,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:45:03,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 20 [2024-11-17 03:45:03,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005131677] [2024-11-17 03:45:03,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:45:03,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-17 03:45:03,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:45:03,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-17 03:45:03,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2024-11-17 03:45:03,209 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-11-17 03:45:03,209 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-17 03:45:03,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:45:03,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-11-17 03:45:03,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:45:03,783 INFO L124 PetriNetUnfolderBase]: 176/475 cut-off events. [2024-11-17 03:45:03,784 INFO L125 PetriNetUnfolderBase]: For 1122/1122 co-relation queries the response was YES. [2024-11-17 03:45:03,785 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-17 03:45:03,786 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 45 selfloop transitions, 13 changer transitions 62/123 dead transitions. [2024-11-17 03:45:03,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 123 transitions, 651 flow [2024-11-17 03:45:03,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-17 03:45:03,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2024-11-17 03:45:03,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 301 transitions. [2024-11-17 03:45:03,789 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3359375 [2024-11-17 03:45:03,789 INFO L175 Difference]: Start difference. First operand has 47 places, 25 transitions, 102 flow. Second operand 28 states and 301 transitions. [2024-11-17 03:45:03,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 123 transitions, 651 flow [2024-11-17 03:45:03,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 123 transitions, 634 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-17 03:45:03,795 INFO L231 Difference]: Finished difference. Result has 76 places, 28 transitions, 185 flow [2024-11-17 03:45:03,795 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-17 03:45:03,796 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 45 predicate places. [2024-11-17 03:45:03,797 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 28 transitions, 185 flow [2024-11-17 03:45:03,797 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-17 03:45:03,797 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:45:03,797 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:45:03,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-17 03:45:04,001 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-17 03:45:04,002 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-17 03:45:04,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:45:04,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1277656938, now seen corresponding path program 1 times [2024-11-17 03:45:04,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:45:04,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548225695] [2024-11-17 03:45:04,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:45:04,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:45:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:45:04,205 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-17 03:45:04,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:45:04,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548225695] [2024-11-17 03:45:04,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548225695] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:45:04,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897257771] [2024-11-17 03:45:04,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:45:04,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:45:04,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:45:04,209 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-17 03:45:04,210 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-17 03:45:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:45:04,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-17 03:45:04,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:45:04,460 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-17 03:45:04,460 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:45:04,748 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-17 03:45:04,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897257771] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:45:04,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:45:04,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 38 [2024-11-17 03:45:04,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760087992] [2024-11-17 03:45:04,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:45:04,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-17 03:45:04,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:45:04,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-17 03:45:04,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=922, Unknown=0, NotChecked=0, Total=1482 [2024-11-17 03:45:04,758 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-11-17 03:45:04,759 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-17 03:45:04,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:45:04,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-11-17 03:45:04,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:45:05,336 INFO L124 PetriNetUnfolderBase]: 147/423 cut-off events. [2024-11-17 03:45:05,336 INFO L125 PetriNetUnfolderBase]: For 9695/9695 co-relation queries the response was YES. [2024-11-17 03:45:05,338 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-17 03:45:05,340 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 81 selfloop transitions, 25 changer transitions 0/109 dead transitions. [2024-11-17 03:45:05,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 109 transitions, 654 flow [2024-11-17 03:45:05,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-17 03:45:05,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-11-17 03:45:05,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 300 transitions. [2024-11-17 03:45:05,343 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3605769230769231 [2024-11-17 03:45:05,343 INFO L175 Difference]: Start difference. First operand has 76 places, 28 transitions, 185 flow. Second operand 26 states and 300 transitions. [2024-11-17 03:45:05,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 109 transitions, 654 flow [2024-11-17 03:45:05,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 109 transitions, 546 flow, removed 46 selfloop flow, removed 16 redundant places. [2024-11-17 03:45:05,348 INFO L231 Difference]: Finished difference. Result has 80 places, 40 transitions, 273 flow [2024-11-17 03:45:05,348 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-17 03:45:05,350 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 49 predicate places. [2024-11-17 03:45:05,350 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 40 transitions, 273 flow [2024-11-17 03:45:05,351 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-17 03:45:05,351 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:45:05,351 INFO L204 CegarLoopForPetriNet]: trace histogram [23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:45:05,364 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-17 03:45:05,555 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-17 03:45:05,556 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-17 03:45:05,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:45:05,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1247076722, now seen corresponding path program 2 times [2024-11-17 03:45:05,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:45:05,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604004667] [2024-11-17 03:45:05,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:45:05,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:45:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:45:06,057 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-17 03:45:06,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:45:06,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604004667] [2024-11-17 03:45:06,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604004667] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:45:06,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652871803] [2024-11-17 03:45:06,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 03:45:06,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:45:06,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:45:06,060 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-17 03:45:06,060 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-17 03:45:06,111 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 03:45:06,111 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:45:06,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-17 03:45:06,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:45:06,539 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-17 03:45:06,540 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:45:07,231 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-17 03:45:07,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652871803] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:45:07,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:45:07,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 74 [2024-11-17 03:45:07,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424001313] [2024-11-17 03:45:07,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:45:07,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2024-11-17 03:45:07,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:45:07,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2024-11-17 03:45:07,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2264, Invalid=3286, Unknown=0, NotChecked=0, Total=5550 [2024-11-17 03:45:07,236 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-11-17 03:45:07,237 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-17 03:45:07,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:45:07,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-11-17 03:45:07,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:45:08,719 INFO L124 PetriNetUnfolderBase]: 267/783 cut-off events. [2024-11-17 03:45:08,719 INFO L125 PetriNetUnfolderBase]: For 32717/32717 co-relation queries the response was YES. [2024-11-17 03:45:08,721 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-17 03:45:08,727 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 153 selfloop transitions, 49 changer transitions 0/205 dead transitions. [2024-11-17 03:45:08,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 205 transitions, 1150 flow [2024-11-17 03:45:08,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-17 03:45:08,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2024-11-17 03:45:08,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 576 transitions. [2024-11-17 03:45:08,732 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.36 [2024-11-17 03:45:08,732 INFO L175 Difference]: Start difference. First operand has 80 places, 40 transitions, 273 flow. Second operand 50 states and 576 transitions. [2024-11-17 03:45:08,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 205 transitions, 1150 flow [2024-11-17 03:45:08,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 205 transitions, 1050 flow, removed 37 selfloop flow, removed 13 redundant places. [2024-11-17 03:45:08,745 INFO L231 Difference]: Finished difference. Result has 140 places, 64 transitions, 513 flow [2024-11-17 03:45:08,746 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-17 03:45:08,746 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 109 predicate places. [2024-11-17 03:45:08,747 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 64 transitions, 513 flow [2024-11-17 03:45:08,748 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-17 03:45:08,748 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:45:08,748 INFO L204 CegarLoopForPetriNet]: trace histogram [47, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:45:08,762 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-17 03:45:08,948 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-17 03:45:08,949 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-17 03:45:08,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:45:08,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1169172266, now seen corresponding path program 3 times [2024-11-17 03:45:08,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:45:08,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275074467] [2024-11-17 03:45:08,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:45:08,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:45:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:45:10,357 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-17 03:45:10,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:45:10,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275074467] [2024-11-17 03:45:10,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275074467] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:45:10,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655336890] [2024-11-17 03:45:10,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 03:45:10,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:45:10,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:45:10,360 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-17 03:45:10,361 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-17 03:45:10,449 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2024-11-17 03:45:10,449 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:45:10,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-17 03:45:10,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:45:11,576 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-17 03:45:11,576 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:45:13,779 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-17 03:45:13,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655336890] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:45:13,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:45:13,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 146 [2024-11-17 03:45:13,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778728922] [2024-11-17 03:45:13,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:45:13,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 147 states [2024-11-17 03:45:13,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:45:13,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2024-11-17 03:45:13,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9128, Invalid=12334, Unknown=0, NotChecked=0, Total=21462 [2024-11-17 03:45:13,791 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-11-17 03:45:13,792 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-17 03:45:13,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:45:13,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-11-17 03:45:13,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:45:18,614 INFO L124 PetriNetUnfolderBase]: 507/1503 cut-off events. [2024-11-17 03:45:18,615 INFO L125 PetriNetUnfolderBase]: For 267065/267065 co-relation queries the response was YES. [2024-11-17 03:45:18,620 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-17 03:45:18,625 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 297 selfloop transitions, 97 changer transitions 0/397 dead transitions. [2024-11-17 03:45:18,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 397 transitions, 2254 flow [2024-11-17 03:45:18,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2024-11-17 03:45:18,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2024-11-17 03:45:18,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 1128 transitions. [2024-11-17 03:45:18,629 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3596938775510204 [2024-11-17 03:45:18,629 INFO L175 Difference]: Start difference. First operand has 140 places, 64 transitions, 513 flow. Second operand 98 states and 1128 transitions. [2024-11-17 03:45:18,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 397 transitions, 2254 flow [2024-11-17 03:45:18,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 397 transitions, 2058 flow, removed 73 selfloop flow, removed 25 redundant places. [2024-11-17 03:45:18,681 INFO L231 Difference]: Finished difference. Result has 260 places, 112 transitions, 993 flow [2024-11-17 03:45:18,681 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-17 03:45:18,682 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 229 predicate places. [2024-11-17 03:45:18,682 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 112 transitions, 993 flow [2024-11-17 03:45:18,683 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-17 03:45:18,684 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:45:18,684 INFO L204 CegarLoopForPetriNet]: trace histogram [95, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:45:18,698 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-17 03:45:18,884 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-17 03:45:18,885 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-17 03:45:18,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:45:18,885 INFO L85 PathProgramCache]: Analyzing trace with hash 461323622, now seen corresponding path program 4 times [2024-11-17 03:45:18,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:45:18,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079710260] [2024-11-17 03:45:18,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:45:18,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:45:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:45:23,193 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-17 03:45:23,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:45:23,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079710260] [2024-11-17 03:45:23,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079710260] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:45:23,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44618842] [2024-11-17 03:45:23,194 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 03:45:23,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:45:23,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:45:23,195 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-17 03:45:23,196 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-17 03:45:23,283 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 03:45:23,283 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:45:23,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-11-17 03:45:23,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:45:26,683 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-17 03:45:26,683 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:45:30,123 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-17 03:45:30,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44618842] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:45:30,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:45:30,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 201 [2024-11-17 03:45:30,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132489466] [2024-11-17 03:45:30,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:45:30,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 202 states [2024-11-17 03:45:30,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:45:30,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2024-11-17 03:45:30,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15142, Invalid=25460, Unknown=0, NotChecked=0, Total=40602 [2024-11-17 03:45:30,134 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-11-17 03:45:30,135 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-17 03:45:30,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:45:30,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-11-17 03:45:30,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:45:37,197 INFO L124 PetriNetUnfolderBase]: 542/1608 cut-off events. [2024-11-17 03:45:37,198 INFO L125 PetriNetUnfolderBase]: For 181652/181652 co-relation queries the response was YES. [2024-11-17 03:45:37,205 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-17 03:45:37,211 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 318 selfloop transitions, 104 changer transitions 0/425 dead transitions. [2024-11-17 03:45:37,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 425 transitions, 2593 flow [2024-11-17 03:45:37,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-11-17 03:45:37,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2024-11-17 03:45:37,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 1164 transitions. [2024-11-17 03:45:37,213 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3464285714285714 [2024-11-17 03:45:37,213 INFO L175 Difference]: Start difference. First operand has 260 places, 112 transitions, 993 flow. Second operand 105 states and 1164 transitions. [2024-11-17 03:45:37,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 425 transitions, 2593 flow [2024-11-17 03:45:37,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 425 transitions, 2383 flow, removed 56 selfloop flow, removed 49 redundant places. [2024-11-17 03:45:37,324 INFO L231 Difference]: Finished difference. Result has 322 places, 119 transitions, 1063 flow [2024-11-17 03:45:37,326 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-17 03:45:37,326 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 291 predicate places. [2024-11-17 03:45:37,326 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 119 transitions, 1063 flow [2024-11-17 03:45:37,327 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-17 03:45:37,327 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:45:37,327 INFO L204 CegarLoopForPetriNet]: trace histogram [102, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:45:37,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-17 03:45:37,527 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-17 03:45:37,528 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-17 03:45:37,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:45:37,528 INFO L85 PathProgramCache]: Analyzing trace with hash -965447589, now seen corresponding path program 5 times [2024-11-17 03:45:37,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:45:37,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475263945] [2024-11-17 03:45:37,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:45:37,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:45:37,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:45:37,579 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 03:45:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:45:37,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 03:45:37,671 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 03:45:37,672 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2024-11-17 03:45:37,674 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2024-11-17 03:45:37,674 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-17 03:45:37,674 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-17 03:45:37,674 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2024-11-17 03:45:37,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 03:45:37,674 INFO L407 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1] [2024-11-17 03:45:37,785 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-17 03:45:37,785 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 03:45:37,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:45:37 BasicIcfg [2024-11-17 03:45:37,790 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 03:45:37,790 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 03:45:37,790 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 03:45:37,790 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 03:45:37,791 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:45:00" (3/4) ... [2024-11-17 03:45:37,792 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 03:45:37,793 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 03:45:37,794 INFO L158 Benchmark]: Toolchain (without parser) took 37856.61ms. Allocated memory was 151.0MB in the beginning and 771.8MB in the end (delta: 620.8MB). Free memory was 75.7MB in the beginning and 287.7MB in the end (delta: -212.0MB). Peak memory consumption was 410.0MB. Max. memory is 16.1GB. [2024-11-17 03:45:37,794 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 151.0MB. Free memory is still 101.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:45:37,794 INFO L158 Benchmark]: CACSL2BoogieTranslator took 436.47ms. Allocated memory is still 151.0MB. Free memory was 75.5MB in the beginning and 117.8MB in the end (delta: -42.3MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2024-11-17 03:45:37,795 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.20ms. Allocated memory was 151.0MB in the beginning and 207.6MB in the end (delta: 56.6MB). Free memory was 117.7MB in the beginning and 177.6MB in the end (delta: -59.9MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-11-17 03:45:37,795 INFO L158 Benchmark]: Boogie Preprocessor took 36.68ms. Allocated memory is still 207.6MB. Free memory was 177.6MB in the beginning and 175.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 03:45:37,795 INFO L158 Benchmark]: IcfgBuilder took 396.30ms. Allocated memory is still 207.6MB. Free memory was 175.5MB in the beginning and 154.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-17 03:45:37,795 INFO L158 Benchmark]: TraceAbstraction took 36930.84ms. Allocated memory was 207.6MB in the beginning and 771.8MB in the end (delta: 564.1MB). Free memory was 153.5MB in the beginning and 287.7MB in the end (delta: -134.2MB). Peak memory consumption was 430.0MB. Max. memory is 16.1GB. [2024-11-17 03:45:37,796 INFO L158 Benchmark]: Witness Printer took 3.24ms. Allocated memory is still 771.8MB. Free memory is still 287.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:45:37,797 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 151.0MB. Free memory is still 101.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 436.47ms. Allocated memory is still 151.0MB. Free memory was 75.5MB in the beginning and 117.8MB in the end (delta: -42.3MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.20ms. Allocated memory was 151.0MB in the beginning and 207.6MB in the end (delta: 56.6MB). Free memory was 117.7MB in the beginning and 177.6MB in the end (delta: -59.9MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.68ms. Allocated memory is still 207.6MB. Free memory was 177.6MB in the beginning and 175.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 396.30ms. Allocated memory is still 207.6MB. Free memory was 175.5MB in the beginning and 154.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 36930.84ms. Allocated memory was 207.6MB in the beginning and 771.8MB in the end (delta: 564.1MB). Free memory was 153.5MB in the beginning and 287.7MB in the end (delta: -134.2MB). Peak memory consumption was 430.0MB. Max. memory is 16.1GB. * Witness Printer took 3.24ms. Allocated memory is still 771.8MB. Free memory is still 287.7MB. 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: 36.7s, OverallIterations: 11, TraceHistogramMax: 102, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 15.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6118 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6114 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 1.4s 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, 23.0s 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.3s SatisfiabilityAnalysisTime, 18.9s 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-17 03:45:37,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-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-3289d67-m [2024-11-17 03:45:39,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:45:39,630 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-17 03:45:39,635 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:45:39,635 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:45:39,659 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:45:39,659 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:45:39,659 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:45:39,660 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:45:39,660 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:45:39,660 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:45:39,661 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:45:39,661 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:45:39,661 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:45:39,662 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:45:39,662 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:45:39,662 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:45:39,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:45:39,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:45:39,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:45:39,663 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 03:45:39,664 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 03:45:39,664 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 03:45:39,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:45:39,664 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 03:45:39,665 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 03:45:39,665 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:45:39,665 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 03:45:39,665 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:45:39,666 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:45:39,666 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:45:39,666 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:45:39,666 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:45:39,666 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:45:39,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:45:39,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:45:39,667 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:45:39,667 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:45:39,667 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 03:45:39,667 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 03:45:39,668 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:45:39,668 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:45:39,668 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:45:39,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:45:39,668 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-17 03:45:39,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:45:39,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:45:39,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:45:39,928 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:45:39,929 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:45:39,930 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-17 03:45:41,129 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:45:41,350 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:45:41,350 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-100.i [2024-11-17 03:45:41,368 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b2f6dc56/902df190ede94a528322b51b762168bf/FLAGb48e5f279 [2024-11-17 03:45:41,690 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b2f6dc56/902df190ede94a528322b51b762168bf [2024-11-17 03:45:41,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:45:41,693 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:45:41,694 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:45:41,695 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:45:41,698 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:45:41,699 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:45:41" (1/1) ... [2024-11-17 03:45:41,700 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f74565f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:45:41, skipping insertion in model container [2024-11-17 03:45:41,700 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:45:41" (1/1) ... [2024-11-17 03:45:41,741 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:45:42,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:45:42,049 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:45:42,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:45:42,114 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:45:42,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:45:42 WrapperNode [2024-11-17 03:45:42,115 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:45:42,116 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:45:42,116 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:45:42,116 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:45:42,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:45:42" (1/1) ... [2024-11-17 03:45:42,138 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:45:42" (1/1) ... [2024-11-17 03:45:42,158 INFO L138 Inliner]: procedures = 170, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 56 [2024-11-17 03:45:42,158 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:45:42,159 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:45:42,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:45:42,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:45:42,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:45:42" (1/1) ... [2024-11-17 03:45:42,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:45:42" (1/1) ... [2024-11-17 03:45:42,168 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:45:42" (1/1) ... [2024-11-17 03:45:42,185 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-17 03:45:42,185 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:45:42" (1/1) ... [2024-11-17 03:45:42,185 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:45:42" (1/1) ... [2024-11-17 03:45:42,191 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:45:42" (1/1) ... [2024-11-17 03:45:42,191 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:45:42" (1/1) ... [2024-11-17 03:45:42,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:45:42" (1/1) ... [2024-11-17 03:45:42,193 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:45:42" (1/1) ... [2024-11-17 03:45:42,197 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:45:42,200 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:45:42,200 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:45:42,200 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:45:42,201 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:45:42" (1/1) ... [2024-11-17 03:45:42,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:45:42,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:45:42,230 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-17 03:45:42,232 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-17 03:45:42,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:45:42,263 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-17 03:45:42,263 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-17 03:45:42,263 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-17 03:45:42,263 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-17 03:45:42,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 03:45:42,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:45:42,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:45:42,265 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-17 03:45:42,400 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:45:42,403 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:45:42,527 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-17 03:45:42,528 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:45:42,630 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:45:42,630 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 03:45:42,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:45:42 BoogieIcfgContainer [2024-11-17 03:45:42,630 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:45:42,632 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:45:42,632 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:45:42,634 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:45:42,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:45:41" (1/3) ... [2024-11-17 03:45:42,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3396cbb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:45:42, skipping insertion in model container [2024-11-17 03:45:42,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:45:42" (2/3) ... [2024-11-17 03:45:42,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3396cbb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:45:42, skipping insertion in model container [2024-11-17 03:45:42,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:45:42" (3/3) ... [2024-11-17 03:45:42,636 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind1-100.i [2024-11-17 03:45:42,647 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:45:42,647 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 03:45:42,647 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-17 03:45:42,691 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-17 03:45:42,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 32 transitions, 78 flow [2024-11-17 03:45:42,735 INFO L124 PetriNetUnfolderBase]: 5/30 cut-off events. [2024-11-17 03:45:42,735 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-17 03:45:42,737 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-17 03:45:42,737 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 32 transitions, 78 flow [2024-11-17 03:45:42,739 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 29 transitions, 70 flow [2024-11-17 03:45:42,745 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:45:42,751 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;@71492a28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:45:42,752 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-17 03:45:42,759 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-17 03:45:42,759 INFO L124 PetriNetUnfolderBase]: 5/25 cut-off events. [2024-11-17 03:45:42,759 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-17 03:45:42,760 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:45:42,762 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:45:42,762 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-17 03:45:42,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:45:42,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1717789198, now seen corresponding path program 1 times [2024-11-17 03:45:42,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:45:42,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933783537] [2024-11-17 03:45:42,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:45:42,778 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-17 03:45:42,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:45:42,781 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-17 03:45:42,783 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-17 03:45:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:45:42,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-17 03:45:42,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:45:42,878 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-17 03:45:42,878 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:45:42,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:45:42,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933783537] [2024-11-17 03:45:42,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [933783537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:45:42,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:45:42,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:45:42,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550296905] [2024-11-17 03:45:42,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:45:42,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 03:45:42,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:45:42,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 03:45:42,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 03:45:42,906 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-11-17 03:45:42,907 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-17 03:45:42,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:45:42,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-11-17 03:45:42,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:45:42,991 INFO L124 PetriNetUnfolderBase]: 108/243 cut-off events. [2024-11-17 03:45:42,991 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-17 03:45:42,993 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-17 03:45:42,997 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 19 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2024-11-17 03:45:42,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 25 transitions, 100 flow [2024-11-17 03:45:42,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 03:45:43,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-17 03:45:43,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2024-11-17 03:45:43,007 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.59375 [2024-11-17 03:45:43,008 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 70 flow. Second operand 2 states and 38 transitions. [2024-11-17 03:45:43,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 25 transitions, 100 flow [2024-11-17 03:45:43,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 25 transitions, 92 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-17 03:45:43,014 INFO L231 Difference]: Finished difference. Result has 27 places, 25 transitions, 54 flow [2024-11-17 03:45:43,015 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-17 03:45:43,019 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2024-11-17 03:45:43,020 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 25 transitions, 54 flow [2024-11-17 03:45:43,021 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-17 03:45:43,021 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:45:43,021 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:45:43,028 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-17 03:45:43,222 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-17 03:45:43,223 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-17 03:45:43,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:45:43,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1742396146, now seen corresponding path program 1 times [2024-11-17 03:45:43,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:45:43,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113399373] [2024-11-17 03:45:43,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:45:43,224 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-17 03:45:43,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:45:43,226 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-17 03:45:43,227 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-17 03:45:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:45:43,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 03:45:43,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:45:43,368 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-17 03:45:43,369 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:45:43,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:45:43,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113399373] [2024-11-17 03:45:43,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113399373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:45:43,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:45:43,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:45:43,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916967719] [2024-11-17 03:45:43,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:45:43,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:45:43,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:45:43,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:45:43,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:45:43,381 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-11-17 03:45:43,381 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-17 03:45:43,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:45:43,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-11-17 03:45:43,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:45:43,541 INFO L124 PetriNetUnfolderBase]: 165/383 cut-off events. [2024-11-17 03:45:43,541 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-17 03:45:43,542 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-17 03:45:43,543 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 35 selfloop transitions, 5 changer transitions 0/46 dead transitions. [2024-11-17 03:45:43,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 46 transitions, 179 flow [2024-11-17 03:45:43,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:45:43,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:45:43,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2024-11-17 03:45:43,545 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.50625 [2024-11-17 03:45:43,545 INFO L175 Difference]: Start difference. First operand has 27 places, 25 transitions, 54 flow. Second operand 5 states and 81 transitions. [2024-11-17 03:45:43,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 46 transitions, 179 flow [2024-11-17 03:45:43,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 46 transitions, 179 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-17 03:45:43,547 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 84 flow [2024-11-17 03:45:43,547 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-17 03:45:43,547 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2024-11-17 03:45:43,548 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 84 flow [2024-11-17 03:45:43,548 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-17 03:45:43,548 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:45:43,548 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:45:43,552 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-17 03:45:43,751 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-17 03:45:43,751 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-17 03:45:43,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:45:43,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1363693425, now seen corresponding path program 1 times [2024-11-17 03:45:43,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:45:43,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1359235053] [2024-11-17 03:45:43,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:45:43,752 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-17 03:45:43,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:45:43,755 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-17 03:45:43,756 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-17 03:45:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:45:43,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 03:45:43,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:45:43,842 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-17 03:45:43,843 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:45:43,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:45:43,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1359235053] [2024-11-17 03:45:43,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1359235053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:45:43,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:45:43,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:45:43,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746194468] [2024-11-17 03:45:43,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:45:43,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:45:43,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:45:43,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:45:43,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:45:43,848 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-11-17 03:45:43,849 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-17 03:45:43,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:45:43,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-11-17 03:45:43,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:45:43,953 INFO L124 PetriNetUnfolderBase]: 111/278 cut-off events. [2024-11-17 03:45:43,953 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2024-11-17 03:45:43,954 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-17 03:45:43,955 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 35 selfloop transitions, 6 changer transitions 0/47 dead transitions. [2024-11-17 03:45:43,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 47 transitions, 226 flow [2024-11-17 03:45:43,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:45:43,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:45:43,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2024-11-17 03:45:43,956 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-17 03:45:43,956 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 84 flow. Second operand 5 states and 80 transitions. [2024-11-17 03:45:43,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 47 transitions, 226 flow [2024-11-17 03:45:43,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 47 transitions, 221 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:45:43,959 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 115 flow [2024-11-17 03:45:43,959 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-17 03:45:43,960 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2024-11-17 03:45:43,960 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 115 flow [2024-11-17 03:45:43,960 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-17 03:45:43,960 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:45:43,960 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:45:43,965 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 (4)] Forceful destruction successful, exit code 0 [2024-11-17 03:45:44,163 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-17 03:45:44,164 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-17 03:45:44,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:45:44,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1712250033, now seen corresponding path program 1 times [2024-11-17 03:45:44,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:45:44,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575515321] [2024-11-17 03:45:44,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:45:44,165 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-17 03:45:44,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:45:44,167 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-17 03:45:44,168 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-17 03:45:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:45:44,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 03:45:44,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:45:44,276 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-17 03:45:44,276 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:45:44,330 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-17 03:45:44,331 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:45:44,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [575515321] [2024-11-17 03:45:44,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [575515321] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:45:44,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 03:45:44,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-11-17 03:45:44,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866237693] [2024-11-17 03:45:44,331 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 03:45:44,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 03:45:44,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:45:44,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 03:45:44,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-17 03:45:44,332 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-11-17 03:45:44,333 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-17 03:45:44,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:45:44,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-11-17 03:45:44,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:45:44,611 INFO L124 PetriNetUnfolderBase]: 197/476 cut-off events. [2024-11-17 03:45:44,613 INFO L125 PetriNetUnfolderBase]: For 324/324 co-relation queries the response was YES. [2024-11-17 03:45:44,614 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-17 03:45:44,616 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 57 selfloop transitions, 13 changer transitions 0/75 dead transitions. [2024-11-17 03:45:44,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 75 transitions, 395 flow [2024-11-17 03:45:44,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 03:45:44,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-17 03:45:44,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2024-11-17 03:45:44,619 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.41761363636363635 [2024-11-17 03:45:44,619 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 115 flow. Second operand 11 states and 147 transitions. [2024-11-17 03:45:44,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 75 transitions, 395 flow [2024-11-17 03:45:44,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 75 transitions, 392 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:45:44,623 INFO L231 Difference]: Finished difference. Result has 53 places, 38 transitions, 200 flow [2024-11-17 03:45:44,623 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-17 03:45:44,624 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 22 predicate places. [2024-11-17 03:45:44,624 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 200 flow [2024-11-17 03:45:44,624 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-17 03:45:44,624 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:45:44,624 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:45:44,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-17 03:45:44,829 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-17 03:45:44,829 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-17 03:45:44,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:45:44,830 INFO L85 PathProgramCache]: Analyzing trace with hash 892475730, now seen corresponding path program 1 times [2024-11-17 03:45:44,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:45:44,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [602016386] [2024-11-17 03:45:44,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:45:44,830 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-17 03:45:44,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:45:44,832 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-17 03:45:44,833 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-17 03:45:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:45:44,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 03:45:44,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:45:45,012 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-17 03:45:45,012 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:45:45,116 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-17 03:45:45,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:45:45,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [602016386] [2024-11-17 03:45:45,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [602016386] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:45:45,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 03:45:45,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-17 03:45:45,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506296667] [2024-11-17 03:45:45,117 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 03:45:45,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-17 03:45:45,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:45:45,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-17 03:45:45,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-17 03:45:45,122 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-11-17 03:45:45,124 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-17 03:45:45,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:45:45,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-11-17 03:45:45,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:45:45,532 INFO L124 PetriNetUnfolderBase]: 217/535 cut-off events. [2024-11-17 03:45:45,532 INFO L125 PetriNetUnfolderBase]: For 1684/1684 co-relation queries the response was YES. [2024-11-17 03:45:45,533 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-17 03:45:45,535 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 67 selfloop transitions, 16 changer transitions 0/88 dead transitions. [2024-11-17 03:45:45,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 88 transitions, 541 flow [2024-11-17 03:45:45,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 03:45:45,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-17 03:45:45,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 178 transitions. [2024-11-17 03:45:45,536 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.39732142857142855 [2024-11-17 03:45:45,536 INFO L175 Difference]: Start difference. First operand has 53 places, 38 transitions, 200 flow. Second operand 14 states and 178 transitions. [2024-11-17 03:45:45,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 88 transitions, 541 flow [2024-11-17 03:45:45,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 88 transitions, 506 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-11-17 03:45:45,540 INFO L231 Difference]: Finished difference. Result has 65 places, 42 transitions, 239 flow [2024-11-17 03:45:45,541 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-17 03:45:45,541 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 34 predicate places. [2024-11-17 03:45:45,541 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 42 transitions, 239 flow [2024-11-17 03:45:45,541 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-17 03:45:45,541 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:45:45,542 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-17 03:45:45,546 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 (6)] Forceful destruction successful, exit code 0 [2024-11-17 03:45:45,744 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-17 03:45:45,744 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-17 03:45:45,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:45:45,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1605174864, now seen corresponding path program 1 times [2024-11-17 03:45:45,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:45:45,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904867672] [2024-11-17 03:45:45,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:45:45,745 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-17 03:45:45,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:45:45,748 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-17 03:45:45,748 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-17 03:45:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:45:45,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 03:45:45,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:45:45,825 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-17 03:45:45,826 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:45:45,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:45:45,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904867672] [2024-11-17 03:45:45,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904867672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:45:45,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:45:45,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 03:45:45,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807962705] [2024-11-17 03:45:45,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:45:45,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:45:45,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:45:45,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:45:45,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:45:45,827 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-11-17 03:45:45,827 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-17 03:45:45,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:45:45,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-11-17 03:45:45,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:45:45,884 INFO L124 PetriNetUnfolderBase]: 183/478 cut-off events. [2024-11-17 03:45:45,884 INFO L125 PetriNetUnfolderBase]: For 1434/1434 co-relation queries the response was YES. [2024-11-17 03:45:45,886 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-17 03:45:45,887 INFO L140 encePairwiseOnDemand]: 30/32 looper letters, 27 selfloop transitions, 1 changer transitions 8/41 dead transitions. [2024-11-17 03:45:45,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 41 transitions, 309 flow [2024-11-17 03:45:45,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:45:45,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:45:45,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2024-11-17 03:45:45,888 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2024-11-17 03:45:45,888 INFO L175 Difference]: Start difference. First operand has 65 places, 42 transitions, 239 flow. Second operand 3 states and 41 transitions. [2024-11-17 03:45:45,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 41 transitions, 309 flow [2024-11-17 03:45:45,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 41 transitions, 267 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-11-17 03:45:45,893 INFO L231 Difference]: Finished difference. Result has 57 places, 33 transitions, 160 flow [2024-11-17 03:45:45,893 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-17 03:45:45,894 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 26 predicate places. [2024-11-17 03:45:45,896 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 33 transitions, 160 flow [2024-11-17 03:45:45,896 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-17 03:45:45,896 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:45:45,896 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:45:45,900 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 (7)] Forceful destruction successful, exit code 0 [2024-11-17 03:45:46,097 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-17 03:45:46,097 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-17 03:45:46,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:45:46,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1364713306, now seen corresponding path program 2 times [2024-11-17 03:45:46,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:45:46,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [866346518] [2024-11-17 03:45:46,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 03:45:46,099 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-17 03:45:46,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:45:46,100 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-17 03:45:46,102 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-17 03:45:46,136 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 03:45:46,137 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:45:46,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-17 03:45:46,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:45:46,279 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-17 03:45:46,279 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:45:46,546 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-17 03:45:46,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:45:46,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [866346518] [2024-11-17 03:45:46,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [866346518] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:45:46,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 03:45:46,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2024-11-17 03:45:46,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702163580] [2024-11-17 03:45:46,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 03:45:46,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-17 03:45:46,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:45:46,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-17 03:45:46,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2024-11-17 03:45:46,599 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-11-17 03:45:46,600 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-17 03:45:46,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:45:46,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-11-17 03:45:46,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:45:47,850 INFO L124 PetriNetUnfolderBase]: 236/583 cut-off events. [2024-11-17 03:45:47,850 INFO L125 PetriNetUnfolderBase]: For 2578/2578 co-relation queries the response was YES. [2024-11-17 03:45:47,851 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-17 03:45:47,853 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 69 selfloop transitions, 19 changer transitions 50/141 dead transitions. [2024-11-17 03:45:47,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 141 transitions, 838 flow [2024-11-17 03:45:47,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-17 03:45:47,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2024-11-17 03:45:47,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 323 transitions. [2024-11-17 03:45:47,854 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.33645833333333336 [2024-11-17 03:45:47,854 INFO L175 Difference]: Start difference. First operand has 57 places, 33 transitions, 160 flow. Second operand 30 states and 323 transitions. [2024-11-17 03:45:47,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 141 transitions, 838 flow [2024-11-17 03:45:47,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 141 transitions, 812 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-11-17 03:45:47,858 INFO L231 Difference]: Finished difference. Result has 91 places, 38 transitions, 264 flow [2024-11-17 03:45:47,858 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-17 03:45:47,859 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 60 predicate places. [2024-11-17 03:45:47,859 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 38 transitions, 264 flow [2024-11-17 03:45:47,859 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-17 03:45:47,859 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:45:47,859 INFO L204 CegarLoopForPetriNet]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:45:47,866 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-17 03:45:48,061 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-17 03:45:48,062 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-17 03:45:48,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:45:48,062 INFO L85 PathProgramCache]: Analyzing trace with hash -840519074, now seen corresponding path program 2 times [2024-11-17 03:45:48,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:45:48,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793737561] [2024-11-17 03:45:48,062 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 03:45:48,062 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-17 03:45:48,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:45:48,065 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-17 03:45:48,065 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-17 03:45:48,098 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 03:45:48,098 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:45:48,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-17 03:45:48,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:45:48,261 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-17 03:45:48,261 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:45:48,626 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-17 03:45:48,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:45:48,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793737561] [2024-11-17 03:45:48,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [793737561] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:45:48,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 03:45:48,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 21 [2024-11-17 03:45:48,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616793738] [2024-11-17 03:45:48,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 03:45:48,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-17 03:45:48,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:45:48,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-17 03:45:48,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2024-11-17 03:45:48,629 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-11-17 03:45:48,630 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-17 03:45:48,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:45:48,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-11-17 03:45:48,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:45:50,952 INFO L124 PetriNetUnfolderBase]: 266/681 cut-off events. [2024-11-17 03:45:50,953 INFO L125 PetriNetUnfolderBase]: For 8364/8364 co-relation queries the response was YES. [2024-11-17 03:45:50,954 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-17 03:45:50,956 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 89 selfloop transitions, 25 changer transitions 57/174 dead transitions. [2024-11-17 03:45:50,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 174 transitions, 1307 flow [2024-11-17 03:45:50,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-17 03:45:50,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2024-11-17 03:45:50,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 410 transitions. [2024-11-17 03:45:50,958 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.328525641025641 [2024-11-17 03:45:50,958 INFO L175 Difference]: Start difference. First operand has 91 places, 38 transitions, 264 flow. Second operand 39 states and 410 transitions. [2024-11-17 03:45:50,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 174 transitions, 1307 flow [2024-11-17 03:45:50,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 174 transitions, 1139 flow, removed 69 selfloop flow, removed 22 redundant places. [2024-11-17 03:45:50,966 INFO L231 Difference]: Finished difference. Result has 117 places, 46 transitions, 332 flow [2024-11-17 03:45:50,966 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-17 03:45:50,967 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 86 predicate places. [2024-11-17 03:45:50,967 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 46 transitions, 332 flow [2024-11-17 03:45:50,967 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-17 03:45:50,967 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:45:50,967 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:45:50,970 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-17 03:45:51,170 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-17 03:45:51,172 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-17 03:45:51,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:45:51,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1521077356, now seen corresponding path program 3 times [2024-11-17 03:45:51,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:45:51,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [301764841] [2024-11-17 03:45:51,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 03:45:51,173 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-17 03:45:51,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:45:51,176 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-17 03:45:51,177 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-17 03:45:51,207 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-17 03:45:51,207 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:45:51,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 03:45:51,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:45:51,336 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-17 03:45:51,336 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:45:51,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:45:51,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [301764841] [2024-11-17 03:45:51,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [301764841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:45:51,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:45:51,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 03:45:51,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108217653] [2024-11-17 03:45:51,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:45:51,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 03:45:51,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:45:51,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 03:45:51,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-17 03:45:51,347 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-11-17 03:45:51,348 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-17 03:45:51,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:45:51,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-11-17 03:45:51,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:45:51,515 INFO L124 PetriNetUnfolderBase]: 191/511 cut-off events. [2024-11-17 03:45:51,516 INFO L125 PetriNetUnfolderBase]: For 5411/5411 co-relation queries the response was YES. [2024-11-17 03:45:51,518 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-17 03:45:51,519 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 28 selfloop transitions, 1 changer transitions 30/62 dead transitions. [2024-11-17 03:45:51,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 62 transitions, 549 flow [2024-11-17 03:45:51,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 03:45:51,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-17 03:45:51,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2024-11-17 03:45:51,520 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3794642857142857 [2024-11-17 03:45:51,520 INFO L175 Difference]: Start difference. First operand has 117 places, 46 transitions, 332 flow. Second operand 7 states and 85 transitions. [2024-11-17 03:45:51,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 62 transitions, 549 flow [2024-11-17 03:45:51,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 62 transitions, 453 flow, removed 30 selfloop flow, removed 30 redundant places. [2024-11-17 03:45:51,531 INFO L231 Difference]: Finished difference. Result has 82 places, 32 transitions, 185 flow [2024-11-17 03:45:51,531 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-17 03:45:51,532 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 51 predicate places. [2024-11-17 03:45:51,532 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 32 transitions, 185 flow [2024-11-17 03:45:51,533 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-17 03:45:51,533 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:45:51,533 INFO L204 CegarLoopForPetriNet]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:45:51,536 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-17 03:45:51,735 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-17 03:45:51,736 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-17 03:45:51,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:45:51,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1249935478, now seen corresponding path program 3 times [2024-11-17 03:45:51,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:45:51,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426226029] [2024-11-17 03:45:51,736 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 03:45:51,736 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-17 03:45:51,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:45:51,737 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-17 03:45:51,738 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-17 03:45:51,801 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2024-11-17 03:45:51,801 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:45:51,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-17 03:45:51,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:45:52,156 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-17 03:45:52,156 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:45:53,207 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-17 03:45:53,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:45:53,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1426226029] [2024-11-17 03:45:53,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1426226029] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:45:53,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 03:45:53,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 37 [2024-11-17 03:45:53,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363685909] [2024-11-17 03:45:53,208 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 03:45:53,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-17 03:45:53,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:45:53,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-17 03:45:53,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=1042, Unknown=0, NotChecked=0, Total=1406 [2024-11-17 03:45:53,211 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-11-17 03:45:53,212 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-17 03:45:53,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:45:53,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-11-17 03:45:53,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:45:57,825 INFO L124 PetriNetUnfolderBase]: 267/633 cut-off events. [2024-11-17 03:45:57,826 INFO L125 PetriNetUnfolderBase]: For 27342/27342 co-relation queries the response was YES. [2024-11-17 03:45:57,827 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-17 03:45:57,829 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 107 selfloop transitions, 34 changer transitions 19/163 dead transitions. [2024-11-17 03:45:57,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 163 transitions, 1556 flow [2024-11-17 03:45:57,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-17 03:45:57,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-11-17 03:45:57,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 379 transitions. [2024-11-17 03:45:57,832 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3289930555555556 [2024-11-17 03:45:57,832 INFO L175 Difference]: Start difference. First operand has 82 places, 32 transitions, 185 flow. Second operand 36 states and 379 transitions. [2024-11-17 03:45:57,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 163 transitions, 1556 flow [2024-11-17 03:45:57,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 163 transitions, 1191 flow, removed 181 selfloop flow, removed 15 redundant places. [2024-11-17 03:45:57,841 INFO L231 Difference]: Finished difference. Result has 88 places, 48 transitions, 294 flow [2024-11-17 03:45:57,841 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-17 03:45:57,841 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 57 predicate places. [2024-11-17 03:45:57,841 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 48 transitions, 294 flow [2024-11-17 03:45:57,842 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-17 03:45:57,842 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:45:57,842 INFO L204 CegarLoopForPetriNet]: trace histogram [31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:45:57,847 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-17 03:45:58,042 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-17 03:45:58,043 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-17 03:45:58,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:45:58,043 INFO L85 PathProgramCache]: Analyzing trace with hash -205091674, now seen corresponding path program 4 times [2024-11-17 03:45:58,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:45:58,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733142626] [2024-11-17 03:45:58,043 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 03:45:58,043 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-17 03:45:58,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:45:58,044 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-17 03:45:58,045 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-17 03:45:58,111 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 03:45:58,112 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 03:45:58,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-17 03:45:58,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:45:58,904 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-17 03:45:58,904 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:46:02,968 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-17 03:46:02,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:46:02,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733142626] [2024-11-17 03:46:02,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1733142626] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:46:02,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 03:46:02,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 36] total 69 [2024-11-17 03:46:02,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447351001] [2024-11-17 03:46:02,968 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 03:46:02,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2024-11-17 03:46:02,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:46:02,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2024-11-17 03:46:02,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1228, Invalid=3602, Unknown=0, NotChecked=0, Total=4830 [2024-11-17 03:46:02,980 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-11-17 03:46:02,981 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-17 03:46:02,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:46:02,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-11-17 03:46:02,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand