./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 3061b6dc 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.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:57:50,297 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:57:50,366 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:57:50,371 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:57:50,371 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:57:50,397 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:57:50,398 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:57:50,398 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:57:50,400 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:57:50,402 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:57:50,403 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:57:50,403 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:57:50,403 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:57:50,404 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:57:50,404 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:57:50,405 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:57:50,405 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:57:50,405 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:57:50,406 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:57:50,406 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:57:50,406 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:57:50,407 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:57:50,407 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:57:50,407 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:57:50,408 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:57:50,408 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:57:50,408 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:57:50,409 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:57:50,409 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:57:50,409 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:57:50,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:57:50,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:57:50,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:57:50,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:57:50,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:57:50,411 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:57:50,411 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:57:50,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:57:50,411 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:57:50,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:57:50,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:57:50,412 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:57:50,413 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-19 09:57:50,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:57:50,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:57:50,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:57:50,768 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:57:50,768 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:57:50,769 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-19 09:57:52,285 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:57:52,564 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:57:52,566 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-100.i [2024-11-19 09:57:52,586 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/928099608/f145d1f15cb743d29da7e69f595e12e3/FLAGb679bea43 [2024-11-19 09:57:52,880 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/928099608/f145d1f15cb743d29da7e69f595e12e3 [2024-11-19 09:57:52,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:57:52,885 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:57:52,887 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:57:52,888 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:57:52,893 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:57:52,894 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:57:52" (1/1) ... [2024-11-19 09:57:52,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4791030e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:57:52, skipping insertion in model container [2024-11-19 09:57:52,895 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:57:52" (1/1) ... [2024-11-19 09:57:52,947 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:57:53,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:57:53,346 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:57:53,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:57:53,446 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:57:53,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:57:53 WrapperNode [2024-11-19 09:57:53,447 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:57:53,448 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:57:53,448 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:57:53,448 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:57:53,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:57:53" (1/1) ... [2024-11-19 09:57:53,471 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:57:53" (1/1) ... [2024-11-19 09:57:53,495 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 56 [2024-11-19 09:57:53,497 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:57:53,498 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:57:53,498 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:57:53,498 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:57:53,507 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:57:53" (1/1) ... [2024-11-19 09:57:53,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:57:53" (1/1) ... [2024-11-19 09:57:53,510 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:57:53" (1/1) ... [2024-11-19 09:57:53,530 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-19 09:57:53,531 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:57:53" (1/1) ... [2024-11-19 09:57:53,531 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:57:53" (1/1) ... [2024-11-19 09:57:53,538 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:57:53" (1/1) ... [2024-11-19 09:57:53,543 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:57:53" (1/1) ... [2024-11-19 09:57:53,545 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:57:53" (1/1) ... [2024-11-19 09:57:53,546 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:57:53" (1/1) ... [2024-11-19 09:57:53,548 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:57:53,549 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:57:53,549 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:57:53,549 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:57:53,550 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:57:53" (1/1) ... [2024-11-19 09:57:53,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:57:53,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:57:53,592 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-19 09:57:53,598 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-19 09:57:53,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:57:53,649 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-19 09:57:53,649 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-19 09:57:53,649 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-19 09:57:53,649 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-19 09:57:53,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:57:53,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:57:53,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:57:53,651 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:57:53,805 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:57:53,807 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:57:53,940 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:57:53,940 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:57:54,030 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:57:54,031 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 09:57:54,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:57:54 BoogieIcfgContainer [2024-11-19 09:57:54,031 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:57:54,033 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:57:54,034 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:57:54,037 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:57:54,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:57:52" (1/3) ... [2024-11-19 09:57:54,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13aa4ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:57:54, skipping insertion in model container [2024-11-19 09:57:54,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:57:53" (2/3) ... [2024-11-19 09:57:54,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13aa4ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:57:54, skipping insertion in model container [2024-11-19 09:57:54,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:57:54" (3/3) ... [2024-11-19 09:57:54,041 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind1-100.i [2024-11-19 09:57:54,057 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:57:54,058 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 09:57:54,058 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:57:54,111 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 09:57:54,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 72 flow [2024-11-19 09:57:54,181 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2024-11-19 09:57:54,181 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 09:57:54,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 4/27 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/21 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2024-11-19 09:57:54,184 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 72 flow [2024-11-19 09:57:54,187 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 64 flow [2024-11-19 09:57:54,194 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:57:54,200 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;@67403acc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:57:54,200 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-19 09:57:54,208 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:57:54,209 INFO L124 PetriNetUnfolderBase]: 4/21 cut-off events. [2024-11-19 09:57:54,209 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 09:57:54,209 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:57:54,210 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:57:54,210 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-19 09:57:54,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:57:54,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1073741351, now seen corresponding path program 1 times [2024-11-19 09:57:54,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:57:54,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573196058] [2024-11-19 09:57:54,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:57:54,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:57:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:57:54,628 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-19 09:57:54,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:57:54,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573196058] [2024-11-19 09:57:54,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573196058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:57:54,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:57:54,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:57:54,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946633904] [2024-11-19 09:57:54,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:57:54,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:57:54,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:57:54,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:57:54,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:57:54,681 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-19 09:57:54,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 64 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-19 09:57:54,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:57:54,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-19 09:57:54,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:57:54,899 INFO L124 PetriNetUnfolderBase]: 152/302 cut-off events. [2024-11-19 09:57:54,899 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-19 09:57:54,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 602 conditions, 302 events. 152/302 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1213 event pairs, 68 based on Foata normal form. 22/268 useless extension candidates. Maximal degree in co-relation 532. Up to 146 conditions per place. [2024-11-19 09:57:54,908 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 33 selfloop transitions, 7 changer transitions 0/46 dead transitions. [2024-11-19 09:57:54,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 46 transitions, 196 flow [2024-11-19 09:57:54,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:57:54,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:57:54,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2024-11-19 09:57:54,925 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5229885057471264 [2024-11-19 09:57:54,927 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 64 flow. Second operand 6 states and 91 transitions. [2024-11-19 09:57:54,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 46 transitions, 196 flow [2024-11-19 09:57:54,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 46 transitions, 180 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:57:54,935 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 91 flow [2024-11-19 09:57:54,937 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=91, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2024-11-19 09:57:54,943 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2024-11-19 09:57:54,943 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 91 flow [2024-11-19 09:57:54,943 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-19 09:57:54,944 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:57:54,944 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:57:54,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:57:54,945 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-19 09:57:54,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:57:54,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1072770645, now seen corresponding path program 1 times [2024-11-19 09:57:54,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:57:54,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030291203] [2024-11-19 09:57:54,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:57:54,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:57:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:57:55,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:57:55,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:57:55,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030291203] [2024-11-19 09:57:55,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030291203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:57:55,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:57:55,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:57:55,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345851722] [2024-11-19 09:57:55,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:57:55,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:57:55,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:57:55,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:57:55,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:57:55,108 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-11-19 09:57:55,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-19 09:57:55,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:57:55,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-11-19 09:57:55,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:57:55,230 INFO L124 PetriNetUnfolderBase]: 111/247 cut-off events. [2024-11-19 09:57:55,230 INFO L125 PetriNetUnfolderBase]: For 133/133 co-relation queries the response was YES. [2024-11-19 09:57:55,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 247 events. 111/247 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 936 event pairs, 30 based on Foata normal form. 13/245 useless extension candidates. Maximal degree in co-relation 312. Up to 97 conditions per place. [2024-11-19 09:57:55,234 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 33 selfloop transitions, 6 changer transitions 0/45 dead transitions. [2024-11-19 09:57:55,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 45 transitions, 228 flow [2024-11-19 09:57:55,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:57:55,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:57:55,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2024-11-19 09:57:55,236 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.503448275862069 [2024-11-19 09:57:55,236 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 91 flow. Second operand 5 states and 73 transitions. [2024-11-19 09:57:55,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 45 transitions, 228 flow [2024-11-19 09:57:55,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 45 transitions, 227 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:57:55,240 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 127 flow [2024-11-19 09:57:55,240 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-11-19 09:57:55,241 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2024-11-19 09:57:55,242 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 127 flow [2024-11-19 09:57:55,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-19 09:57:55,242 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:57:55,242 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:57:55,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 09:57:55,243 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-19 09:57:55,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:57:55,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1251716570, now seen corresponding path program 1 times [2024-11-19 09:57:55,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:57:55,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346742216] [2024-11-19 09:57:55,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:57:55,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:57:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:57:55,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:57:55,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:57:55,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346742216] [2024-11-19 09:57:55,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346742216] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:57:55,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902881860] [2024-11-19 09:57:55,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:57:55,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:57:55,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:57:55,417 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-19 09:57:55,420 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-19 09:57:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:57:55,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:57:55,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:57:55,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:57:55,622 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:57:55,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:57:55,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902881860] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:57:55,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:57:55,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-11-19 09:57:55,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604667053] [2024-11-19 09:57:55,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:57:55,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 09:57:55,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:57:55,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 09:57:55,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-19 09:57:55,713 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-11-19 09:57:55,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 127 flow. Second operand has 13 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:57:55,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:57:55,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-11-19 09:57:55,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:57:56,047 INFO L124 PetriNetUnfolderBase]: 140/279 cut-off events. [2024-11-19 09:57:56,047 INFO L125 PetriNetUnfolderBase]: For 196/196 co-relation queries the response was YES. [2024-11-19 09:57:56,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 787 conditions, 279 events. 140/279 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 896 event pairs, 21 based on Foata normal form. 5/267 useless extension candidates. Maximal degree in co-relation 458. Up to 65 conditions per place. [2024-11-19 09:57:56,053 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 48 selfloop transitions, 19 changer transitions 0/71 dead transitions. [2024-11-19 09:57:56,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 71 transitions, 376 flow [2024-11-19 09:57:56,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 09:57:56,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-19 09:57:56,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 149 transitions. [2024-11-19 09:57:56,057 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3952254641909814 [2024-11-19 09:57:56,057 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 127 flow. Second operand 13 states and 149 transitions. [2024-11-19 09:57:56,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 71 transitions, 376 flow [2024-11-19 09:57:56,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 71 transitions, 373 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:57:56,062 INFO L231 Difference]: Finished difference. Result has 52 places, 37 transitions, 212 flow [2024-11-19 09:57:56,062 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=212, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2024-11-19 09:57:56,063 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 23 predicate places. [2024-11-19 09:57:56,063 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 212 flow [2024-11-19 09:57:56,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:57:56,063 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:57:56,064 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:57:56,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 09:57:56,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:57:56,269 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-19 09:57:56,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:57:56,270 INFO L85 PathProgramCache]: Analyzing trace with hash 3331892, now seen corresponding path program 2 times [2024-11-19 09:57:56,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:57:56,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122044391] [2024-11-19 09:57:56,271 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:57:56,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:57:56,308 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:57:56,308 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:57:56,533 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:57:56,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:57:56,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122044391] [2024-11-19 09:57:56,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122044391] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:57:56,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74842240] [2024-11-19 09:57:56,535 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:57:56,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:57:56,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:57:56,538 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-19 09:57:56,539 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-19 09:57:56,598 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:57:56,598 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:57:56,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 09:57:56,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:57:56,755 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:57:56,755 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:57:56,868 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:57:56,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74842240] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:57:56,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:57:56,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2024-11-19 09:57:56,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596941348] [2024-11-19 09:57:56,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:57:56,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-19 09:57:56,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:57:56,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-19 09:57:56,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=268, Unknown=0, NotChecked=0, Total=420 [2024-11-19 09:57:56,931 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-19 09:57:56,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 212 flow. Second operand has 21 states, 21 states have (on average 9.523809523809524) internal successors, (200), 21 states have internal predecessors, (200), 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-19 09:57:56,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:57:56,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-19 09:57:56,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:57:57,337 INFO L124 PetriNetUnfolderBase]: 248/522 cut-off events. [2024-11-19 09:57:57,338 INFO L125 PetriNetUnfolderBase]: For 472/474 co-relation queries the response was YES. [2024-11-19 09:57:57,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1678 conditions, 522 events. 248/522 cut-off events. For 472/474 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2077 event pairs, 35 based on Foata normal form. 30/536 useless extension candidates. Maximal degree in co-relation 1348. Up to 104 conditions per place. [2024-11-19 09:57:57,343 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 87 selfloop transitions, 31 changer transitions 0/128 dead transitions. [2024-11-19 09:57:57,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 128 transitions, 787 flow [2024-11-19 09:57:57,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 09:57:57,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-19 09:57:57,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 289 transitions. [2024-11-19 09:57:57,346 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4745484400656814 [2024-11-19 09:57:57,346 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 212 flow. Second operand 21 states and 289 transitions. [2024-11-19 09:57:57,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 128 transitions, 787 flow [2024-11-19 09:57:57,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 128 transitions, 701 flow, removed 10 selfloop flow, removed 10 redundant places. [2024-11-19 09:57:57,354 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 379 flow [2024-11-19 09:57:57,355 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=379, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2024-11-19 09:57:57,356 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 40 predicate places. [2024-11-19 09:57:57,357 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 379 flow [2024-11-19 09:57:57,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.523809523809524) internal successors, (200), 21 states have internal predecessors, (200), 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-19 09:57:57,358 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:57:57,358 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:57:57,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 09:57:57,561 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,SelfDestructingSolverStorable3 [2024-11-19 09:57:57,562 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-19 09:57:57,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:57:57,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1491532552, now seen corresponding path program 1 times [2024-11-19 09:57:57,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:57:57,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820187473] [2024-11-19 09:57:57,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:57:57,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:57:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:57:57,603 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-19 09:57:57,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:57:57,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820187473] [2024-11-19 09:57:57,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820187473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:57:57,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:57:57,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:57:57,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505006308] [2024-11-19 09:57:57,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:57:57,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:57:57,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:57:57,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:57:57,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:57:57,606 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-19 09:57:57,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 379 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-19 09:57:57,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:57:57,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-19 09:57:57,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:57:57,671 INFO L124 PetriNetUnfolderBase]: 199/462 cut-off events. [2024-11-19 09:57:57,672 INFO L125 PetriNetUnfolderBase]: For 606/606 co-relation queries the response was YES. [2024-11-19 09:57:57,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1602 conditions, 462 events. 199/462 cut-off events. For 606/606 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1927 event pairs, 175 based on Foata normal form. 8/458 useless extension candidates. Maximal degree in co-relation 1418. Up to 383 conditions per place. [2024-11-19 09:57:57,677 INFO L140 encePairwiseOnDemand]: 27/29 looper letters, 23 selfloop transitions, 1 changer transitions 26/55 dead transitions. [2024-11-19 09:57:57,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 55 transitions, 463 flow [2024-11-19 09:57:57,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:57:57,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:57:57,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2024-11-19 09:57:57,681 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47126436781609193 [2024-11-19 09:57:57,681 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 379 flow. Second operand 3 states and 41 transitions. [2024-11-19 09:57:57,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 55 transitions, 463 flow [2024-11-19 09:57:57,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 55 transitions, 350 flow, removed 41 selfloop flow, removed 10 redundant places. [2024-11-19 09:57:57,691 INFO L231 Difference]: Finished difference. Result has 60 places, 29 transitions, 117 flow [2024-11-19 09:57:57,692 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=60, PETRI_TRANSITIONS=29} [2024-11-19 09:57:57,693 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 31 predicate places. [2024-11-19 09:57:57,694 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 29 transitions, 117 flow [2024-11-19 09:57:57,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-19 09:57:57,695 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:57:57,695 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:57:57,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 09:57:57,695 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-19 09:57:57,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:57:57,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1120744820, now seen corresponding path program 3 times [2024-11-19 09:57:57,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:57:57,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658974803] [2024-11-19 09:57:57,696 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:57:57,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:57:57,712 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 09:57:57,714 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:57:57,774 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-19 09:57:57,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:57:57,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658974803] [2024-11-19 09:57:57,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658974803] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:57:57,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853290694] [2024-11-19 09:57:57,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:57:57,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:57:57,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:57:57,777 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-19 09:57:57,779 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-19 09:57:57,838 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 09:57:57,839 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:57:57,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:57:57,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:57:57,876 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-19 09:57:57,876 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:57:57,920 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-19 09:57:57,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853290694] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:57:57,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:57:57,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2024-11-19 09:57:57,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862126415] [2024-11-19 09:57:57,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:57:57,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:57:57,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:57:57,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:57:57,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:57:57,931 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-11-19 09:57:57,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 29 transitions, 117 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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-19 09:57:57,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:57:57,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-11-19 09:57:57,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:57:58,057 INFO L124 PetriNetUnfolderBase]: 166/346 cut-off events. [2024-11-19 09:57:58,057 INFO L125 PetriNetUnfolderBase]: For 262/262 co-relation queries the response was YES. [2024-11-19 09:57:58,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 919 conditions, 346 events. 166/346 cut-off events. For 262/262 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1131 event pairs, 54 based on Foata normal form. 5/347 useless extension candidates. Maximal degree in co-relation 902. Up to 151 conditions per place. [2024-11-19 09:57:58,060 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 25 selfloop transitions, 2 changer transitions 31/60 dead transitions. [2024-11-19 09:57:58,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 60 transitions, 333 flow [2024-11-19 09:57:58,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:57:58,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:57:58,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2024-11-19 09:57:58,061 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4039408866995074 [2024-11-19 09:57:58,061 INFO L175 Difference]: Start difference. First operand has 60 places, 29 transitions, 117 flow. Second operand 7 states and 82 transitions. [2024-11-19 09:57:58,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 60 transitions, 333 flow [2024-11-19 09:57:58,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 60 transitions, 277 flow, removed 19 selfloop flow, removed 11 redundant places. [2024-11-19 09:57:58,064 INFO L231 Difference]: Finished difference. Result has 45 places, 26 transitions, 82 flow [2024-11-19 09:57:58,064 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=82, PETRI_PLACES=45, PETRI_TRANSITIONS=26} [2024-11-19 09:57:58,065 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 16 predicate places. [2024-11-19 09:57:58,065 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 26 transitions, 82 flow [2024-11-19 09:57:58,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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-19 09:57:58,065 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:57:58,065 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:57:58,083 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-19 09:57:58,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:57:58,270 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-19 09:57:58,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:57:58,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1963520340, now seen corresponding path program 1 times [2024-11-19 09:57:58,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:57:58,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845837564] [2024-11-19 09:57:58,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:57:58,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:57:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:57:58,508 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:57:58,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:57:58,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845837564] [2024-11-19 09:57:58,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845837564] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:57:58,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683144802] [2024-11-19 09:57:58,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:57:58,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:57:58,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:57:58,512 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-19 09:57:58,513 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-19 09:57:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:57:58,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 09:57:58,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:57:58,852 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:57:58,852 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:57:59,231 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:57:59,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683144802] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:57:59,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:57:59,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2024-11-19 09:57:59,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922195389] [2024-11-19 09:57:59,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:57:59,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-19 09:57:59,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:57:59,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-19 09:57:59,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1193, Unknown=0, NotChecked=0, Total=1560 [2024-11-19 09:57:59,245 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-11-19 09:57:59,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 26 transitions, 82 flow. Second operand has 40 states, 40 states have (on average 7.325) internal successors, (293), 40 states have internal predecessors, (293), 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-19 09:57:59,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:57:59,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-11-19 09:57:59,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:58:00,021 INFO L124 PetriNetUnfolderBase]: 142/299 cut-off events. [2024-11-19 09:58:00,021 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-11-19 09:58:00,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 299 events. 142/299 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 685 event pairs, 15 based on Foata normal form. 60/359 useless extension candidates. Maximal degree in co-relation 769. Up to 76 conditions per place. [2024-11-19 09:58:00,023 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 80 selfloop transitions, 25 changer transitions 0/107 dead transitions. [2024-11-19 09:58:00,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 107 transitions, 525 flow [2024-11-19 09:58:00,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-19 09:58:00,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-11-19 09:58:00,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 273 transitions. [2024-11-19 09:58:00,026 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3620689655172414 [2024-11-19 09:58:00,026 INFO L175 Difference]: Start difference. First operand has 45 places, 26 transitions, 82 flow. Second operand 26 states and 273 transitions. [2024-11-19 09:58:00,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 107 transitions, 525 flow [2024-11-19 09:58:00,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 107 transitions, 511 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-11-19 09:58:00,029 INFO L231 Difference]: Finished difference. Result has 68 places, 38 transitions, 240 flow [2024-11-19 09:58:00,029 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=240, PETRI_PLACES=68, PETRI_TRANSITIONS=38} [2024-11-19 09:58:00,030 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 39 predicate places. [2024-11-19 09:58:00,030 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 38 transitions, 240 flow [2024-11-19 09:58:00,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 7.325) internal successors, (293), 40 states have internal predecessors, (293), 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-19 09:58:00,030 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:58:00,031 INFO L204 CegarLoopForPetriNet]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:58:00,050 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-19 09:58:00,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:58:00,235 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-19 09:58:00,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:58:00,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1880608212, now seen corresponding path program 2 times [2024-11-19 09:58:00,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:58:00,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073479523] [2024-11-19 09:58:00,236 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:58:00,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:58:00,255 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:58:00,256 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:58:00,821 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:58:00,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:58:00,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073479523] [2024-11-19 09:58:00,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073479523] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:58:00,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363202164] [2024-11-19 09:58:00,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:58:00,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:58:00,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:58:00,825 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-19 09:58:00,829 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-19 09:58:00,894 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:58:00,894 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:58:00,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 09:58:00,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:58:01,647 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:58:01,647 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:58:02,658 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:58:02,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363202164] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:58:02,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:58:02,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 75 [2024-11-19 09:58:02,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841892326] [2024-11-19 09:58:02,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:58:02,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2024-11-19 09:58:02,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:58:02,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2024-11-19 09:58:02,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1441, Invalid=4259, Unknown=0, NotChecked=0, Total=5700 [2024-11-19 09:58:02,732 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-11-19 09:58:02,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 38 transitions, 240 flow. Second operand has 76 states, 76 states have (on average 7.171052631578948) internal successors, (545), 76 states have internal predecessors, (545), 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-19 09:58:02,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:58:02,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-11-19 09:58:02,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:58:04,983 INFO L124 PetriNetUnfolderBase]: 262/539 cut-off events. [2024-11-19 09:58:04,984 INFO L125 PetriNetUnfolderBase]: For 8311/8311 co-relation queries the response was YES. [2024-11-19 09:58:04,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1845 conditions, 539 events. 262/539 cut-off events. For 8311/8311 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1245 event pairs, 15 based on Foata normal form. 120/659 useless extension candidates. Maximal degree in co-relation 1825. Up to 196 conditions per place. [2024-11-19 09:58:04,988 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 152 selfloop transitions, 49 changer transitions 0/203 dead transitions. [2024-11-19 09:58:04,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 203 transitions, 1163 flow [2024-11-19 09:58:04,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-19 09:58:04,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2024-11-19 09:58:04,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 525 transitions. [2024-11-19 09:58:04,992 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3620689655172414 [2024-11-19 09:58:04,992 INFO L175 Difference]: Start difference. First operand has 68 places, 38 transitions, 240 flow. Second operand 50 states and 525 transitions. [2024-11-19 09:58:04,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 203 transitions, 1163 flow [2024-11-19 09:58:04,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 203 transitions, 1015 flow, removed 61 selfloop flow, removed 13 redundant places. [2024-11-19 09:58:05,002 INFO L231 Difference]: Finished difference. Result has 128 places, 62 transitions, 480 flow [2024-11-19 09:58:05,004 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=480, PETRI_PLACES=128, PETRI_TRANSITIONS=62} [2024-11-19 09:58:05,005 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 99 predicate places. [2024-11-19 09:58:05,006 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 62 transitions, 480 flow [2024-11-19 09:58:05,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 7.171052631578948) internal successors, (545), 76 states have internal predecessors, (545), 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-19 09:58:05,007 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:58:05,007 INFO L204 CegarLoopForPetriNet]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:58:05,024 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-19 09:58:05,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:58:05,208 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-19 09:58:05,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:58:05,209 INFO L85 PathProgramCache]: Analyzing trace with hash -324974892, now seen corresponding path program 3 times [2024-11-19 09:58:05,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:58:05,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229263733] [2024-11-19 09:58:05,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:58:05,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:58:05,254 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2024-11-19 09:58:05,254 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:58:06,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:58:06,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:58:06,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229263733] [2024-11-19 09:58:06,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229263733] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:58:06,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373898955] [2024-11-19 09:58:06,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:58:06,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:58:06,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:58:06,719 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-19 09:58:06,721 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-19 09:58:06,802 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2024-11-19 09:58:06,802 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:58:06,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-19 09:58:06,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:58:08,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:58:08,792 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:58:12,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:58:12,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373898955] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:58:12,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:58:12,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 147 [2024-11-19 09:58:12,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518887452] [2024-11-19 09:58:12,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:58:12,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 148 states [2024-11-19 09:58:12,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:58:12,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2024-11-19 09:58:12,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5749, Invalid=16007, Unknown=0, NotChecked=0, Total=21756 [2024-11-19 09:58:12,270 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-11-19 09:58:12,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 62 transitions, 480 flow. Second operand has 148 states, 148 states have (on average 7.087837837837838) internal successors, (1049), 148 states have internal predecessors, (1049), 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-19 09:58:12,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:58:12,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-11-19 09:58:12,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:58:18,851 INFO L124 PetriNetUnfolderBase]: 502/1019 cut-off events. [2024-11-19 09:58:18,851 INFO L125 PetriNetUnfolderBase]: For 154387/154387 co-relation queries the response was YES. [2024-11-19 09:58:18,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3669 conditions, 1019 events. 502/1019 cut-off events. For 154387/154387 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2365 event pairs, 15 based on Foata normal form. 240/1259 useless extension candidates. Maximal degree in co-relation 3625. Up to 376 conditions per place. [2024-11-19 09:58:18,858 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 296 selfloop transitions, 97 changer transitions 0/395 dead transitions. [2024-11-19 09:58:18,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 395 transitions, 2315 flow [2024-11-19 09:58:18,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2024-11-19 09:58:18,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2024-11-19 09:58:18,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 1029 transitions. [2024-11-19 09:58:18,863 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3620689655172414 [2024-11-19 09:58:18,863 INFO L175 Difference]: Start difference. First operand has 128 places, 62 transitions, 480 flow. Second operand 98 states and 1029 transitions. [2024-11-19 09:58:18,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 395 transitions, 2315 flow [2024-11-19 09:58:18,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 395 transitions, 2023 flow, removed 121 selfloop flow, removed 25 redundant places. [2024-11-19 09:58:18,906 INFO L231 Difference]: Finished difference. Result has 248 places, 110 transitions, 960 flow [2024-11-19 09:58:18,906 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=98, PETRI_FLOW=960, PETRI_PLACES=248, PETRI_TRANSITIONS=110} [2024-11-19 09:58:18,907 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 219 predicate places. [2024-11-19 09:58:18,907 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 110 transitions, 960 flow [2024-11-19 09:58:18,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 148 states, 148 states have (on average 7.087837837837838) internal successors, (1049), 148 states have internal predecessors, (1049), 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-19 09:58:18,908 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:58:18,908 INFO L204 CegarLoopForPetriNet]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:58:18,925 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-19 09:58:19,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:58:19,113 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-19 09:58:19,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:58:19,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1659058388, now seen corresponding path program 4 times [2024-11-19 09:58:19,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:58:19,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648895267] [2024-11-19 09:58:19,114 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:58:19,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:58:19,213 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:58:19,214 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:58:23,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:58:23,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:58:23,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648895267] [2024-11-19 09:58:23,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648895267] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:58:23,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236295383] [2024-11-19 09:58:23,888 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:58:23,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:58:23,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:58:23,890 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:58:23,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 09:58:23,992 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:58:23,992 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:58:23,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-11-19 09:58:23,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:58:30,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:58:30,970 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:58:41,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:58:41,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236295383] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:58:41,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:58:41,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 291 [2024-11-19 09:58:41,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292170331] [2024-11-19 09:58:41,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:58:41,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 292 states [2024-11-19 09:58:41,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:58:41,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 292 interpolants. [2024-11-19 09:58:41,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19087, Invalid=65885, Unknown=0, NotChecked=0, Total=84972 [2024-11-19 09:58:41,361 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-11-19 09:58:41,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 110 transitions, 960 flow. Second operand has 292 states, 292 states have (on average 7.044520547945205) internal successors, (2057), 292 states have internal predecessors, (2057), 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-19 09:58:41,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:58:41,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-11-19 09:58:41,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:58:51,838 INFO L124 PetriNetUnfolderBase]: 537/1089 cut-off events. [2024-11-19 09:58:51,839 INFO L125 PetriNetUnfolderBase]: For 139340/139340 co-relation queries the response was YES. [2024-11-19 09:58:51,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4202 conditions, 1089 events. 537/1089 cut-off events. For 139340/139340 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2529 event pairs, 15 based on Foata normal form. 35/1124 useless extension candidates. Maximal degree in co-relation 4110. Up to 291 conditions per place. [2024-11-19 09:58:51,848 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 317 selfloop transitions, 104 changer transitions 0/423 dead transitions. [2024-11-19 09:58:51,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 423 transitions, 2572 flow [2024-11-19 09:58:51,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-11-19 09:58:51,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2024-11-19 09:58:51,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 1058 transitions. [2024-11-19 09:58:51,851 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3474548440065681 [2024-11-19 09:58:51,851 INFO L175 Difference]: Start difference. First operand has 248 places, 110 transitions, 960 flow. Second operand 105 states and 1058 transitions. [2024-11-19 09:58:51,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 423 transitions, 2572 flow [2024-11-19 09:58:52,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 423 transitions, 2170 flow, removed 152 selfloop flow, removed 49 redundant places. [2024-11-19 09:58:52,027 INFO L231 Difference]: Finished difference. Result has 310 places, 117 transitions, 852 flow [2024-11-19 09:58:52,028 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=105, PETRI_FLOW=852, PETRI_PLACES=310, PETRI_TRANSITIONS=117} [2024-11-19 09:58:52,029 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 281 predicate places. [2024-11-19 09:58:52,029 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 117 transitions, 852 flow [2024-11-19 09:58:52,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 292 states, 292 states have (on average 7.044520547945205) internal successors, (2057), 292 states have internal predecessors, (2057), 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-19 09:58:52,030 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:58:52,030 INFO L204 CegarLoopForPetriNet]: trace histogram [101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:58:52,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 09:58:52,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:58:52,231 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-19 09:58:52,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:58:52,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1932068742, now seen corresponding path program 5 times [2024-11-19 09:58:52,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:58:52,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235460423] [2024-11-19 09:58:52,232 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 09:58:52,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:58:52,348 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 52 check-sat command(s) [2024-11-19 09:58:52,349 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 09:58:52,349 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:58:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:58:52,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 09:58:52,460 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:58:52,461 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2024-11-19 09:58:52,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2024-11-19 09:58:52,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-19 09:58:52,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-19 09:58:52,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2024-11-19 09:58:52,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 09:58:52,464 INFO L407 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1] [2024-11-19 09:58:52,606 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:58:52,606 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:58:52,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:58:52 BasicIcfg [2024-11-19 09:58:52,610 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:58:52,611 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:58:52,611 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:58:52,611 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:58:52,611 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:57:54" (3/4) ... [2024-11-19 09:58:52,613 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 09:58:52,614 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:58:52,614 INFO L158 Benchmark]: Toolchain (without parser) took 59729.44ms. Allocated memory was 140.5MB in the beginning and 780.1MB in the end (delta: 639.6MB). Free memory was 94.4MB in the beginning and 372.3MB in the end (delta: -277.8MB). Peak memory consumption was 361.2MB. Max. memory is 16.1GB. [2024-11-19 09:58:52,615 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory is still 67.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:58:52,615 INFO L158 Benchmark]: CACSL2BoogieTranslator took 559.75ms. Allocated memory is still 140.5MB. Free memory was 94.1MB in the beginning and 71.8MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-19 09:58:52,615 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.41ms. Allocated memory is still 140.5MB. Free memory was 71.8MB in the beginning and 69.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:58:52,615 INFO L158 Benchmark]: Boogie Preprocessor took 50.68ms. Allocated memory is still 140.5MB. Free memory was 69.7MB in the beginning and 67.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:58:52,615 INFO L158 Benchmark]: RCFGBuilder took 482.37ms. Allocated memory is still 140.5MB. Free memory was 67.6MB in the beginning and 94.1MB in the end (delta: -26.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 09:58:52,616 INFO L158 Benchmark]: TraceAbstraction took 58576.78ms. Allocated memory was 140.5MB in the beginning and 780.1MB in the end (delta: 639.6MB). Free memory was 93.4MB in the beginning and 372.3MB in the end (delta: -278.9MB). Peak memory consumption was 362.2MB. Max. memory is 16.1GB. [2024-11-19 09:58:52,616 INFO L158 Benchmark]: Witness Printer took 3.21ms. Allocated memory is still 780.1MB. Free memory is still 372.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:58:52,617 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.17ms. Allocated memory is still 100.7MB. Free memory is still 67.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 559.75ms. Allocated memory is still 140.5MB. Free memory was 94.1MB in the beginning and 71.8MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.41ms. Allocated memory is still 140.5MB. Free memory was 71.8MB in the beginning and 69.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.68ms. Allocated memory is still 140.5MB. Free memory was 69.7MB in the beginning and 67.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 482.37ms. Allocated memory is still 140.5MB. Free memory was 67.6MB in the beginning and 94.1MB in the end (delta: -26.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 58576.78ms. Allocated memory was 140.5MB in the beginning and 780.1MB in the end (delta: 639.6MB). Free memory was 93.4MB in the beginning and 372.3MB in the end (delta: -278.9MB). Peak memory consumption was 362.2MB. Max. memory is 16.1GB. * Witness Printer took 3.21ms. Allocated memory is still 780.1MB. Free memory is still 372.3MB. 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=-2] [L776] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=0, t1=-2, t2=-1] [L757] COND FALSE 1 !(__VERIFIER_nondet_int()) [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) [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: 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 43 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: 58.3s, OverallIterations: 11, TraceHistogramMax: 101, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 22.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6541 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6531 mSDsluCounter, 357 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 354 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4038 IncrementalHoareTripleChecker+Invalid, 4059 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 3 mSDtfsCounter, 4038 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1040 GetRequests, 150 SyntacticMatches, 5 SemanticMatches, 885 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50598 ImplicationChecksByTransitivity, 43.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=960occurred in iteration=9, InterpolantAutomatonStates: 334, 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.5s SatisfiabilityAnalysisTime, 33.4s InterpolantComputationTime, 691 NumberOfCodeBlocks, 675 NumberOfCodeBlocksAsserted, 123 NumberOfCheckSat, 825 ConstructedInterpolants, 0 QuantifiedInterpolants, 3799 SizeOfPredicates, 29 NumberOfNonLiveVariables, 1094 ConjunctsInSsa, 214 ConjunctsInUnsatCore, 24 InterpolantComputations, 3 PerfectInterpolantSequences, 136/17761 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-19 09:58:52,650 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.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:58:54,684 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:58:54,756 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 09:58:54,760 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:58:54,761 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:58:54,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:58:54,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:58:54,792 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:58:54,792 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:58:54,793 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:58:54,793 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:58:54,794 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:58:54,794 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:58:54,796 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:58:54,796 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:58:54,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:58:54,797 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:58:54,797 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:58:54,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:58:54,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:58:54,798 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:58:54,802 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:58:54,803 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:58:54,803 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:58:54,803 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:58:54,803 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 09:58:54,804 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:58:54,804 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 09:58:54,804 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:58:54,804 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:58:54,804 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:58:54,805 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:58:54,805 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:58:54,805 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:58:54,805 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:58:54,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:58:54,806 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:58:54,806 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:58:54,808 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 09:58:54,808 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 09:58:54,808 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:58:54,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:58:54,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:58:54,809 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:58:54,809 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-19 09:58:55,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:58:55,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:58:55,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:58:55,145 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:58:55,145 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:58:55,146 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-19 09:58:56,698 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:58:56,930 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:58:56,931 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-100.i [2024-11-19 09:58:56,944 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/220c48d82/f0fad0cac8d34bd9b2d5123d8c7d9085/FLAG902f01b4a [2024-11-19 09:58:57,252 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/220c48d82/f0fad0cac8d34bd9b2d5123d8c7d9085 [2024-11-19 09:58:57,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:58:57,255 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:58:57,256 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:58:57,256 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:58:57,259 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:58:57,260 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:58:57" (1/1) ... [2024-11-19 09:58:57,260 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53033d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:57, skipping insertion in model container [2024-11-19 09:58:57,261 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:58:57" (1/1) ... [2024-11-19 09:58:57,291 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:58:57,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:58:57,675 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:58:57,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:58:57,777 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:58:57,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:57 WrapperNode [2024-11-19 09:58:57,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:58:57,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:58:57,780 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:58:57,780 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:58:57,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:57" (1/1) ... [2024-11-19 09:58:57,809 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:57" (1/1) ... [2024-11-19 09:58:57,835 INFO L138 Inliner]: procedures = 170, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 57 [2024-11-19 09:58:57,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:58:57,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:58:57,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:58:57,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:58:57,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:57" (1/1) ... [2024-11-19 09:58:57,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:57" (1/1) ... [2024-11-19 09:58:57,851 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:57" (1/1) ... [2024-11-19 09:58:57,868 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-19 09:58:57,869 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:57" (1/1) ... [2024-11-19 09:58:57,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:57" (1/1) ... [2024-11-19 09:58:57,880 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:57" (1/1) ... [2024-11-19 09:58:57,884 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:57" (1/1) ... [2024-11-19 09:58:57,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:57" (1/1) ... [2024-11-19 09:58:57,891 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:57" (1/1) ... [2024-11-19 09:58:57,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:58:57,895 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:58:57,895 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:58:57,895 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:58:57,896 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:57" (1/1) ... [2024-11-19 09:58:57,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:58:57,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:58:57,932 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-19 09:58:57,936 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-19 09:58:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:58:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-19 09:58:57,981 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-19 09:58:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-19 09:58:57,981 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-19 09:58:57,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 09:58:57,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:58:57,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:58:57,983 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:58:58,108 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:58:58,110 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:58:58,257 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:58:58,257 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:58:58,410 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:58:58,411 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 09:58:58,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:58:58 BoogieIcfgContainer [2024-11-19 09:58:58,411 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:58:58,413 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:58:58,413 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:58:58,417 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:58:58,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:58:57" (1/3) ... [2024-11-19 09:58:58,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bfd975f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:58:58, skipping insertion in model container [2024-11-19 09:58:58,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:57" (2/3) ... [2024-11-19 09:58:58,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bfd975f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:58:58, skipping insertion in model container [2024-11-19 09:58:58,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:58:58" (3/3) ... [2024-11-19 09:58:58,421 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind1-100.i [2024-11-19 09:58:58,436 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:58:58,436 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 09:58:58,436 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:58:58,486 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 09:58:58,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 72 flow [2024-11-19 09:58:58,536 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2024-11-19 09:58:58,539 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 09:58:58,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 4/27 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/21 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2024-11-19 09:58:58,541 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 72 flow [2024-11-19 09:58:58,544 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 64 flow [2024-11-19 09:58:58,555 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:58:58,562 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;@f22ff08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:58:58,562 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-19 09:58:58,585 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:58:58,586 INFO L124 PetriNetUnfolderBase]: 4/21 cut-off events. [2024-11-19 09:58:58,586 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 09:58:58,586 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:58:58,587 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:58:58,587 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-19 09:58:58,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:58:58,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1073741351, now seen corresponding path program 1 times [2024-11-19 09:58:58,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:58:58,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [761261126] [2024-11-19 09:58:58,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:58:58,604 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-19 09:58:58,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:58:58,606 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-19 09:58:58,607 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-19 09:58:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:58:58,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:58:58,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:58:58,793 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-19 09:58:58,793 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:58:58,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:58:58,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [761261126] [2024-11-19 09:58:58,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [761261126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:58:58,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:58:58,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:58:58,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002149618] [2024-11-19 09:58:58,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:58:58,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:58:58,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:58:58,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:58:58,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:58:58,841 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-11-19 09:58:58,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-19 09:58:58,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:58:58,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-11-19 09:58:58,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:58:58,982 INFO L124 PetriNetUnfolderBase]: 124/273 cut-off events. [2024-11-19 09:58:58,982 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-19 09:58:58,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 273 events. 124/273 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1167 event pairs, 68 based on Foata normal form. 33/265 useless extension candidates. Maximal degree in co-relation 460. Up to 146 conditions per place. [2024-11-19 09:58:58,987 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 27 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2024-11-19 09:58:58,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 39 transitions, 163 flow [2024-11-19 09:58:58,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:58:58,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:58:58,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2024-11-19 09:58:58,996 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2024-11-19 09:58:58,997 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 64 flow. Second operand 5 states and 80 transitions. [2024-11-19 09:58:58,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 39 transitions, 163 flow [2024-11-19 09:58:59,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 39 transitions, 149 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:58:59,002 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 80 flow [2024-11-19 09:58:59,004 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=30, PETRI_TRANSITIONS=26} [2024-11-19 09:58:59,008 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2024-11-19 09:58:59,009 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 80 flow [2024-11-19 09:58:59,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-19 09:58:59,009 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:58:59,009 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:58:59,013 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-19 09:58:59,209 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-19 09:58:59,210 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-19 09:58:59,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:58:59,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1072770645, now seen corresponding path program 1 times [2024-11-19 09:58:59,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:58:59,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [797669754] [2024-11-19 09:58:59,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:58:59,218 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-19 09:58:59,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:58:59,221 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-19 09:58:59,222 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-19 09:58:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:58:59,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:58:59,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:58:59,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:58:59,318 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:58:59,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:58:59,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [797669754] [2024-11-19 09:58:59,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [797669754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:58:59,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:58:59,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:58:59,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462143275] [2024-11-19 09:58:59,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:58:59,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:58:59,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:58:59,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:58:59,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:58:59,325 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-11-19 09:58:59,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-19 09:58:59,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:58:59,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-11-19 09:58:59,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:58:59,461 INFO L124 PetriNetUnfolderBase]: 111/247 cut-off events. [2024-11-19 09:58:59,461 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2024-11-19 09:58:59,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 247 events. 111/247 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 934 event pairs, 30 based on Foata normal form. 13/245 useless extension candidates. Maximal degree in co-relation 260. Up to 97 conditions per place. [2024-11-19 09:58:59,466 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 33 selfloop transitions, 6 changer transitions 0/44 dead transitions. [2024-11-19 09:58:59,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 44 transitions, 216 flow [2024-11-19 09:58:59,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:58:59,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:58:59,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2024-11-19 09:58:59,468 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.503448275862069 [2024-11-19 09:58:59,468 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 80 flow. Second operand 5 states and 73 transitions. [2024-11-19 09:58:59,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 44 transitions, 216 flow [2024-11-19 09:58:59,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 44 transitions, 211 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:58:59,473 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 111 flow [2024-11-19 09:58:59,473 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2024-11-19 09:58:59,474 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2024-11-19 09:58:59,474 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 111 flow [2024-11-19 09:58:59,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-19 09:58:59,474 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:58:59,475 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:58:59,478 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-19 09:58:59,679 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-19 09:58:59,679 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-19 09:58:59,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:58:59,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1251716570, now seen corresponding path program 1 times [2024-11-19 09:58:59,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:58:59,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097027337] [2024-11-19 09:58:59,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:58:59,680 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-19 09:58:59,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:58:59,682 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-19 09:58:59,683 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-19 09:58:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:58:59,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:58:59,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:58:59,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:58:59,808 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:58:59,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:58:59,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:58:59,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097027337] [2024-11-19 09:58:59,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2097027337] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:58:59,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:58:59,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-11-19 09:58:59,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310094073] [2024-11-19 09:58:59,886 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:58:59,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 09:58:59,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:58:59,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 09:58:59,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:58:59,914 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-11-19 09:58:59,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 111 flow. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:58:59,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:58:59,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-11-19 09:58:59,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:59:00,271 INFO L124 PetriNetUnfolderBase]: 163/372 cut-off events. [2024-11-19 09:59:00,272 INFO L125 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2024-11-19 09:59:00,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 372 events. 163/372 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1626 event pairs, 63 based on Foata normal form. 10/362 useless extension candidates. Maximal degree in co-relation 554. Up to 93 conditions per place. [2024-11-19 09:59:00,275 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 52 selfloop transitions, 13 changer transitions 0/70 dead transitions. [2024-11-19 09:59:00,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 70 transitions, 375 flow [2024-11-19 09:59:00,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 09:59:00,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 09:59:00,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2024-11-19 09:59:00,278 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.445141065830721 [2024-11-19 09:59:00,278 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 111 flow. Second operand 11 states and 142 transitions. [2024-11-19 09:59:00,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 70 transitions, 375 flow [2024-11-19 09:59:00,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 70 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:59:00,281 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 196 flow [2024-11-19 09:59:00,282 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=196, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2024-11-19 09:59:00,282 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 21 predicate places. [2024-11-19 09:59:00,283 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 196 flow [2024-11-19 09:59:00,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:59:00,283 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:59:00,283 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:59:00,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 09:59:00,486 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-19 09:59:00,486 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-19 09:59:00,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:59:00,487 INFO L85 PathProgramCache]: Analyzing trace with hash 82878036, now seen corresponding path program 1 times [2024-11-19 09:59:00,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:59:00,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443049352] [2024-11-19 09:59:00,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:59:00,488 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-19 09:59:00,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:59:00,489 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-19 09:59:00,490 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-19 09:59:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:59:00,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:59:00,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:59:00,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:59:00,629 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:59:00,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:59:00,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:59:00,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443049352] [2024-11-19 09:59:00,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [443049352] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:59:00,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:59:00,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-19 09:59:00,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156106569] [2024-11-19 09:59:00,748 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:59:00,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 09:59:00,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:59:00,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 09:59:00,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-19 09:59:00,757 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-11-19 09:59:00,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 196 flow. Second operand has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 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-19 09:59:00,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:59:00,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-11-19 09:59:00,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:59:01,308 INFO L124 PetriNetUnfolderBase]: 183/412 cut-off events. [2024-11-19 09:59:01,308 INFO L125 PetriNetUnfolderBase]: For 587/587 co-relation queries the response was YES. [2024-11-19 09:59:01,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1257 conditions, 412 events. 183/412 cut-off events. For 587/587 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1735 event pairs, 66 based on Foata normal form. 20/422 useless extension candidates. Maximal degree in co-relation 925. Up to 103 conditions per place. [2024-11-19 09:59:01,311 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 62 selfloop transitions, 16 changer transitions 0/83 dead transitions. [2024-11-19 09:59:01,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 83 transitions, 513 flow [2024-11-19 09:59:01,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 09:59:01,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-19 09:59:01,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 173 transitions. [2024-11-19 09:59:01,313 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.42610837438423643 [2024-11-19 09:59:01,313 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 196 flow. Second operand 14 states and 173 transitions. [2024-11-19 09:59:01,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 83 transitions, 513 flow [2024-11-19 09:59:01,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 83 transitions, 466 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-11-19 09:59:01,321 INFO L231 Difference]: Finished difference. Result has 62 places, 40 transitions, 223 flow [2024-11-19 09:59:01,321 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=223, PETRI_PLACES=62, PETRI_TRANSITIONS=40} [2024-11-19 09:59:01,321 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 33 predicate places. [2024-11-19 09:59:01,322 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 40 transitions, 223 flow [2024-11-19 09:59:01,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 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-19 09:59:01,322 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:59:01,322 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:59:01,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-19 09:59:01,522 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-19 09:59:01,523 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-19 09:59:01,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:59:01,523 INFO L85 PathProgramCache]: Analyzing trace with hash 3331892, now seen corresponding path program 2 times [2024-11-19 09:59:01,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:59:01,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [176203613] [2024-11-19 09:59:01,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:59:01,524 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-19 09:59:01,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:59:01,527 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-19 09:59:01,528 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-19 09:59:01,586 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:59:01,586 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:59:01,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 09:59:01,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:59:01,689 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:59:01,689 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:59:01,851 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:59:01,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:59:01,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [176203613] [2024-11-19 09:59:01,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [176203613] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:59:01,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:59:01,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-11-19 09:59:01,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147124189] [2024-11-19 09:59:01,852 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:59:01,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 09:59:01,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:59:01,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 09:59:01,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-19 09:59:01,986 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-19 09:59:01,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 40 transitions, 223 flow. Second operand has 16 states, 16 states have (on average 9.625) internal successors, (154), 16 states have internal predecessors, (154), 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-19 09:59:01,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:59:01,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-19 09:59:01,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:59:02,673 INFO L124 PetriNetUnfolderBase]: 391/846 cut-off events. [2024-11-19 09:59:02,674 INFO L125 PetriNetUnfolderBase]: For 2081/2089 co-relation queries the response was YES. [2024-11-19 09:59:02,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2712 conditions, 846 events. 391/846 cut-off events. For 2081/2089 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4100 event pairs, 61 based on Foata normal form. 58/888 useless extension candidates. Maximal degree in co-relation 1995. Up to 165 conditions per place. [2024-11-19 09:59:02,681 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 88 selfloop transitions, 40 changer transitions 0/136 dead transitions. [2024-11-19 09:59:02,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 136 transitions, 864 flow [2024-11-19 09:59:02,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 09:59:02,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-19 09:59:02,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 289 transitions. [2024-11-19 09:59:02,684 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4745484400656814 [2024-11-19 09:59:02,684 INFO L175 Difference]: Start difference. First operand has 62 places, 40 transitions, 223 flow. Second operand 21 states and 289 transitions. [2024-11-19 09:59:02,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 136 transitions, 864 flow [2024-11-19 09:59:02,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 136 transitions, 806 flow, removed 17 selfloop flow, removed 9 redundant places. [2024-11-19 09:59:02,698 INFO L231 Difference]: Finished difference. Result has 80 places, 63 transitions, 499 flow [2024-11-19 09:59:02,698 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=499, PETRI_PLACES=80, PETRI_TRANSITIONS=63} [2024-11-19 09:59:02,699 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 51 predicate places. [2024-11-19 09:59:02,699 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 63 transitions, 499 flow [2024-11-19 09:59:02,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.625) internal successors, (154), 16 states have internal predecessors, (154), 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-19 09:59:02,699 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:59:02,699 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:59:02,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 09:59:02,899 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-19 09:59:02,900 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-19 09:59:02,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:59:02,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1250730172, now seen corresponding path program 1 times [2024-11-19 09:59:02,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:59:02,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305608303] [2024-11-19 09:59:02,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:59:02,901 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-19 09:59:02,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:59:02,905 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-19 09:59:02,906 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-19 09:59:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:59:02,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:59:02,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:59:02,978 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-19 09:59:02,978 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:59:02,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:59:02,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305608303] [2024-11-19 09:59:02,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [305608303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:59:02,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:59:02,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:59:02,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790952463] [2024-11-19 09:59:02,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:59:02,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:59:02,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:59:02,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:59:02,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:59:02,982 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-19 09:59:02,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 63 transitions, 499 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-19 09:59:02,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:59:02,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-19 09:59:02,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:59:03,071 INFO L124 PetriNetUnfolderBase]: 313/752 cut-off events. [2024-11-19 09:59:03,071 INFO L125 PetriNetUnfolderBase]: For 2972/2972 co-relation queries the response was YES. [2024-11-19 09:59:03,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2829 conditions, 752 events. 313/752 cut-off events. For 2972/2972 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3893 event pairs, 303 based on Foata normal form. 14/748 useless extension candidates. Maximal degree in co-relation 2559. Up to 636 conditions per place. [2024-11-19 09:59:03,075 INFO L140 encePairwiseOnDemand]: 27/29 looper letters, 35 selfloop transitions, 1 changer transitions 21/62 dead transitions. [2024-11-19 09:59:03,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 62 transitions, 603 flow [2024-11-19 09:59:03,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:59:03,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:59:03,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2024-11-19 09:59:03,076 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47126436781609193 [2024-11-19 09:59:03,077 INFO L175 Difference]: Start difference. First operand has 80 places, 63 transitions, 499 flow. Second operand 3 states and 41 transitions. [2024-11-19 09:59:03,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 62 transitions, 603 flow [2024-11-19 09:59:03,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 62 transitions, 402 flow, removed 80 selfloop flow, removed 13 redundant places. [2024-11-19 09:59:03,091 INFO L231 Difference]: Finished difference. Result has 68 places, 41 transitions, 189 flow [2024-11-19 09:59:03,091 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=189, PETRI_PLACES=68, PETRI_TRANSITIONS=41} [2024-11-19 09:59:03,093 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 39 predicate places. [2024-11-19 09:59:03,093 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 41 transitions, 189 flow [2024-11-19 09:59:03,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-19 09:59:03,093 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:59:03,093 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:59:03,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 09:59:03,293 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-19 09:59:03,294 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-19 09:59:03,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:59:03,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1120744820, now seen corresponding path program 3 times [2024-11-19 09:59:03,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:59:03,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722038937] [2024-11-19 09:59:03,295 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:59:03,295 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-19 09:59:03,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:59:03,297 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-19 09:59:03,297 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-19 09:59:03,343 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 09:59:03,343 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:59:03,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 09:59:03,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:59:03,492 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-19 09:59:03,492 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:59:03,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:59:03,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [722038937] [2024-11-19 09:59:03,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [722038937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:59:03,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:59:03,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:59:03,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093904825] [2024-11-19 09:59:03,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:59:03,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:59:03,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:59:03,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:59:03,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:59:03,507 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-11-19 09:59:03,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 41 transitions, 189 flow. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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-19 09:59:03,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:59:03,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-11-19 09:59:03,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:59:03,629 INFO L124 PetriNetUnfolderBase]: 156/336 cut-off events. [2024-11-19 09:59:03,629 INFO L125 PetriNetUnfolderBase]: For 286/286 co-relation queries the response was YES. [2024-11-19 09:59:03,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 942 conditions, 336 events. 156/336 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1118 event pairs, 80 based on Foata normal form. 5/337 useless extension candidates. Maximal degree in co-relation 922. Up to 176 conditions per place. [2024-11-19 09:59:03,631 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 23 selfloop transitions, 1 changer transitions 26/53 dead transitions. [2024-11-19 09:59:03,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 53 transitions, 319 flow [2024-11-19 09:59:03,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:59:03,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:59:03,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2024-11-19 09:59:03,632 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.41954022988505746 [2024-11-19 09:59:03,632 INFO L175 Difference]: Start difference. First operand has 68 places, 41 transitions, 189 flow. Second operand 6 states and 73 transitions. [2024-11-19 09:59:03,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 53 transitions, 319 flow [2024-11-19 09:59:03,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 263 flow, removed 17 selfloop flow, removed 15 redundant places. [2024-11-19 09:59:03,634 INFO L231 Difference]: Finished difference. Result has 48 places, 27 transitions, 90 flow [2024-11-19 09:59:03,635 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=41, 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=6, PETRI_FLOW=90, PETRI_PLACES=48, PETRI_TRANSITIONS=27} [2024-11-19 09:59:03,635 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 19 predicate places. [2024-11-19 09:59:03,635 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 27 transitions, 90 flow [2024-11-19 09:59:03,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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-19 09:59:03,636 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:59:03,636 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:59:03,641 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 (8)] Forceful destruction successful, exit code 0 [2024-11-19 09:59:03,836 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-19 09:59:03,837 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-19 09:59:03,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:59:03,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1963520340, now seen corresponding path program 2 times [2024-11-19 09:59:03,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:59:03,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162851280] [2024-11-19 09:59:03,838 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:59:03,838 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-19 09:59:03,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:59:03,841 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-19 09:59:03,842 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-19 09:59:03,889 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:59:03,889 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:59:03,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 09:59:03,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:59:04,108 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:59:04,108 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:59:04,541 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:59:04,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:59:04,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162851280] [2024-11-19 09:59:04,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1162851280] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:59:04,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:59:04,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2024-11-19 09:59:04,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299074610] [2024-11-19 09:59:04,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:59:04,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-19 09:59:04,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:59:04,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-19 09:59:04,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=558, Unknown=0, NotChecked=0, Total=756 [2024-11-19 09:59:04,921 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-19 09:59:04,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 27 transitions, 90 flow. Second operand has 28 states, 28 states have (on average 9.357142857142858) internal successors, (262), 28 states have internal predecessors, (262), 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-19 09:59:04,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:59:04,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-19 09:59:04,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:59:06,743 INFO L124 PetriNetUnfolderBase]: 264/545 cut-off events. [2024-11-19 09:59:06,744 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2024-11-19 09:59:06,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1463 conditions, 545 events. 264/545 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1869 event pairs, 24 based on Foata normal form. 60/603 useless extension candidates. Maximal degree in co-relation 1453. Up to 136 conditions per place. [2024-11-19 09:59:06,750 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 77 selfloop transitions, 24 changer transitions 64/168 dead transitions. [2024-11-19 09:59:06,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 168 transitions, 857 flow [2024-11-19 09:59:06,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-19 09:59:06,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2024-11-19 09:59:06,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 481 transitions. [2024-11-19 09:59:06,753 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4364791288566243 [2024-11-19 09:59:06,753 INFO L175 Difference]: Start difference. First operand has 48 places, 27 transitions, 90 flow. Second operand 38 states and 481 transitions. [2024-11-19 09:59:06,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 168 transitions, 857 flow [2024-11-19 09:59:06,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 168 transitions, 816 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-11-19 09:59:06,757 INFO L231 Difference]: Finished difference. Result has 95 places, 38 transitions, 263 flow [2024-11-19 09:59:06,757 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=263, PETRI_PLACES=95, PETRI_TRANSITIONS=38} [2024-11-19 09:59:06,757 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 66 predicate places. [2024-11-19 09:59:06,758 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 38 transitions, 263 flow [2024-11-19 09:59:06,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.357142857142858) internal successors, (262), 28 states have internal predecessors, (262), 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-19 09:59:06,758 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:59:06,758 INFO L204 CegarLoopForPetriNet]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:59:06,763 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-19 09:59:06,959 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-19 09:59:06,960 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-19 09:59:06,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:59:06,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1880608212, now seen corresponding path program 3 times [2024-11-19 09:59:06,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:59:06,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816416292] [2024-11-19 09:59:06,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:59:06,965 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-19 09:59:06,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:59:06,968 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-19 09:59:06,972 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-19 09:59:07,055 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-11-19 09:59:07,055 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:59:07,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-19 09:59:07,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:59:07,778 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:59:07,778 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:59:09,211 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:59:09,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:59:09,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816416292] [2024-11-19 09:59:09,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816416292] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:59:09,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:59:09,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2024-11-19 09:59:09,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260856608] [2024-11-19 09:59:09,212 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:59:09,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-19 09:59:09,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:59:09,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-19 09:59:09,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=709, Invalid=2153, Unknown=0, NotChecked=0, Total=2862 [2024-11-19 09:59:09,252 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-11-19 09:59:09,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 38 transitions, 263 flow. Second operand has 54 states, 54 states have (on average 7.185185185185185) internal successors, (388), 54 states have internal predecessors, (388), 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-19 09:59:09,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:59:09,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-11-19 09:59:09,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand