./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-theta/unwind2-1.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/unwind2-1.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 84506b1a5f2f1a1be74252915eb3882c15865a3a673842f14f5796dbb89eb736 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:57:52,312 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:57:52,376 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:52,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:57:52,382 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:57:52,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:57:52,412 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:57:52,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:57:52,428 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:57:52,429 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:57:52,429 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:57:52,429 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:57:52,430 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:57:52,432 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:57:52,432 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:57:52,433 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:57:52,433 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:57:52,433 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:57:52,433 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:57:52,434 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:57:52,434 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:57:52,437 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:57:52,437 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:57:52,437 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:57:52,437 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:57:52,438 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:57:52,438 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:57:52,438 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:57:52,438 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:57:52,438 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:57:52,439 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:57:52,439 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:57:52,439 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:57:52,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:57:52,439 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:57:52,439 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:57:52,440 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:57:52,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:57:52,440 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:57:52,440 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:57:52,440 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:57:52,441 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:57:52,441 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 -> 84506b1a5f2f1a1be74252915eb3882c15865a3a673842f14f5796dbb89eb736 [2024-11-19 09:57:52,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:57:52,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:57:52,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:57:52,684 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:57:52,684 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:57:52,685 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind2-1.i [2024-11-19 09:57:54,178 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:57:54,442 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:57:54,443 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind2-1.i [2024-11-19 09:57:54,463 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2a0dd753/12dbd8a8500c4056b14cfa6f4d1b01da/FLAGa716f0bec [2024-11-19 09:57:54,479 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2a0dd753/12dbd8a8500c4056b14cfa6f4d1b01da [2024-11-19 09:57:54,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:57:54,482 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:57:54,484 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:57:54,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:57:54,490 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:57:54,490 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:57:54" (1/1) ... [2024-11-19 09:57:54,491 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c87eaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:57:54, skipping insertion in model container [2024-11-19 09:57:54,491 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:57:54" (1/1) ... [2024-11-19 09:57:54,537 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:57:54,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:57:54,852 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:57:54,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:57:54,934 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:57:54,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:57:54 WrapperNode [2024-11-19 09:57:54,935 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:57:54,935 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:57:54,936 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:57:54,936 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:57:54,941 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:54" (1/1) ... [2024-11-19 09:57:54,959 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:54" (1/1) ... [2024-11-19 09:57:54,984 INFO L138 Inliner]: procedures = 169, calls = 12, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 85 [2024-11-19 09:57:54,985 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:57:54,986 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:57:54,986 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:57:54,986 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:57:54,995 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:54" (1/1) ... [2024-11-19 09:57:54,995 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:54" (1/1) ... [2024-11-19 09:57:54,997 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:54" (1/1) ... [2024-11-19 09:57:55,008 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:55,009 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:54" (1/1) ... [2024-11-19 09:57:55,009 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:54" (1/1) ... [2024-11-19 09:57:55,013 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:54" (1/1) ... [2024-11-19 09:57:55,020 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:54" (1/1) ... [2024-11-19 09:57:55,022 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:54" (1/1) ... [2024-11-19 09:57:55,023 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:54" (1/1) ... [2024-11-19 09:57:55,025 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:57:55,030 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:57:55,030 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:57:55,030 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:57:55,031 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:57:54" (1/1) ... [2024-11-19 09:57:55,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:57:55,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:57:55,070 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:55,072 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:55,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:57:55,108 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-19 09:57:55,108 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-19 09:57:55,108 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-19 09:57:55,108 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-19 09:57:55,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:57:55,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:57:55,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:57:55,109 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:55,211 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:57:55,214 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:57:55,342 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:57:55,342 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:57:55,435 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:57:55,436 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 09:57:55,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:57:55 BoogieIcfgContainer [2024-11-19 09:57:55,436 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:57:55,438 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:57:55,438 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:57:55,441 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:57:55,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:57:54" (1/3) ... [2024-11-19 09:57:55,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c3cc3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:57:55, skipping insertion in model container [2024-11-19 09:57:55,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:57:54" (2/3) ... [2024-11-19 09:57:55,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c3cc3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:57:55, skipping insertion in model container [2024-11-19 09:57:55,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:57:55" (3/3) ... [2024-11-19 09:57:55,444 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind2-1.i [2024-11-19 09:57:55,458 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:57:55,459 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-19 09:57:55,459 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:57:55,517 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 09:57:55,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 38 transitions, 90 flow [2024-11-19 09:57:55,574 INFO L124 PetriNetUnfolderBase]: 6/36 cut-off events. [2024-11-19 09:57:55,574 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 09:57:55,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 36 events. 6/36 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2024-11-19 09:57:55,583 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 38 transitions, 90 flow [2024-11-19 09:57:55,587 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 35 transitions, 82 flow [2024-11-19 09:57:55,600 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:57:55,607 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;@3b404b7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:57:55,607 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-19 09:57:55,614 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:57:55,614 INFO L124 PetriNetUnfolderBase]: 4/22 cut-off events. [2024-11-19 09:57:55,614 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 09:57:55,614 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:57:55,615 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:57:55,616 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 09:57:55,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:57:55,620 INFO L85 PathProgramCache]: Analyzing trace with hash 338354967, now seen corresponding path program 1 times [2024-11-19 09:57:55,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:57:55,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842863568] [2024-11-19 09:57:55,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:57:55,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:57:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:57:55,977 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:55,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:57:55,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842863568] [2024-11-19 09:57:55,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842863568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:57:55,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:57:55,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:57:55,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763486059] [2024-11-19 09:57:55,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:57:55,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:57:55,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:57:56,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:57:56,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:57:56,018 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2024-11-19 09:57:56,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 82 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:57:56,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2024-11-19 09:57:56,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:57:56,252 INFO L124 PetriNetUnfolderBase]: 287/602 cut-off events. [2024-11-19 09:57:56,253 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-11-19 09:57:56,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1128 conditions, 602 events. 287/602 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3097 event pairs, 42 based on Foata normal form. 112/658 useless extension candidates. Maximal degree in co-relation 1048. Up to 215 conditions per place. [2024-11-19 09:57:56,260 INFO L140 encePairwiseOnDemand]: 27/38 looper letters, 58 selfloop transitions, 8 changer transitions 0/74 dead transitions. [2024-11-19 09:57:56,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 74 transitions, 307 flow [2024-11-19 09:57:56,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:57:56,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:57:56,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2024-11-19 09:57:56,269 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-11-19 09:57:56,271 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 82 flow. Second operand 7 states and 152 transitions. [2024-11-19 09:57:56,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 74 transitions, 307 flow [2024-11-19 09:57:56,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 74 transitions, 289 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:57:56,276 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 111 flow [2024-11-19 09:57:56,278 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=111, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2024-11-19 09:57:56,280 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2024-11-19 09:57:56,281 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 111 flow [2024-11-19 09:57:56,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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,281 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:57:56,281 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:57:56,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:57:56,282 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 09:57:56,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:57:56,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1898083594, now seen corresponding path program 1 times [2024-11-19 09:57:56,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:57:56,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985280559] [2024-11-19 09:57:56,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:57:56,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:57:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:57:56,406 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:56,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:57:56,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985280559] [2024-11-19 09:57:56,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985280559] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:57:56,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870171485] [2024-11-19 09:57:56,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:57:56,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:57:56,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:57:56,414 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:56,415 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:56,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:57:56,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 09:57:56,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:57:56,541 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:56,542 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:57:56,578 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:56,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870171485] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:57:56,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:57:56,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-19 09:57:56,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591906807] [2024-11-19 09:57:56,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:57:56,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 09:57:56,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:57:56,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 09:57:56,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:57:56,600 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2024-11-19 09:57:56,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 111 flow. Second operand has 10 states, 10 states have (on average 12.2) internal successors, (122), 10 states have internal predecessors, (122), 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,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:57:56,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2024-11-19 09:57:56,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:57:56,920 INFO L124 PetriNetUnfolderBase]: 513/1033 cut-off events. [2024-11-19 09:57:56,920 INFO L125 PetriNetUnfolderBase]: For 156/166 co-relation queries the response was YES. [2024-11-19 09:57:56,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2287 conditions, 1033 events. 513/1033 cut-off events. For 156/166 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5859 event pairs, 81 based on Foata normal form. 10/884 useless extension candidates. Maximal degree in co-relation 853. Up to 332 conditions per place. [2024-11-19 09:57:56,927 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 73 selfloop transitions, 14 changer transitions 0/98 dead transitions. [2024-11-19 09:57:56,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 98 transitions, 438 flow [2024-11-19 09:57:56,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:57:56,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:57:56,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions. [2024-11-19 09:57:56,958 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5380116959064327 [2024-11-19 09:57:56,958 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 111 flow. Second operand 9 states and 184 transitions. [2024-11-19 09:57:56,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 98 transitions, 438 flow [2024-11-19 09:57:56,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 98 transitions, 427 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-19 09:57:56,968 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 170 flow [2024-11-19 09:57:56,968 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=170, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2024-11-19 09:57:56,968 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2024-11-19 09:57:56,968 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 170 flow [2024-11-19 09:57:56,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.2) internal successors, (122), 10 states have internal predecessors, (122), 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,969 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:57:56,969 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:57:56,982 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:57,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:57:57,174 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 09:57:57,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:57:57,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1289936521, now seen corresponding path program 2 times [2024-11-19 09:57:57,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:57:57,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204236999] [2024-11-19 09:57:57,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:57:57,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:57:57,205 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:57:57,205 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:57:57,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:57:57,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:57:57,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204236999] [2024-11-19 09:57:57,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204236999] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:57:57,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197259300] [2024-11-19 09:57:57,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:57:57,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:57:57,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:57:57,362 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:57,363 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:57,414 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:57:57,414 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:57:57,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:57:57,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:57:57,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:57:57,471 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:57:57,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197259300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:57:57,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 09:57:57,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2024-11-19 09:57:57,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520698642] [2024-11-19 09:57:57,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:57:57,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:57:57,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:57:57,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:57:57,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-19 09:57:57,480 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2024-11-19 09:57:57,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 170 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:57:57,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:57:57,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2024-11-19 09:57:57,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:57:57,729 INFO L124 PetriNetUnfolderBase]: 403/865 cut-off events. [2024-11-19 09:57:57,729 INFO L125 PetriNetUnfolderBase]: For 558/568 co-relation queries the response was YES. [2024-11-19 09:57:57,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2213 conditions, 865 events. 403/865 cut-off events. For 558/568 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4926 event pairs, 101 based on Foata normal form. 26/838 useless extension candidates. Maximal degree in co-relation 1319. Up to 362 conditions per place. [2024-11-19 09:57:57,735 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 77 selfloop transitions, 12 changer transitions 0/99 dead transitions. [2024-11-19 09:57:57,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 99 transitions, 505 flow [2024-11-19 09:57:57,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:57:57,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 09:57:57,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2024-11-19 09:57:57,739 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2024-11-19 09:57:57,739 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 170 flow. Second operand 10 states and 185 transitions. [2024-11-19 09:57:57,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 99 transitions, 505 flow [2024-11-19 09:57:57,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 99 transitions, 485 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-11-19 09:57:57,750 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 214 flow [2024-11-19 09:57:57,750 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=214, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2024-11-19 09:57:57,751 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places. [2024-11-19 09:57:57,751 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 214 flow [2024-11-19 09:57:57,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:57:57,753 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:57:57,753 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:57:57,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 09:57:57,956 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,SelfDestructingSolverStorable2 [2024-11-19 09:57:57,957 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 09:57:57,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:57:57,958 INFO L85 PathProgramCache]: Analyzing trace with hash 84955400, now seen corresponding path program 1 times [2024-11-19 09:57:57,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:57:57,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23556404] [2024-11-19 09:57:57,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:57:57,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:57:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:57:58,037 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:58,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:57:58,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23556404] [2024-11-19 09:57:58,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23556404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:57:58,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:57:58,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:57:58,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201278199] [2024-11-19 09:57:58,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:57:58,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:57:58,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:57:58,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:57:58,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:57:58,045 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2024-11-19 09:57:58,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 214 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:57:58,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:57:58,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2024-11-19 09:57:58,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:57:58,224 INFO L124 PetriNetUnfolderBase]: 473/1010 cut-off events. [2024-11-19 09:57:58,225 INFO L125 PetriNetUnfolderBase]: For 986/1004 co-relation queries the response was YES. [2024-11-19 09:57:58,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2606 conditions, 1010 events. 473/1010 cut-off events. For 986/1004 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5894 event pairs, 154 based on Foata normal form. 0/953 useless extension candidates. Maximal degree in co-relation 1783. Up to 489 conditions per place. [2024-11-19 09:57:58,229 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 64 selfloop transitions, 12 changer transitions 0/86 dead transitions. [2024-11-19 09:57:58,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 86 transitions, 575 flow [2024-11-19 09:57:58,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:57:58,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:57:58,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-11-19 09:57:58,230 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49624060150375937 [2024-11-19 09:57:58,230 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 214 flow. Second operand 7 states and 132 transitions. [2024-11-19 09:57:58,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 86 transitions, 575 flow [2024-11-19 09:57:58,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 86 transitions, 558 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-19 09:57:58,234 INFO L231 Difference]: Finished difference. Result has 62 places, 49 transitions, 262 flow [2024-11-19 09:57:58,234 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=262, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2024-11-19 09:57:58,235 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 26 predicate places. [2024-11-19 09:57:58,235 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 262 flow [2024-11-19 09:57:58,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:57:58,235 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:57:58,235 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:57:58,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 09:57:58,236 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 09:57:58,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:57:58,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1662335674, now seen corresponding path program 1 times [2024-11-19 09:57:58,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:57:58,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687497502] [2024-11-19 09:57:58,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:57:58,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:57:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:57:58,286 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:58,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:57:58,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687497502] [2024-11-19 09:57:58,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687497502] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:57:58,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760174815] [2024-11-19 09:57:58,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:57:58,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:57:58,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:57:58,289 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:58,291 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:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:57:58,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:57:58,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:57:58,368 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:58,368 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:57:58,401 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:58,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760174815] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:57:58,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:57:58,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-19 09:57:58,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184262205] [2024-11-19 09:57:58,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:57:58,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 09:57:58,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:57:58,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 09:57:58,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-19 09:57:58,413 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2024-11-19 09:57:58,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 49 transitions, 262 flow. Second operand has 11 states, 11 states have (on average 11.818181818181818) internal successors, (130), 11 states have internal predecessors, (130), 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,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:57:58,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2024-11-19 09:57:58,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:57:58,614 INFO L124 PetriNetUnfolderBase]: 543/1153 cut-off events. [2024-11-19 09:57:58,614 INFO L125 PetriNetUnfolderBase]: For 1395/1419 co-relation queries the response was YES. [2024-11-19 09:57:58,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3493 conditions, 1153 events. 543/1153 cut-off events. For 1395/1419 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6878 event pairs, 136 based on Foata normal form. 0/1092 useless extension candidates. Maximal degree in co-relation 2372. Up to 489 conditions per place. [2024-11-19 09:57:58,620 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 84 selfloop transitions, 15 changer transitions 0/109 dead transitions. [2024-11-19 09:57:58,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 109 transitions, 798 flow [2024-11-19 09:57:58,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:57:58,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:57:58,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-11-19 09:57:58,621 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49415204678362573 [2024-11-19 09:57:58,622 INFO L175 Difference]: Start difference. First operand has 62 places, 49 transitions, 262 flow. Second operand 9 states and 169 transitions. [2024-11-19 09:57:58,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 109 transitions, 798 flow [2024-11-19 09:57:58,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 109 transitions, 782 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-19 09:57:58,627 INFO L231 Difference]: Finished difference. Result has 69 places, 52 transitions, 312 flow [2024-11-19 09:57:58,627 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=312, PETRI_PLACES=69, PETRI_TRANSITIONS=52} [2024-11-19 09:57:58,627 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 33 predicate places. [2024-11-19 09:57:58,628 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 52 transitions, 312 flow [2024-11-19 09:57:58,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.818181818181818) internal successors, (130), 11 states have internal predecessors, (130), 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,628 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:57:58,628 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:57:58,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 09:57:58,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:57:58,833 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 09:57:58,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:57:58,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1032604834, now seen corresponding path program 1 times [2024-11-19 09:57:58,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:57:58,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859019457] [2024-11-19 09:57:58,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:57:58,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:57:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:57:58,874 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:58,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:57:58,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859019457] [2024-11-19 09:57:58,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859019457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:57:58,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:57:58,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:57:58,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158986049] [2024-11-19 09:57:58,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:57:58,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:57:58,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:57:58,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:57:58,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:57:58,878 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2024-11-19 09:57:58,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 52 transitions, 312 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:57:58,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2024-11-19 09:57:58,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:57:59,027 INFO L124 PetriNetUnfolderBase]: 473/997 cut-off events. [2024-11-19 09:57:59,028 INFO L125 PetriNetUnfolderBase]: For 1685/1707 co-relation queries the response was YES. [2024-11-19 09:57:59,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3390 conditions, 997 events. 473/997 cut-off events. For 1685/1707 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5551 event pairs, 150 based on Foata normal form. 14/963 useless extension candidates. Maximal degree in co-relation 2138. Up to 522 conditions per place. [2024-11-19 09:57:59,033 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 54 selfloop transitions, 12 changer transitions 0/75 dead transitions. [2024-11-19 09:57:59,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 75 transitions, 576 flow [2024-11-19 09:57:59,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:57:59,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:57:59,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2024-11-19 09:57:59,035 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2024-11-19 09:57:59,035 INFO L175 Difference]: Start difference. First operand has 69 places, 52 transitions, 312 flow. Second operand 6 states and 111 transitions. [2024-11-19 09:57:59,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 75 transitions, 576 flow [2024-11-19 09:57:59,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 75 transitions, 527 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-11-19 09:57:59,041 INFO L231 Difference]: Finished difference. Result has 68 places, 50 transitions, 293 flow [2024-11-19 09:57:59,041 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=293, PETRI_PLACES=68, PETRI_TRANSITIONS=50} [2024-11-19 09:57:59,041 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 32 predicate places. [2024-11-19 09:57:59,042 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 50 transitions, 293 flow [2024-11-19 09:57:59,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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,042 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:57:59,042 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:57:59,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 09:57:59,042 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 09:57:59,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:57:59,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1116409153, now seen corresponding path program 1 times [2024-11-19 09:57:59,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:57:59,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458883232] [2024-11-19 09:57:59,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:57:59,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:57:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:57:59,088 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:59,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:57:59,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458883232] [2024-11-19 09:57:59,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458883232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:57:59,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:57:59,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:57:59,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943747991] [2024-11-19 09:57:59,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:57:59,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:57:59,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:57:59,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:57:59,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:57:59,097 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2024-11-19 09:57:59,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 50 transitions, 293 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:57:59,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2024-11-19 09:57:59,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:57:59,247 INFO L124 PetriNetUnfolderBase]: 487/1034 cut-off events. [2024-11-19 09:57:59,247 INFO L125 PetriNetUnfolderBase]: For 1802/1834 co-relation queries the response was YES. [2024-11-19 09:57:59,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3344 conditions, 1034 events. 487/1034 cut-off events. For 1802/1834 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5818 event pairs, 161 based on Foata normal form. 0/988 useless extension candidates. Maximal degree in co-relation 2151. Up to 546 conditions per place. [2024-11-19 09:57:59,254 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 59 selfloop transitions, 12 changer transitions 0/80 dead transitions. [2024-11-19 09:57:59,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 80 transitions, 582 flow [2024-11-19 09:57:59,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:57:59,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:57:59,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-11-19 09:57:59,255 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5043859649122807 [2024-11-19 09:57:59,255 INFO L175 Difference]: Start difference. First operand has 68 places, 50 transitions, 293 flow. Second operand 6 states and 115 transitions. [2024-11-19 09:57:59,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 80 transitions, 582 flow [2024-11-19 09:57:59,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 80 transitions, 553 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-19 09:57:59,260 INFO L231 Difference]: Finished difference. Result has 70 places, 51 transitions, 310 flow [2024-11-19 09:57:59,260 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=310, PETRI_PLACES=70, PETRI_TRANSITIONS=51} [2024-11-19 09:57:59,261 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 34 predicate places. [2024-11-19 09:57:59,261 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 51 transitions, 310 flow [2024-11-19 09:57:59,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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,261 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:57:59,261 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:57:59,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 09:57:59,261 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 09:57:59,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:57:59,262 INFO L85 PathProgramCache]: Analyzing trace with hash 6215880, now seen corresponding path program 2 times [2024-11-19 09:57:59,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:57:59,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015540291] [2024-11-19 09:57:59,262 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:57:59,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:57:59,269 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:57:59,269 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:57:59,351 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:57:59,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:57:59,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015540291] [2024-11-19 09:57:59,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015540291] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:57:59,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209425820] [2024-11-19 09:57:59,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:57:59,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:57:59,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:57:59,354 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:59,355 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:59,403 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:57:59,403 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:57:59,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 09:57:59,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:57:59,498 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:57:59,498 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:57:59,618 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:57:59,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209425820] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:57:59,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:57:59,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2024-11-19 09:57:59,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747948185] [2024-11-19 09:57:59,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:57:59,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 09:57:59,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:57:59,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 09:57:59,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2024-11-19 09:57:59,629 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2024-11-19 09:57:59,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 51 transitions, 310 flow. Second operand has 18 states, 18 states have (on average 10.444444444444445) internal successors, (188), 18 states have internal predecessors, (188), 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,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:57:59,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2024-11-19 09:57:59,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:58:00,104 INFO L124 PetriNetUnfolderBase]: 787/1523 cut-off events. [2024-11-19 09:58:00,105 INFO L125 PetriNetUnfolderBase]: For 3024/3076 co-relation queries the response was YES. [2024-11-19 09:58:00,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5293 conditions, 1523 events. 787/1523 cut-off events. For 3024/3076 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8801 event pairs, 126 based on Foata normal form. 0/1389 useless extension candidates. Maximal degree in co-relation 4153. Up to 403 conditions per place. [2024-11-19 09:58:00,113 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 141 selfloop transitions, 28 changer transitions 0/177 dead transitions. [2024-11-19 09:58:00,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 177 transitions, 1394 flow [2024-11-19 09:58:00,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 09:58:00,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-19 09:58:00,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 271 transitions. [2024-11-19 09:58:00,114 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47543859649122805 [2024-11-19 09:58:00,114 INFO L175 Difference]: Start difference. First operand has 70 places, 51 transitions, 310 flow. Second operand 15 states and 271 transitions. [2024-11-19 09:58:00,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 177 transitions, 1394 flow [2024-11-19 09:58:00,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 177 transitions, 1341 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-11-19 09:58:00,123 INFO L231 Difference]: Finished difference. Result has 86 places, 63 transitions, 472 flow [2024-11-19 09:58:00,123 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=472, PETRI_PLACES=86, PETRI_TRANSITIONS=63} [2024-11-19 09:58:00,124 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 50 predicate places. [2024-11-19 09:58:00,124 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 63 transitions, 472 flow [2024-11-19 09:58:00,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.444444444444445) internal successors, (188), 18 states have internal predecessors, (188), 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,124 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:58:00,125 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:58:00,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 09:58:00,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:58:00,326 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 09:58:00,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:58:00,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1678074481, now seen corresponding path program 1 times [2024-11-19 09:58:00,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:58:00,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686886983] [2024-11-19 09:58:00,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:58:00,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:58:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:58:00,333 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:58:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:58:00,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 09:58:00,348 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:58:00,349 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-19 09:58:00,350 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-19 09:58:00,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-11-19 09:58:00,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-19 09:58:00,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2024-11-19 09:58:00,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-11-19 09:58:00,351 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-19 09:58:00,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 09:58:00,351 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2024-11-19 09:58:00,371 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:58:00,371 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:58:00,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:58:00 BasicIcfg [2024-11-19 09:58:00,374 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:58:00,375 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:58:00,375 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:58:00,375 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:58:00,375 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:55" (3/4) ... [2024-11-19 09:58:00,377 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 09:58:00,378 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:58:00,378 INFO L158 Benchmark]: Toolchain (without parser) took 5895.60ms. Allocated memory was 220.2MB in the beginning and 310.4MB in the end (delta: 90.2MB). Free memory was 148.6MB in the beginning and 185.1MB in the end (delta: -36.5MB). Peak memory consumption was 55.7MB. Max. memory is 16.1GB. [2024-11-19 09:58:00,378 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 99.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:58:00,378 INFO L158 Benchmark]: CACSL2BoogieTranslator took 450.92ms. Allocated memory is still 220.2MB. Free memory was 148.5MB in the beginning and 125.6MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-19 09:58:00,379 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.32ms. Allocated memory is still 220.2MB. Free memory was 125.6MB in the beginning and 123.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:58:00,379 INFO L158 Benchmark]: Boogie Preprocessor took 43.28ms. Allocated memory is still 220.2MB. Free memory was 123.5MB in the beginning and 121.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:58:00,379 INFO L158 Benchmark]: RCFGBuilder took 406.74ms. Allocated memory is still 220.2MB. Free memory was 121.4MB in the beginning and 99.6MB in the end (delta: 21.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-19 09:58:00,379 INFO L158 Benchmark]: TraceAbstraction took 4936.28ms. Allocated memory was 220.2MB in the beginning and 310.4MB in the end (delta: 90.2MB). Free memory was 98.3MB in the beginning and 186.2MB in the end (delta: -87.8MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2024-11-19 09:58:00,379 INFO L158 Benchmark]: Witness Printer took 2.71ms. Allocated memory is still 310.4MB. Free memory is still 185.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:58:00,380 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.14ms. Allocated memory is still 134.2MB. Free memory is still 99.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 450.92ms. Allocated memory is still 220.2MB. Free memory was 148.5MB in the beginning and 125.6MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.32ms. Allocated memory is still 220.2MB. Free memory was 125.6MB in the beginning and 123.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.28ms. Allocated memory is still 220.2MB. Free memory was 123.5MB in the beginning and 121.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 406.74ms. Allocated memory is still 220.2MB. Free memory was 121.4MB in the beginning and 99.6MB in the end (delta: 21.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4936.28ms. Allocated memory was 220.2MB in the beginning and 310.4MB in the end (delta: 90.2MB). Free memory was 98.3MB in the beginning and 186.2MB in the end (delta: -87.8MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Witness Printer took 2.71ms. Allocated memory is still 310.4MB. Free memory is still 185.1MB. 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; [L775] 0 _N = 1 [L776] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L776] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L777] 0 pthread_t t1, t2; [L778] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [_N=1, limit=0, t1=-2] [L757] 1 int i, bound; [L758] 1 int lim = _N; VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=1, limit=0] [L779] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [_N=1, limit=0, t1=-2, t2=-1] [L766] 2 int i, bound; [L767] 2 int lim = _N + 1; VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=2, limit=0] [L768] 2 limit = lim VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=2, limit=2] [L759] 1 limit = lim VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=1, limit=1] [L769] 2 bound = limit [L770] 2 i = 0 VAL [\old(arg)={0:0}, _N=1, arg={0:0}, bound=1, i=0, lim=2, limit=1] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=1, arg={0:0}, bound=1, i=1, lim=2, limit=1] [L770] COND FALSE 2 !(i < bound) [L771] CALL 2 __VERIFIER_assert(i == lim) [L753] COND TRUE 2 !expression [L753] CALL 2 reach_error() [L752] COND FALSE 2 !(0) VAL [_N=1, limit=1] [L752] 2 __assert_fail ("0", "generated/unwind2.h", 11, __extension__ __PRETTY_FUNCTION__) VAL [_N=1, limit=1] - UnprovableResult [Line: 774]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 779]: 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: 778]: 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: 752]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 57 locations, 7 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: 4.8s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 919 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 904 mSDsluCounter, 223 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 187 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1752 IncrementalHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 36 mSDtfsCounter, 1752 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=472occurred in iteration=8, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 152 NumberOfCodeBlocks, 152 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 570 SizeOfPredicates, 18 NumberOfNonLiveVariables, 282 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 5/21 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:00,399 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/unwind2-1.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 84506b1a5f2f1a1be74252915eb3882c15865a3a673842f14f5796dbb89eb736 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:58:02,451 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:58:02,495 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:02,498 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:58:02,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:58:02,515 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:58:02,516 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:58:02,516 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:58:02,516 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:58:02,517 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:58:02,517 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:58:02,517 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:58:02,518 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:58:02,518 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:58:02,518 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:58:02,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:58:02,519 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:58:02,519 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:58:02,519 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:58:02,519 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:58:02,520 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:58:02,520 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:58:02,520 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:58:02,521 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:58:02,521 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:58:02,521 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 09:58:02,521 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:58:02,522 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 09:58:02,522 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:58:02,522 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:58:02,522 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:58:02,523 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:58:02,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:58:02,523 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:58:02,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:58:02,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:58:02,524 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:58:02,524 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:58:02,525 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 09:58:02,525 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 09:58:02,525 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:58:02,525 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:58:02,526 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:58:02,526 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:58:02,526 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 -> 84506b1a5f2f1a1be74252915eb3882c15865a3a673842f14f5796dbb89eb736 [2024-11-19 09:58:02,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:58:02,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:58:02,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:58:02,817 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:58:02,817 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:58:02,819 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind2-1.i [2024-11-19 09:58:04,297 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:58:04,489 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:58:04,490 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind2-1.i [2024-11-19 09:58:04,510 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8df0facc7/7ddb9f37dfa647378dcb7c296576f9ea/FLAG379c8980e [2024-11-19 09:58:04,520 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8df0facc7/7ddb9f37dfa647378dcb7c296576f9ea [2024-11-19 09:58:04,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:58:04,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:58:04,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:58:04,530 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:58:04,535 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:58:04,536 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:58:04" (1/1) ... [2024-11-19 09:58:04,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79418bdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:04, skipping insertion in model container [2024-11-19 09:58:04,538 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:58:04" (1/1) ... [2024-11-19 09:58:04,580 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:58:04,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:58:04,905 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:58:04,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:58:04,993 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:58:04,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:04 WrapperNode [2024-11-19 09:58:04,993 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:58:04,994 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:58:04,994 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:58:04,994 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:58:04,999 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:04" (1/1) ... [2024-11-19 09:58:05,016 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:04" (1/1) ... [2024-11-19 09:58:05,037 INFO L138 Inliner]: procedures = 170, calls = 12, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 86 [2024-11-19 09:58:05,038 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:58:05,039 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:58:05,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:58:05,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:58:05,047 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:04" (1/1) ... [2024-11-19 09:58:05,048 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:04" (1/1) ... [2024-11-19 09:58:05,054 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:04" (1/1) ... [2024-11-19 09:58:05,070 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:05,070 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:04" (1/1) ... [2024-11-19 09:58:05,071 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:04" (1/1) ... [2024-11-19 09:58:05,077 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:04" (1/1) ... [2024-11-19 09:58:05,082 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:04" (1/1) ... [2024-11-19 09:58:05,083 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:04" (1/1) ... [2024-11-19 09:58:05,084 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:04" (1/1) ... [2024-11-19 09:58:05,090 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:58:05,091 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:58:05,091 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:58:05,091 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:58:05,092 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:04" (1/1) ... [2024-11-19 09:58:05,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:58:05,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:58:05,123 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:05,129 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:05,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:58:05,168 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-19 09:58:05,168 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-19 09:58:05,168 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-19 09:58:05,169 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-19 09:58:05,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 09:58:05,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:58:05,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:58:05,173 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:05,315 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:58:05,317 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:58:05,475 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:58:05,475 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:58:05,599 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:58:05,600 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 09:58:05,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:58:05 BoogieIcfgContainer [2024-11-19 09:58:05,606 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:58:05,608 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:58:05,608 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:58:05,611 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:58:05,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:58:04" (1/3) ... [2024-11-19 09:58:05,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e1d176a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:58:05, skipping insertion in model container [2024-11-19 09:58:05,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:04" (2/3) ... [2024-11-19 09:58:05,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e1d176a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:58:05, skipping insertion in model container [2024-11-19 09:58:05,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:58:05" (3/3) ... [2024-11-19 09:58:05,613 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind2-1.i [2024-11-19 09:58:05,628 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:58:05,629 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-19 09:58:05,629 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:58:05,692 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 09:58:05,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 38 transitions, 90 flow [2024-11-19 09:58:05,758 INFO L124 PetriNetUnfolderBase]: 6/36 cut-off events. [2024-11-19 09:58:05,758 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 09:58:05,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 36 events. 6/36 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2024-11-19 09:58:05,761 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 38 transitions, 90 flow [2024-11-19 09:58:05,764 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 35 transitions, 82 flow [2024-11-19 09:58:05,771 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:58:05,777 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;@4ae02eb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:58:05,778 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-19 09:58:05,784 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:58:05,784 INFO L124 PetriNetUnfolderBase]: 4/22 cut-off events. [2024-11-19 09:58:05,784 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 09:58:05,785 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:58:05,785 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:58:05,786 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 09:58:05,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:58:05,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2043240985, now seen corresponding path program 1 times [2024-11-19 09:58:05,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:58:05,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563009395] [2024-11-19 09:58:05,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:58:05,801 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:05,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:58:05,807 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:05,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 09:58:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:58:05,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:58:05,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:58:06,026 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:06,026 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:58:06,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:58:06,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563009395] [2024-11-19 09:58:06,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563009395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:58:06,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:58:06,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:58:06,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586630535] [2024-11-19 09:58:06,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:58:06,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:58:06,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:58:06,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:58:06,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:58:06,089 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2024-11-19 09:58:06,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 82 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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:06,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:58:06,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2024-11-19 09:58:06,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:58:06,402 INFO L124 PetriNetUnfolderBase]: 287/602 cut-off events. [2024-11-19 09:58:06,403 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-11-19 09:58:06,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1128 conditions, 602 events. 287/602 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3114 event pairs, 42 based on Foata normal form. 112/658 useless extension candidates. Maximal degree in co-relation 1048. Up to 215 conditions per place. [2024-11-19 09:58:06,410 INFO L140 encePairwiseOnDemand]: 27/38 looper letters, 58 selfloop transitions, 8 changer transitions 0/74 dead transitions. [2024-11-19 09:58:06,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 74 transitions, 307 flow [2024-11-19 09:58:06,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:58:06,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:58:06,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2024-11-19 09:58:06,421 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2024-11-19 09:58:06,423 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 82 flow. Second operand 7 states and 152 transitions. [2024-11-19 09:58:06,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 74 transitions, 307 flow [2024-11-19 09:58:06,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 74 transitions, 289 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:58:06,429 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 111 flow [2024-11-19 09:58:06,430 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=111, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2024-11-19 09:58:06,437 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2024-11-19 09:58:06,437 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 111 flow [2024-11-19 09:58:06,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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:06,438 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:58:06,438 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:58:06,442 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:06,638 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:06,639 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 09:58:06,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:58:06,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1085024694, now seen corresponding path program 1 times [2024-11-19 09:58:06,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:58:06,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1626988788] [2024-11-19 09:58:06,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:58:06,640 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:06,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:58:06,644 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:06,660 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:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:58:06,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:58:06,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:58:06,792 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:06,792 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:58:06,865 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:06,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:58:06,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1626988788] [2024-11-19 09:58:06,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1626988788] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:58:06,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:58:06,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-19 09:58:06,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051194928] [2024-11-19 09:58:06,866 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:58:06,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 09:58:06,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:58:06,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 09:58:06,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:58:06,887 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2024-11-19 09:58:06,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 111 flow. Second operand has 10 states, 10 states have (on average 12.1) internal successors, (121), 10 states have internal predecessors, (121), 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:06,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:58:06,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2024-11-19 09:58:06,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:58:07,344 INFO L124 PetriNetUnfolderBase]: 513/1019 cut-off events. [2024-11-19 09:58:07,346 INFO L125 PetriNetUnfolderBase]: For 115/117 co-relation queries the response was YES. [2024-11-19 09:58:07,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2281 conditions, 1019 events. 513/1019 cut-off events. For 115/117 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5773 event pairs, 45 based on Foata normal form. 2/864 useless extension candidates. Maximal degree in co-relation 850. Up to 332 conditions per place. [2024-11-19 09:58:07,358 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 73 selfloop transitions, 14 changer transitions 0/98 dead transitions. [2024-11-19 09:58:07,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 98 transitions, 438 flow [2024-11-19 09:58:07,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:58:07,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:58:07,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions. [2024-11-19 09:58:07,361 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5380116959064327 [2024-11-19 09:58:07,361 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 111 flow. Second operand 9 states and 184 transitions. [2024-11-19 09:58:07,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 98 transitions, 438 flow [2024-11-19 09:58:07,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 98 transitions, 427 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-19 09:58:07,369 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 170 flow [2024-11-19 09:58:07,370 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=170, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2024-11-19 09:58:07,370 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2024-11-19 09:58:07,371 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 170 flow [2024-11-19 09:58:07,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.1) internal successors, (121), 10 states have internal predecessors, (121), 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:07,371 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:58:07,372 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:58:07,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-19 09:58:07,572 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:07,573 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 09:58:07,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:58:07,574 INFO L85 PathProgramCache]: Analyzing trace with hash 722987065, now seen corresponding path program 2 times [2024-11-19 09:58:07,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:58:07,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382704603] [2024-11-19 09:58:07,574 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:58:07,574 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:07,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:58:07,577 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:07,578 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:07,625 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:58:07,626 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:58:07,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:58:07,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:58:07,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:58:07,676 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:58:07,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:58:07,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:58:07,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382704603] [2024-11-19 09:58:07,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382704603] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:58:07,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:58:07,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-19 09:58:07,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665932818] [2024-11-19 09:58:07,749 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:58:07,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 09:58:07,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:58:07,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 09:58:07,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 09:58:07,759 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2024-11-19 09:58:07,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 170 flow. Second operand has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 states have internal predecessors, (136), 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:07,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:58:07,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2024-11-19 09:58:07,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:58:08,269 INFO L124 PetriNetUnfolderBase]: 403/859 cut-off events. [2024-11-19 09:58:08,269 INFO L125 PetriNetUnfolderBase]: For 545/555 co-relation queries the response was YES. [2024-11-19 09:58:08,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2209 conditions, 859 events. 403/859 cut-off events. For 545/555 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4866 event pairs, 25 based on Foata normal form. 26/834 useless extension candidates. Maximal degree in co-relation 1315. Up to 233 conditions per place. [2024-11-19 09:58:08,274 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 84 selfloop transitions, 15 changer transitions 0/109 dead transitions. [2024-11-19 09:58:08,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 109 transitions, 546 flow [2024-11-19 09:58:08,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 09:58:08,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 09:58:08,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 216 transitions. [2024-11-19 09:58:08,279 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2024-11-19 09:58:08,279 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 170 flow. Second operand 12 states and 216 transitions. [2024-11-19 09:58:08,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 109 transitions, 546 flow [2024-11-19 09:58:08,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 109 transitions, 526 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-11-19 09:58:08,289 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 228 flow [2024-11-19 09:58:08,290 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=228, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-11-19 09:58:08,290 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2024-11-19 09:58:08,291 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 228 flow [2024-11-19 09:58:08,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.333333333333334) internal successors, (136), 12 states have internal predecessors, (136), 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:08,291 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:58:08,292 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:58:08,299 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:58:08,494 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:58:08,495 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 09:58:08,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:58:08,496 INFO L85 PathProgramCache]: Analyzing trace with hash 2097878986, now seen corresponding path program 1 times [2024-11-19 09:58:08,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:58:08,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [702275395] [2024-11-19 09:58:08,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:58:08,496 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:08,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:58:08,499 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:58:08,504 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:58:08,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:58:08,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:58:08,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:58:08,574 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:08,574 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:58:08,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:58:08,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [702275395] [2024-11-19 09:58:08,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [702275395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:58:08,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:58:08,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:58:08,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039110320] [2024-11-19 09:58:08,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:58:08,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:58:08,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:58:08,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:58:08,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:58:08,580 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2024-11-19 09:58:08,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 228 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:58:08,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:58:08,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2024-11-19 09:58:08,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:58:08,770 INFO L124 PetriNetUnfolderBase]: 473/1018 cut-off events. [2024-11-19 09:58:08,770 INFO L125 PetriNetUnfolderBase]: For 1134/1152 co-relation queries the response was YES. [2024-11-19 09:58:08,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2716 conditions, 1018 events. 473/1018 cut-off events. For 1134/1152 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6020 event pairs, 136 based on Foata normal form. 0/961 useless extension candidates. Maximal degree in co-relation 1851. Up to 489 conditions per place. [2024-11-19 09:58:08,775 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 66 selfloop transitions, 12 changer transitions 0/88 dead transitions. [2024-11-19 09:58:08,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 88 transitions, 613 flow [2024-11-19 09:58:08,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:58:08,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:58:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-11-19 09:58:08,776 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49624060150375937 [2024-11-19 09:58:08,777 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 228 flow. Second operand 7 states and 132 transitions. [2024-11-19 09:58:08,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 88 transitions, 613 flow [2024-11-19 09:58:08,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 88 transitions, 582 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-19 09:58:08,780 INFO L231 Difference]: Finished difference. Result has 63 places, 50 transitions, 267 flow [2024-11-19 09:58:08,781 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=267, PETRI_PLACES=63, PETRI_TRANSITIONS=50} [2024-11-19 09:58:08,781 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 27 predicate places. [2024-11-19 09:58:08,781 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 50 transitions, 267 flow [2024-11-19 09:58:08,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:58:08,782 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:58:08,782 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:58:08,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 09:58:08,984 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:58:08,984 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 09:58:08,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:58:08,986 INFO L85 PathProgramCache]: Analyzing trace with hash 608753350, now seen corresponding path program 1 times [2024-11-19 09:58:08,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:58:08,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [931408440] [2024-11-19 09:58:08,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:58:08,988 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:08,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:58:08,993 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:58:08,995 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:58:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:58:09,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:58:09,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:58:09,081 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:09,082 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:58:09,154 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:09,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:58:09,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [931408440] [2024-11-19 09:58:09,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [931408440] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:58:09,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:58:09,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-19 09:58:09,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716144969] [2024-11-19 09:58:09,155 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:58:09,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 09:58:09,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:58:09,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 09:58:09,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 09:58:09,166 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2024-11-19 09:58:09,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 50 transitions, 267 flow. Second operand has 12 states, 12 states have (on average 11.583333333333334) internal successors, (139), 12 states have internal predecessors, (139), 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:09,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:58:09,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2024-11-19 09:58:09,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:58:09,490 INFO L124 PetriNetUnfolderBase]: 543/1151 cut-off events. [2024-11-19 09:58:09,490 INFO L125 PetriNetUnfolderBase]: For 1508/1532 co-relation queries the response was YES. [2024-11-19 09:58:09,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3567 conditions, 1151 events. 543/1151 cut-off events. For 1508/1532 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6885 event pairs, 154 based on Foata normal form. 0/1090 useless extension candidates. Maximal degree in co-relation 2406. Up to 489 conditions per place. [2024-11-19 09:58:09,496 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 87 selfloop transitions, 15 changer transitions 0/112 dead transitions. [2024-11-19 09:58:09,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 112 transitions, 837 flow [2024-11-19 09:58:09,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:58:09,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:58:09,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-11-19 09:58:09,498 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49415204678362573 [2024-11-19 09:58:09,498 INFO L175 Difference]: Start difference. First operand has 63 places, 50 transitions, 267 flow. Second operand 9 states and 169 transitions. [2024-11-19 09:58:09,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 112 transitions, 837 flow [2024-11-19 09:58:09,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 112 transitions, 821 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-19 09:58:09,523 INFO L231 Difference]: Finished difference. Result has 70 places, 53 transitions, 316 flow [2024-11-19 09:58:09,523 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=316, PETRI_PLACES=70, PETRI_TRANSITIONS=53} [2024-11-19 09:58:09,524 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 34 predicate places. [2024-11-19 09:58:09,524 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 53 transitions, 316 flow [2024-11-19 09:58:09,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.583333333333334) internal successors, (139), 12 states have internal predecessors, (139), 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:09,524 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:58:09,525 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:58:09,528 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:58:09,729 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:58:09,730 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 09:58:09,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:58:09,730 INFO L85 PathProgramCache]: Analyzing trace with hash 139544498, now seen corresponding path program 1 times [2024-11-19 09:58:09,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:58:09,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581250358] [2024-11-19 09:58:09,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:58:09,731 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:09,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:58:09,734 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:58:09,736 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:58:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:58:09,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:58:09,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:58:09,837 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:09,837 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:58:09,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:58:09,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581250358] [2024-11-19 09:58:09,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581250358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:58:09,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:58:09,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:58:09,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408293847] [2024-11-19 09:58:09,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:58:09,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:58:09,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:58:09,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:58:09,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:58:09,843 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2024-11-19 09:58:09,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 53 transitions, 316 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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:09,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:58:09,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2024-11-19 09:58:09,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:58:10,004 INFO L124 PetriNetUnfolderBase]: 473/997 cut-off events. [2024-11-19 09:58:10,004 INFO L125 PetriNetUnfolderBase]: For 1781/1803 co-relation queries the response was YES. [2024-11-19 09:58:10,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3438 conditions, 997 events. 473/997 cut-off events. For 1781/1803 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5565 event pairs, 150 based on Foata normal form. 14/963 useless extension candidates. Maximal degree in co-relation 2144. Up to 522 conditions per place. [2024-11-19 09:58:10,035 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 55 selfloop transitions, 12 changer transitions 0/76 dead transitions. [2024-11-19 09:58:10,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 76 transitions, 583 flow [2024-11-19 09:58:10,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:58:10,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:58:10,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2024-11-19 09:58:10,037 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2024-11-19 09:58:10,037 INFO L175 Difference]: Start difference. First operand has 70 places, 53 transitions, 316 flow. Second operand 6 states and 111 transitions. [2024-11-19 09:58:10,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 76 transitions, 583 flow [2024-11-19 09:58:10,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 76 transitions, 534 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-11-19 09:58:10,043 INFO L231 Difference]: Finished difference. Result has 69 places, 51 transitions, 297 flow [2024-11-19 09:58:10,043 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=297, PETRI_PLACES=69, PETRI_TRANSITIONS=51} [2024-11-19 09:58:10,044 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 33 predicate places. [2024-11-19 09:58:10,044 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 51 transitions, 297 flow [2024-11-19 09:58:10,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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:10,044 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:58:10,044 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:58:10,048 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:58:10,247 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:58:10,248 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 09:58:10,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:58:10,248 INFO L85 PathProgramCache]: Analyzing trace with hash 106162721, now seen corresponding path program 1 times [2024-11-19 09:58:10,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:58:10,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204121027] [2024-11-19 09:58:10,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:58:10,249 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:10,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:58:10,253 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:58:10,261 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:58:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:58:10,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:58:10,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:58:10,340 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:10,340 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:58:10,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:58:10,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204121027] [2024-11-19 09:58:10,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1204121027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:58:10,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:58:10,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:58:10,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647020952] [2024-11-19 09:58:10,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:58:10,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:58:10,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:58:10,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:58:10,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:58:10,349 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 38 [2024-11-19 09:58:10,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 51 transitions, 297 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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:10,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:58:10,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 38 [2024-11-19 09:58:10,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:58:10,531 INFO L124 PetriNetUnfolderBase]: 487/1036 cut-off events. [2024-11-19 09:58:10,531 INFO L125 PetriNetUnfolderBase]: For 1854/1884 co-relation queries the response was YES. [2024-11-19 09:58:10,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3396 conditions, 1036 events. 487/1036 cut-off events. For 1854/1884 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5875 event pairs, 152 based on Foata normal form. 0/990 useless extension candidates. Maximal degree in co-relation 2161. Up to 546 conditions per place. [2024-11-19 09:58:10,537 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 60 selfloop transitions, 12 changer transitions 0/81 dead transitions. [2024-11-19 09:58:10,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 81 transitions, 590 flow [2024-11-19 09:58:10,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:58:10,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:58:10,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-11-19 09:58:10,539 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5043859649122807 [2024-11-19 09:58:10,539 INFO L175 Difference]: Start difference. First operand has 69 places, 51 transitions, 297 flow. Second operand 6 states and 115 transitions. [2024-11-19 09:58:10,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 81 transitions, 590 flow [2024-11-19 09:58:10,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 81 transitions, 551 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-11-19 09:58:10,544 INFO L231 Difference]: Finished difference. Result has 70 places, 52 transitions, 306 flow [2024-11-19 09:58:10,544 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=306, PETRI_PLACES=70, PETRI_TRANSITIONS=52} [2024-11-19 09:58:10,545 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 34 predicate places. [2024-11-19 09:58:10,545 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 52 transitions, 306 flow [2024-11-19 09:58:10,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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:10,545 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:58:10,545 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:58:10,552 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:58:10,748 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:58:10,748 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 09:58:10,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:58:10,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1690498890, now seen corresponding path program 2 times [2024-11-19 09:58:10,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:58:10,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782279845] [2024-11-19 09:58:10,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:58:10,750 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:10,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:58:10,753 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:58:10,757 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:58:10,792 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:58:10,792 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:58:10,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:58:10,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:58:10,844 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:58:10,844 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:58:10,891 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:58:10,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:58:10,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782279845] [2024-11-19 09:58:10,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782279845] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:58:10,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:58:10,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-11-19 09:58:10,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779746944] [2024-11-19 09:58:10,892 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:58:10,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 09:58:10,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:58:10,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 09:58:10,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-19 09:58:10,914 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2024-11-19 09:58:10,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 52 transitions, 306 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 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:10,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:58:10,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2024-11-19 09:58:10,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:58:11,280 INFO L124 PetriNetUnfolderBase]: 809/1592 cut-off events. [2024-11-19 09:58:11,280 INFO L125 PetriNetUnfolderBase]: For 3218/3302 co-relation queries the response was YES. [2024-11-19 09:58:11,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5498 conditions, 1592 events. 809/1592 cut-off events. For 3218/3302 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9646 event pairs, 114 based on Foata normal form. 16/1457 useless extension candidates. Maximal degree in co-relation 4315. Up to 517 conditions per place. [2024-11-19 09:58:11,288 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 122 selfloop transitions, 17 changer transitions 0/156 dead transitions. [2024-11-19 09:58:11,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 156 transitions, 1232 flow [2024-11-19 09:58:11,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:58:11,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 09:58:11,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 196 transitions. [2024-11-19 09:58:11,289 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5157894736842106 [2024-11-19 09:58:11,289 INFO L175 Difference]: Start difference. First operand has 70 places, 52 transitions, 306 flow. Second operand 10 states and 196 transitions. [2024-11-19 09:58:11,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 156 transitions, 1232 flow [2024-11-19 09:58:11,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 156 transitions, 1186 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-11-19 09:58:11,296 INFO L231 Difference]: Finished difference. Result has 77 places, 59 transitions, 366 flow [2024-11-19 09:58:11,296 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=366, PETRI_PLACES=77, PETRI_TRANSITIONS=59} [2024-11-19 09:58:11,297 INFO L277 CegarLoopForPetriNet]: 36 programPoint places, 41 predicate places. [2024-11-19 09:58:11,297 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 59 transitions, 366 flow [2024-11-19 09:58:11,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 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:11,297 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:58:11,297 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:58:11,301 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 (9)] Forceful destruction successful, exit code 0 [2024-11-19 09:58:11,498 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:58:11,499 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-19 09:58:11,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:58:11,499 INFO L85 PathProgramCache]: Analyzing trace with hash 921125357, now seen corresponding path program 1 times [2024-11-19 09:58:11,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:58:11,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1023979034] [2024-11-19 09:58:11,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:58:11,500 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:11,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:58:11,502 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:58:11,503 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:58:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:58:11,537 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:58:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:58:11,574 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-19 09:58:11,574 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:58:11,576 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-19 09:58:11,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-19 09:58:11,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-11-19 09:58:11,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-19 09:58:11,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2024-11-19 09:58:11,579 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-11-19 09:58:11,579 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-19 09:58:11,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-19 09:58:11,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:58:11,782 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2024-11-19 09:58:11,802 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:58:11,803 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:58:11,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:58:11 BasicIcfg [2024-11-19 09:58:11,806 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:58:11,807 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:58:11,807 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:58:11,807 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:58:11,807 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:58:05" (3/4) ... [2024-11-19 09:58:11,809 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 09:58:11,809 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:58:11,810 INFO L158 Benchmark]: Toolchain (without parser) took 7281.76ms. Allocated memory was 62.9MB in the beginning and 142.6MB in the end (delta: 79.7MB). Free memory was 39.0MB in the beginning and 72.7MB in the end (delta: -33.6MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. [2024-11-19 09:58:11,810 INFO L158 Benchmark]: CDTParser took 1.42ms. Allocated memory is still 62.9MB. Free memory was 39.4MB in the beginning and 39.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:58:11,811 INFO L158 Benchmark]: CACSL2BoogieTranslator took 463.42ms. Allocated memory was 62.9MB in the beginning and 96.5MB in the end (delta: 33.6MB). Free memory was 38.9MB in the beginning and 66.0MB in the end (delta: -27.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 09:58:11,811 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.33ms. Allocated memory is still 96.5MB. Free memory was 66.0MB in the beginning and 63.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 09:58:11,811 INFO L158 Benchmark]: Boogie Preprocessor took 51.30ms. Allocated memory is still 96.5MB. Free memory was 63.5MB in the beginning and 61.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:58:11,811 INFO L158 Benchmark]: RCFGBuilder took 515.40ms. Allocated memory is still 96.5MB. Free memory was 61.0MB in the beginning and 61.7MB in the end (delta: -636.4kB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2024-11-19 09:58:11,811 INFO L158 Benchmark]: TraceAbstraction took 6198.88ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 61.1MB in the beginning and 73.7MB in the end (delta: -12.6MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. [2024-11-19 09:58:11,812 INFO L158 Benchmark]: Witness Printer took 2.79ms. Allocated memory is still 142.6MB. Free memory was 73.7MB in the beginning and 72.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:58:11,813 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.42ms. Allocated memory is still 62.9MB. Free memory was 39.4MB in the beginning and 39.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 463.42ms. Allocated memory was 62.9MB in the beginning and 96.5MB in the end (delta: 33.6MB). Free memory was 38.9MB in the beginning and 66.0MB in the end (delta: -27.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.33ms. Allocated memory is still 96.5MB. Free memory was 66.0MB in the beginning and 63.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.30ms. Allocated memory is still 96.5MB. Free memory was 63.5MB in the beginning and 61.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 515.40ms. Allocated memory is still 96.5MB. Free memory was 61.0MB in the beginning and 61.7MB in the end (delta: -636.4kB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6198.88ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 61.1MB in the beginning and 73.7MB in the end (delta: -12.6MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. * Witness Printer took 2.79ms. Allocated memory is still 142.6MB. Free memory was 73.7MB in the beginning and 72.7MB in the end (delta: 1.0MB). 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; [L775] 0 _N = 1 [L776] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L776] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L777] 0 pthread_t t1, t2; [L778] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [_N=1, limit=0, t1=0] [L757] 1 int i, bound; [L758] 1 int lim = _N; VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=1, limit=0] [L779] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [_N=1, limit=0, t1=0, t2=1] [L766] 2 int i, bound; [L767] 2 int lim = _N + 1; VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=2, limit=0] [L768] 2 limit = lim VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=2, limit=2] [L759] 1 limit = lim VAL [\old(arg)={0:0}, _N=1, arg={0:0}, lim=1, limit=1] [L769] 2 bound = limit [L770] 2 i = 0 VAL [\old(arg)={0:0}, _N=1, arg={0:0}, bound=1, i=0, lim=2, limit=1] [L770] COND TRUE 2 i < bound [L770] 2 i++ VAL [\old(arg)={0:0}, _N=1, arg={0:0}, bound=1, i=1, lim=2, limit=1] [L770] COND FALSE 2 !(i < bound) [L771] CALL 2 __VERIFIER_assert(i == lim) [L753] COND TRUE 2 !expression [L753] CALL 2 reach_error() [L752] COND FALSE 2 !(0) VAL [_N=1, limit=1] [L752] 2 __assert_fail ("0", "generated/unwind2.h", 11, __extension__ __PRETTY_FUNCTION__) VAL [_N=1, limit=1] - UnprovableResult [Line: 774]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 778]: 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: 779]: 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: 752]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 57 locations, 7 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: 6.1s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 904 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 894 mSDsluCounter, 126 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 101 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1981 IncrementalHoareTripleChecker+Invalid, 1988 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 25 mSDtfsCounter, 1981 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=366occurred in iteration=8, InterpolantAutomatonStates: 66, 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.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 388 SizeOfPredicates, 26 NumberOfNonLiveVariables, 332 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 4/16 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:11,841 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 Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample