./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-theta/unwind3-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/unwind3-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 ac23e7ddc6ad8a4019915da456e24c280b09a2b1564c0f5287e162f39d98d7fe --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:58:01,872 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:58:01,920 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:58:01,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:58:01,923 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:58:01,942 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:58:01,943 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:58:01,943 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:58:01,943 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:58:01,944 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:58:01,944 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:58:01,944 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:58:01,944 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:58:01,945 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:58:01,945 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:58:01,945 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:58:01,945 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:58:01,946 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:58:01,946 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:58:01,946 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:58:01,946 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:58:01,947 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:58:01,947 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:58:01,947 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:58:01,947 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:58:01,948 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:58:01,948 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:58:01,948 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:58:01,948 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:58:01,948 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:58:01,948 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:58:01,949 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:58:01,949 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:58:01,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:58:01,949 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:58:01,950 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:58:01,950 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:58:01,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:58:01,950 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:58:01,950 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:58:01,951 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:58:01,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:58:01,957 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 -> ac23e7ddc6ad8a4019915da456e24c280b09a2b1564c0f5287e162f39d98d7fe [2024-11-19 09:58:02,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:58:02,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:58:02,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:58:02,200 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:58:02,200 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:58:02,201 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind3-1.i [2024-11-19 09:58:03,403 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:58:03,598 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:58:03,599 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-1.i [2024-11-19 09:58:03,610 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb7af040c/0c6f30ec9b574a2694be0969c992e079/FLAGb50135944 [2024-11-19 09:58:03,622 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb7af040c/0c6f30ec9b574a2694be0969c992e079 [2024-11-19 09:58:03,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:58:03,626 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:58:03,627 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:58:03,627 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:58:03,631 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:58:03,631 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:58:03" (1/1) ... [2024-11-19 09:58:03,632 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f980227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:03, skipping insertion in model container [2024-11-19 09:58:03,634 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:58:03" (1/1) ... [2024-11-19 09:58:03,669 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:58:03,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:58:03,950 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:58:03,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:58:04,027 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:58:04,027 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,028 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:58:04,028 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:58:04,028 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:58:04,029 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:58:04,034 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:04,046 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:04,061 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 66 [2024-11-19 09:58:04,063 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:58:04,063 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:58:04,063 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:58:04,063 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:58:04,070 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:04,070 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:04,072 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:04,081 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:04,082 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:04,082 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:04,084 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:04,087 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:04,088 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:04,088 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:04,090 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:58:04,090 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:58:04,091 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:58:04,091 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:58:04,091 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:04,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:58:04,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:58:04,120 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:04,122 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:04,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:58:04,158 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-19 09:58:04,158 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-19 09:58:04,158 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-19 09:58:04,158 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-19 09:58:04,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:58:04,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:58:04,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:58:04,161 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:04,260 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:58:04,262 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:58:04,434 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:58:04,434 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:58:04,510 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:58:04,510 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 09:58:04,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:58:04 BoogieIcfgContainer [2024-11-19 09:58:04,511 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:58:04,512 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:58:04,512 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:58:04,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:58:04,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:58:03" (1/3) ... [2024-11-19 09:58:04,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57022d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:58:04, skipping insertion in model container [2024-11-19 09:58:04,517 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:04,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57022d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:58:04, skipping insertion in model container [2024-11-19 09:58:04,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:58:04" (3/3) ... [2024-11-19 09:58:04,518 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind3-1.i [2024-11-19 09:58:04,531 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:58:04,531 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 09:58:04,531 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:58:04,561 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 09:58:04,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 62 flow [2024-11-19 09:58:04,615 INFO L124 PetriNetUnfolderBase]: 6/43 cut-off events. [2024-11-19 09:58:04,615 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:58:04,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 43 events. 6/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 102 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 23. Up to 4 conditions per place. [2024-11-19 09:58:04,620 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 62 flow [2024-11-19 09:58:04,622 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 59 flow [2024-11-19 09:58:04,631 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:58:04,638 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;@32f9447a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:58:04,638 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-19 09:58:04,645 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:58:04,646 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2024-11-19 09:58:04,646 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:58:04,646 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:58:04,646 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:58:04,646 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 09:58:04,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:58:04,650 INFO L85 PathProgramCache]: Analyzing trace with hash -242791537, now seen corresponding path program 1 times [2024-11-19 09:58:04,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:58:04,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736898878] [2024-11-19 09:58:04,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:58:04,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:58:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:58:04,876 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:04,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:58:04,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736898878] [2024-11-19 09:58:04,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736898878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:58:04,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:58:04,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:58:04,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358151893] [2024-11-19 09:58:04,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:58:04,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:58:04,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:58:04,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:58:04,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:58:04,918 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2024-11-19 09:58:04,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 59 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:58:04,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:58:04,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2024-11-19 09:58:04,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:58:04,985 INFO L124 PetriNetUnfolderBase]: 69/163 cut-off events. [2024-11-19 09:58:04,985 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 09:58:04,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 163 events. 69/163 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 609 event pairs, 41 based on Foata normal form. 18/166 useless extension candidates. Maximal degree in co-relation 287. Up to 124 conditions per place. [2024-11-19 09:58:04,988 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 16 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2024-11-19 09:58:04,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 26 transitions, 97 flow [2024-11-19 09:58:04,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:58:04,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:58:04,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2024-11-19 09:58:04,998 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-19 09:58:05,000 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 59 flow. Second operand 4 states and 54 transitions. [2024-11-19 09:58:05,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 26 transitions, 97 flow [2024-11-19 09:58:05,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 96 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:58:05,004 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 62 flow [2024-11-19 09:58:05,005 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=62, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2024-11-19 09:58:05,008 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2024-11-19 09:58:05,008 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 62 flow [2024-11-19 09:58:05,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:58:05,008 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:58:05,008 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-19 09:58:05,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:58:05,009 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 09:58:05,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:58:05,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1062405037, now seen corresponding path program 1 times [2024-11-19 09:58:05,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:58:05,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479058607] [2024-11-19 09:58:05,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:58:05,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:58:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:58:05,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:58:05,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:58:05,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479058607] [2024-11-19 09:58:05,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479058607] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:58:05,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427558051] [2024-11-19 09:58:05,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:58:05,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:58:05,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:58:05,110 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:58:05,111 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:58:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:58:05,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:58:05,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:58:05,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:58:05,235 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:58:05,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427558051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:58:05,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 09:58:05,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-19 09:58:05,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697669236] [2024-11-19 09:58:05,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:58:05,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:58:05,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:58:05,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:58:05,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:58:05,252 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2024-11-19 09:58:05,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:58:05,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:58:05,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2024-11-19 09:58:05,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:58:05,327 INFO L124 PetriNetUnfolderBase]: 67/156 cut-off events. [2024-11-19 09:58:05,328 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-19 09:58:05,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 156 events. 67/156 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 587 event pairs, 24 based on Foata normal form. 3/147 useless extension candidates. Maximal degree in co-relation 286. Up to 114 conditions per place. [2024-11-19 09:58:05,330 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 16 selfloop transitions, 4 changer transitions 0/26 dead transitions. [2024-11-19 09:58:05,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 26 transitions, 107 flow [2024-11-19 09:58:05,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:58:05,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:58:05,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2024-11-19 09:58:05,333 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45185185185185184 [2024-11-19 09:58:05,333 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 62 flow. Second operand 5 states and 61 transitions. [2024-11-19 09:58:05,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 26 transitions, 107 flow [2024-11-19 09:58:05,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 100 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:58:05,335 INFO L231 Difference]: Finished difference. Result has 31 places, 22 transitions, 64 flow [2024-11-19 09:58:05,335 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=64, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2024-11-19 09:58:05,336 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2024-11-19 09:58:05,336 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 64 flow [2024-11-19 09:58:05,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:58:05,337 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:58:05,337 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:58:05,357 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:58:05,541 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:58:05,542 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 09:58:05,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:58:05,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1230936796, now seen corresponding path program 1 times [2024-11-19 09:58:05,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:58:05,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620796934] [2024-11-19 09:58:05,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:58:05,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:58:05,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:58:05,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:58:05,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:58:05,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620796934] [2024-11-19 09:58:05,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620796934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:58:05,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:58:05,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:58:05,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627362740] [2024-11-19 09:58:05,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:58:05,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:58:05,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:58:05,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:58:05,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:58:05,605 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2024-11-19 09:58:05,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:58:05,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:58:05,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2024-11-19 09:58:05,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:58:05,642 INFO L124 PetriNetUnfolderBase]: 67/151 cut-off events. [2024-11-19 09:58:05,646 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-11-19 09:58:05,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 151 events. 67/151 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 538 event pairs, 58 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 287. Up to 123 conditions per place. [2024-11-19 09:58:05,651 INFO L140 encePairwiseOnDemand]: 25/27 looper letters, 13 selfloop transitions, 1 changer transitions 1/21 dead transitions. [2024-11-19 09:58:05,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 21 transitions, 92 flow [2024-11-19 09:58:05,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:58:05,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:58:05,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2024-11-19 09:58:05,653 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49382716049382713 [2024-11-19 09:58:05,653 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 64 flow. Second operand 3 states and 40 transitions. [2024-11-19 09:58:05,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 21 transitions, 92 flow [2024-11-19 09:58:05,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 21 transitions, 82 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-11-19 09:58:05,654 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 52 flow [2024-11-19 09:58:05,654 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2024-11-19 09:58:05,655 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, -1 predicate places. [2024-11-19 09:58:05,655 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 20 transitions, 52 flow [2024-11-19 09:58:05,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:58:05,655 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:58:05,655 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:58:05,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 09:58:05,656 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 09:58:05,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:58:05,656 INFO L85 PathProgramCache]: Analyzing trace with hash -402908222, now seen corresponding path program 1 times [2024-11-19 09:58:05,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:58:05,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373569999] [2024-11-19 09:58:05,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:58:05,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:58:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:58:05,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:58:05,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:58:05,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373569999] [2024-11-19 09:58:05,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373569999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:58:05,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:58:05,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:58:05,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686056087] [2024-11-19 09:58:05,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:58:05,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:58:05,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:58:05,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:58:05,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:58:05,779 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2024-11-19 09:58:05,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 20 transitions, 52 flow. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:58:05,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:58:05,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2024-11-19 09:58:05,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:58:05,870 INFO L124 PetriNetUnfolderBase]: 103/207 cut-off events. [2024-11-19 09:58:05,871 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 09:58:05,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 207 events. 103/207 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 795 event pairs, 46 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 406. Up to 102 conditions per place. [2024-11-19 09:58:05,872 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 16 selfloop transitions, 3 changer transitions 11/35 dead transitions. [2024-11-19 09:58:05,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 35 transitions, 142 flow [2024-11-19 09:58:05,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:58:05,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:58:05,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2024-11-19 09:58:05,875 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4876543209876543 [2024-11-19 09:58:05,875 INFO L175 Difference]: Start difference. First operand has 28 places, 20 transitions, 52 flow. Second operand 6 states and 79 transitions. [2024-11-19 09:58:05,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 35 transitions, 142 flow [2024-11-19 09:58:05,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 35 transitions, 141 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:58:05,877 INFO L231 Difference]: Finished difference. Result has 33 places, 20 transitions, 65 flow [2024-11-19 09:58:05,877 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=65, PETRI_PLACES=33, PETRI_TRANSITIONS=20} [2024-11-19 09:58:05,878 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2024-11-19 09:58:05,878 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 20 transitions, 65 flow [2024-11-19 09:58:05,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:58:05,878 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:58:05,879 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:58:05,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 09:58:05,879 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 09:58:05,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:58:05,880 INFO L85 PathProgramCache]: Analyzing trace with hash 393761172, now seen corresponding path program 1 times [2024-11-19 09:58:05,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:58:05,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913140512] [2024-11-19 09:58:05,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:58:05,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:58:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:58:05,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:58:05,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:58:05,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913140512] [2024-11-19 09:58:05,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913140512] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:58:05,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601474971] [2024-11-19 09:58:05,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:58:05,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:58:05,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:58:05,968 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:58:05,969 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:58:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:58:06,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:58:06,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:58:06,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:58:06,099 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:58:06,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:58:06,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601474971] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:58:06,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:58:06,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-19 09:58:06,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736314480] [2024-11-19 09:58:06,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:58:06,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 09:58:06,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:58:06,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 09:58:06,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-19 09:58:06,166 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2024-11-19 09:58:06,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 20 transitions, 65 flow. Second operand has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 11 states have internal predecessors, (105), 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,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:58:06,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2024-11-19 09:58:06,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:58:06,270 INFO L124 PetriNetUnfolderBase]: 91/186 cut-off events. [2024-11-19 09:58:06,271 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-11-19 09:58:06,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 186 events. 91/186 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 632 event pairs, 46 based on Foata normal form. 9/176 useless extension candidates. Maximal degree in co-relation 436. Up to 102 conditions per place. [2024-11-19 09:58:06,272 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 20 selfloop transitions, 4 changer transitions 5/34 dead transitions. [2024-11-19 09:58:06,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 34 transitions, 155 flow [2024-11-19 09:58:06,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:58:06,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:58:06,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2024-11-19 09:58:06,274 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2024-11-19 09:58:06,274 INFO L175 Difference]: Start difference. First operand has 33 places, 20 transitions, 65 flow. Second operand 6 states and 78 transitions. [2024-11-19 09:58:06,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 34 transitions, 155 flow [2024-11-19 09:58:06,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 147 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-19 09:58:06,276 INFO L231 Difference]: Finished difference. Result has 34 places, 21 transitions, 77 flow [2024-11-19 09:58:06,276 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=77, PETRI_PLACES=34, PETRI_TRANSITIONS=21} [2024-11-19 09:58:06,277 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2024-11-19 09:58:06,277 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 21 transitions, 77 flow [2024-11-19 09:58:06,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 11 states have internal predecessors, (105), 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,279 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:58:06,279 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:58:06,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 09:58:06,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:58:06,484 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 09:58:06,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:58:06,484 INFO L85 PathProgramCache]: Analyzing trace with hash -679291390, now seen corresponding path program 2 times [2024-11-19 09:58:06,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:58:06,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195875381] [2024-11-19 09:58:06,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:58:06,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:58:06,497 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:58:06,498 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:58:06,556 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:58:06,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:58:06,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195875381] [2024-11-19 09:58:06,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195875381] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:58:06,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528501588] [2024-11-19 09:58:06,557 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:58:06,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:58:06,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:58:06,560 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:58:06,561 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:58:06,607 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:58:06,607 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:58:06,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:58:06,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:58:06,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:58:06,647 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:58:06,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528501588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:58:06,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 09:58:06,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-19 09:58:06,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595937216] [2024-11-19 09:58:06,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:58:06,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:58:06,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:58:06,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:58:06,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 09:58:06,652 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2024-11-19 09:58:06,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 21 transitions, 77 flow. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:58:06,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:58:06,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2024-11-19 09:58:06,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:58:06,743 INFO L124 PetriNetUnfolderBase]: 84/178 cut-off events. [2024-11-19 09:58:06,743 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2024-11-19 09:58:06,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 178 events. 84/178 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 532 event pairs, 20 based on Foata normal form. 12/184 useless extension candidates. Maximal degree in co-relation 450. Up to 93 conditions per place. [2024-11-19 09:58:06,744 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 21 selfloop transitions, 2 changer transitions 17/43 dead transitions. [2024-11-19 09:58:06,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 217 flow [2024-11-19 09:58:06,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:58:06,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:58:06,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2024-11-19 09:58:06,745 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-11-19 09:58:06,746 INFO L175 Difference]: Start difference. First operand has 34 places, 21 transitions, 77 flow. Second operand 8 states and 96 transitions. [2024-11-19 09:58:06,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 217 flow [2024-11-19 09:58:06,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 43 transitions, 201 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-19 09:58:06,747 INFO L231 Difference]: Finished difference. Result has 41 places, 21 transitions, 81 flow [2024-11-19 09:58:06,747 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=81, PETRI_PLACES=41, PETRI_TRANSITIONS=21} [2024-11-19 09:58:06,748 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 12 predicate places. [2024-11-19 09:58:06,748 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 21 transitions, 81 flow [2024-11-19 09:58:06,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:58:06,748 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:58:06,749 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:58:06,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 09:58:06,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:58:06,953 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 09:58:06,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:58:06,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1619799325, now seen corresponding path program 1 times [2024-11-19 09:58:06,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:58:06,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404889718] [2024-11-19 09:58:06,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:58:06,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:58:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:58:06,964 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:58:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:58:06,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 09:58:06,984 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:58:06,984 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2024-11-19 09:58:06,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2024-11-19 09:58:06,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-19 09:58:06,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-19 09:58:06,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2024-11-19 09:58:06,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 09:58:06,986 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2024-11-19 09:58:07,013 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:58:07,014 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:58:07,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:58:07 BasicIcfg [2024-11-19 09:58:07,018 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:58:07,018 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:58:07,018 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:58:07,019 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:58:07,019 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:04" (3/4) ... [2024-11-19 09:58:07,020 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 09:58:07,021 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:58:07,022 INFO L158 Benchmark]: Toolchain (without parser) took 3395.82ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 108.6MB in the beginning and 75.1MB in the end (delta: 33.4MB). Peak memory consumption was 62.6MB. Max. memory is 16.1GB. [2024-11-19 09:58:07,022 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:58:07,022 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.25ms. Allocated memory is still 142.6MB. Free memory was 108.6MB in the beginning and 86.4MB in the end (delta: 22.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-19 09:58:07,022 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.26ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 84.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:58:07,022 INFO L158 Benchmark]: Boogie Preprocessor took 26.91ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 82.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:58:07,023 INFO L158 Benchmark]: RCFGBuilder took 420.36ms. Allocated memory is still 142.6MB. Free memory was 82.2MB in the beginning and 101.8MB in the end (delta: -19.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 09:58:07,023 INFO L158 Benchmark]: TraceAbstraction took 2505.90ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 100.7MB in the beginning and 76.2MB in the end (delta: 24.5MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. [2024-11-19 09:58:07,023 INFO L158 Benchmark]: Witness Printer took 2.73ms. Allocated memory is still 172.0MB. Free memory was 76.2MB in the beginning and 75.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:58:07,024 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.13ms. Allocated memory is still 109.1MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 401.25ms. Allocated memory is still 142.6MB. Free memory was 108.6MB in the beginning and 86.4MB in the end (delta: 22.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.26ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 84.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.91ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 82.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 420.36ms. Allocated memory is still 142.6MB. Free memory was 82.2MB in the beginning and 101.8MB in the end (delta: -19.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2505.90ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 100.7MB in the beginning and 76.2MB in the end (delta: 24.5MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. * Witness Printer took 2.73ms. Allocated memory is still 172.0MB. Free memory was 76.2MB in the beginning and 75.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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; [L770] 0 _N = 1 [L771] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff / 2) [L750] COND FALSE 0 !(!cond) [L771] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff / 2) [L772] 0 limit = _N VAL [_N=1, limit=1] [L773] 0 int i = 0; VAL [_N=1, i=0, limit=1] [L773] COND TRUE 0 i < _N [L774] 0 pthread_t t; [L775] FCALL, FORK 0 pthread_create(&t, 0, f1, 0) VAL [\old(arg)={0:0}, _N=1, i=0, limit=1, t=-1] [L757] 1 int l; [L758] 1 l = limit VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=1] [L773] 0 ++i VAL [\old(arg)={0:0}, _N=1, arg={0:0}, i=1, l=1, limit=1] [L773] COND FALSE 0 !(i < _N) [L777] 0 pthread_t t; [L778] FCALL, FORK 0 pthread_create(&t, 0, f2, 0) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=1, t=0] [L759] 1 limit = l + 1 VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=2] [L763] 2 int i, bound; [L764] 2 bound = limit [L765] 2 i = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=0, l=1, limit=2] [L765] COND TRUE 2 i < bound [L765] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=1, l=1, limit=2] [L765] COND TRUE 2 i < bound [L765] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=2, l=1, limit=2] [L765] COND FALSE 2 !(i < bound) [L766] CALL 2 __VERIFIER_assert(i != 2 * _N) [L753] COND TRUE 2 !expression [L753] CALL 2 reach_error() [L752] COND FALSE 2 !(0) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=2] [L752] 2 __assert_fail ("0", "generated/unwind3.h", 11, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=2] - UnprovableResult [Line: 769]: 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: 775]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 39 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.4s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 168 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 155 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 375 IncrementalHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 7 mSDtfsCounter, 375 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=6, InterpolantAutomatonStates: 32, 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, 0.7s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 354 SizeOfPredicates, 7 NumberOfNonLiveVariables, 217 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 15/20 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:07,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-theta/unwind3-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 ac23e7ddc6ad8a4019915da456e24c280b09a2b1564c0f5287e162f39d98d7fe --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:58:08,834 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:58:08,898 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:08,903 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:58:08,904 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:58:08,930 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:58:08,933 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:58:08,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:58:08,934 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:58:08,934 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:58:08,935 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:58:08,935 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:58:08,935 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:58:08,936 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:58:08,937 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:58:08,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:58:08,938 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:58:08,939 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:58:08,939 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:58:08,939 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:58:08,940 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:58:08,942 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:58:08,942 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:58:08,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:58:08,942 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:58:08,942 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 09:58:08,943 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:58:08,943 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 09:58:08,943 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:58:08,943 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:58:08,943 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:58:08,943 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:58:08,944 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:58:08,944 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:58:08,944 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:58:08,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:58:08,944 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:58:08,944 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:58:08,944 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 09:58:08,945 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 09:58:08,945 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:58:08,946 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:58:08,946 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:58:08,946 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:58:08,946 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 -> ac23e7ddc6ad8a4019915da456e24c280b09a2b1564c0f5287e162f39d98d7fe [2024-11-19 09:58:09,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:58:09,216 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:58:09,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:58:09,219 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:58:09,220 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:58:09,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind3-1.i [2024-11-19 09:58:10,465 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:58:10,675 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:58:10,676 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-1.i [2024-11-19 09:58:10,690 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0576ee77a/82550b8459cd4ab3807f0e1bc53a1447/FLAGc9c496f5d [2024-11-19 09:58:11,022 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0576ee77a/82550b8459cd4ab3807f0e1bc53a1447 [2024-11-19 09:58:11,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:58:11,025 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:58:11,027 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:58:11,027 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:58:11,031 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:58:11,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:58:11" (1/1) ... [2024-11-19 09:58:11,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac3c94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:11, skipping insertion in model container [2024-11-19 09:58:11,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:58:11" (1/1) ... [2024-11-19 09:58:11,061 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:58:11,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:58:11,386 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:58:11,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:58:11,469 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:58:11,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:11 WrapperNode [2024-11-19 09:58:11,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:58:11,470 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:58:11,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:58:11,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:58:11,475 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:11" (1/1) ... [2024-11-19 09:58:11,490 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:11" (1/1) ... [2024-11-19 09:58:11,508 INFO L138 Inliner]: procedures = 170, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 67 [2024-11-19 09:58:11,509 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:58:11,510 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:58:11,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:58:11,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:58:11,518 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:11" (1/1) ... [2024-11-19 09:58:11,519 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:11" (1/1) ... [2024-11-19 09:58:11,522 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:11" (1/1) ... [2024-11-19 09:58:11,537 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:11,538 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:11" (1/1) ... [2024-11-19 09:58:11,538 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:11" (1/1) ... [2024-11-19 09:58:11,544 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:11" (1/1) ... [2024-11-19 09:58:11,550 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:11" (1/1) ... [2024-11-19 09:58:11,551 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:11" (1/1) ... [2024-11-19 09:58:11,552 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:11" (1/1) ... [2024-11-19 09:58:11,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:58:11,559 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:58:11,559 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:58:11,559 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:58:11,560 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:11" (1/1) ... [2024-11-19 09:58:11,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:58:11,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:58:11,592 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:58:11,595 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:11,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:58:11,632 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-19 09:58:11,632 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-19 09:58:11,632 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-19 09:58:11,632 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-19 09:58:11,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 09:58:11,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:58:11,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:58:11,633 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:11,736 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:58:11,738 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:58:11,864 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:58:11,865 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:58:11,980 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:58:11,980 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 09:58:11,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:58:11 BoogieIcfgContainer [2024-11-19 09:58:11,981 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:58:11,982 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:58:11,983 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:58:11,985 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:58:11,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:58:11" (1/3) ... [2024-11-19 09:58:11,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b052713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:58:11, skipping insertion in model container [2024-11-19 09:58:11,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:58:11" (2/3) ... [2024-11-19 09:58:11,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b052713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:58:11, skipping insertion in model container [2024-11-19 09:58:11,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:58:11" (3/3) ... [2024-11-19 09:58:11,989 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind3-1.i [2024-11-19 09:58:12,001 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:58:12,002 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 09:58:12,002 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:58:12,038 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 09:58:12,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 62 flow [2024-11-19 09:58:12,095 INFO L124 PetriNetUnfolderBase]: 6/43 cut-off events. [2024-11-19 09:58:12,095 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:58:12,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 43 events. 6/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 102 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 23. Up to 4 conditions per place. [2024-11-19 09:58:12,102 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 62 flow [2024-11-19 09:58:12,104 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 59 flow [2024-11-19 09:58:12,113 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:58:12,118 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;@775639d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:58:12,119 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-19 09:58:12,126 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:58:12,126 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2024-11-19 09:58:12,126 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:58:12,126 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:58:12,126 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:58:12,127 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 09:58:12,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:58:12,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1591382737, now seen corresponding path program 1 times [2024-11-19 09:58:12,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:58:12,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704634074] [2024-11-19 09:58:12,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:58:12,140 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:12,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:58:12,142 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:12,143 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:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:58:12,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:58:12,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:58:12,279 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:12,279 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:58:12,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:58:12,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1704634074] [2024-11-19 09:58:12,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1704634074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:58:12,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:58:12,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:58:12,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836641484] [2024-11-19 09:58:12,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:58:12,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:58:12,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:58:12,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:58:12,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:58:12,321 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2024-11-19 09:58:12,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 59 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:58:12,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:58:12,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2024-11-19 09:58:12,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:58:12,410 INFO L124 PetriNetUnfolderBase]: 69/163 cut-off events. [2024-11-19 09:58:12,410 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 09:58:12,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 163 events. 69/163 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 609 event pairs, 41 based on Foata normal form. 18/166 useless extension candidates. Maximal degree in co-relation 287. Up to 124 conditions per place. [2024-11-19 09:58:12,414 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 16 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2024-11-19 09:58:12,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 26 transitions, 97 flow [2024-11-19 09:58:12,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:58:12,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:58:12,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2024-11-19 09:58:12,422 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-19 09:58:12,424 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 59 flow. Second operand 4 states and 54 transitions. [2024-11-19 09:58:12,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 26 transitions, 97 flow [2024-11-19 09:58:12,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 96 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:58:12,427 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 62 flow [2024-11-19 09:58:12,428 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=62, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2024-11-19 09:58:12,432 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2024-11-19 09:58:12,432 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 62 flow [2024-11-19 09:58:12,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:58:12,433 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:58:12,433 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-19 09:58:12,437 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:12,635 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:12,636 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 09:58:12,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:58:12,636 INFO L85 PathProgramCache]: Analyzing trace with hash 2087232685, now seen corresponding path program 1 times [2024-11-19 09:58:12,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:58:12,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [696798013] [2024-11-19 09:58:12,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:58:12,637 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:12,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:58:12,640 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:12,641 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:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:58:12,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:58:12,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:58:12,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:58:12,745 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:58:12,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:58:12,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:58:12,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [696798013] [2024-11-19 09:58:12,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [696798013] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:58:12,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:58:12,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-19 09:58:12,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144094610] [2024-11-19 09:58:12,783 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:58:12,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 09:58:12,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:58:12,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 09:58:12,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-19 09:58:12,798 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2024-11-19 09:58:12,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 62 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:58:12,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:58:12,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2024-11-19 09:58:12,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:58:12,893 INFO L124 PetriNetUnfolderBase]: 67/156 cut-off events. [2024-11-19 09:58:12,893 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-19 09:58:12,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 156 events. 67/156 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 581 event pairs, 24 based on Foata normal form. 3/147 useless extension candidates. Maximal degree in co-relation 286. Up to 114 conditions per place. [2024-11-19 09:58:12,895 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 16 selfloop transitions, 4 changer transitions 0/26 dead transitions. [2024-11-19 09:58:12,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 26 transitions, 107 flow [2024-11-19 09:58:12,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:58:12,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:58:12,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2024-11-19 09:58:12,896 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45185185185185184 [2024-11-19 09:58:12,896 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 62 flow. Second operand 5 states and 61 transitions. [2024-11-19 09:58:12,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 26 transitions, 107 flow [2024-11-19 09:58:12,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 100 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:58:12,898 INFO L231 Difference]: Finished difference. Result has 31 places, 22 transitions, 64 flow [2024-11-19 09:58:12,898 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=64, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2024-11-19 09:58:12,899 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2024-11-19 09:58:12,899 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 64 flow [2024-11-19 09:58:12,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:58:12,899 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:58:12,900 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:58:12,904 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:13,101 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:13,102 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 09:58:13,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:58:13,102 INFO L85 PathProgramCache]: Analyzing trace with hash 80922212, now seen corresponding path program 1 times [2024-11-19 09:58:13,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:58:13,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [50410232] [2024-11-19 09:58:13,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:58:13,103 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:13,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:58:13,106 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:13,107 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:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:58:13,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:58:13,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:58:13,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:58:13,171 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:58:13,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:58:13,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [50410232] [2024-11-19 09:58:13,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [50410232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:58:13,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:58:13,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:58:13,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266391498] [2024-11-19 09:58:13,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:58:13,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:58:13,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:58:13,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:58:13,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:58:13,172 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2024-11-19 09:58:13,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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:13,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:58:13,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2024-11-19 09:58:13,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:58:13,229 INFO L124 PetriNetUnfolderBase]: 67/151 cut-off events. [2024-11-19 09:58:13,229 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-11-19 09:58:13,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 151 events. 67/151 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 538 event pairs, 58 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 287. Up to 123 conditions per place. [2024-11-19 09:58:13,230 INFO L140 encePairwiseOnDemand]: 25/27 looper letters, 13 selfloop transitions, 1 changer transitions 1/21 dead transitions. [2024-11-19 09:58:13,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 21 transitions, 92 flow [2024-11-19 09:58:13,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:58:13,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:58:13,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2024-11-19 09:58:13,232 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49382716049382713 [2024-11-19 09:58:13,233 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 64 flow. Second operand 3 states and 40 transitions. [2024-11-19 09:58:13,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 21 transitions, 92 flow [2024-11-19 09:58:13,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 21 transitions, 82 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-11-19 09:58:13,233 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 52 flow [2024-11-19 09:58:13,234 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2024-11-19 09:58:13,234 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, -1 predicate places. [2024-11-19 09:58:13,234 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 20 transitions, 52 flow [2024-11-19 09:58:13,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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:13,234 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:58:13,234 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:58:13,237 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:13,435 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:13,435 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 09:58:13,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:58:13,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1281374788, now seen corresponding path program 1 times [2024-11-19 09:58:13,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:58:13,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [447332723] [2024-11-19 09:58:13,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:58:13,437 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:13,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:58:13,438 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:13,439 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:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:58:13,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:58:13,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:58:13,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:58:13,528 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:58:13,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:58:13,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [447332723] [2024-11-19 09:58:13,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [447332723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:58:13,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:58:13,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:58:13,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560576117] [2024-11-19 09:58:13,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:58:13,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:58:13,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:58:13,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:58:13,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:58:13,534 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2024-11-19 09:58:13,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 20 transitions, 52 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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:13,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:58:13,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2024-11-19 09:58:13,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:58:13,642 INFO L124 PetriNetUnfolderBase]: 95/207 cut-off events. [2024-11-19 09:58:13,642 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-19 09:58:13,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 207 events. 95/207 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 753 event pairs, 35 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 394. Up to 83 conditions per place. [2024-11-19 09:58:13,645 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 27 selfloop transitions, 7 changer transitions 0/38 dead transitions. [2024-11-19 09:58:13,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 38 transitions, 162 flow [2024-11-19 09:58:13,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:58:13,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:58:13,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2024-11-19 09:58:13,647 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2024-11-19 09:58:13,647 INFO L175 Difference]: Start difference. First operand has 28 places, 20 transitions, 52 flow. Second operand 6 states and 78 transitions. [2024-11-19 09:58:13,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 38 transitions, 162 flow [2024-11-19 09:58:13,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 38 transitions, 161 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:58:13,650 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 92 flow [2024-11-19 09:58:13,651 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=92, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2024-11-19 09:58:13,652 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2024-11-19 09:58:13,652 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 92 flow [2024-11-19 09:58:13,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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:13,652 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:58:13,652 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:58:13,656 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:13,853 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:13,853 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 09:58:13,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:58:13,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1066926932, now seen corresponding path program 1 times [2024-11-19 09:58:13,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:58:13,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1190743982] [2024-11-19 09:58:13,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:58:13,854 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:13,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:58:13,855 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:13,857 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:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:58:13,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:58:13,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:58:13,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:58:13,949 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:58:14,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:58:14,074 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:58:14,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1190743982] [2024-11-19 09:58:14,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1190743982] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:58:14,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:58:14,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-19 09:58:14,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128243309] [2024-11-19 09:58:14,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:58:14,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 09:58:14,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:58:14,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 09:58:14,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 09:58:14,077 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2024-11-19 09:58:14,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 92 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:58:14,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:58:14,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2024-11-19 09:58:14,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:58:15,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-19 09:58:16,147 INFO L124 PetriNetUnfolderBase]: 233/469 cut-off events. [2024-11-19 09:58:16,147 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2024-11-19 09:58:16,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1130 conditions, 469 events. 233/469 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2205 event pairs, 43 based on Foata normal form. 0/402 useless extension candidates. Maximal degree in co-relation 1119. Up to 103 conditions per place. [2024-11-19 09:58:16,150 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 33 selfloop transitions, 8 changer transitions 26/73 dead transitions. [2024-11-19 09:58:16,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 73 transitions, 356 flow [2024-11-19 09:58:16,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 09:58:16,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 09:58:16,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 154 transitions. [2024-11-19 09:58:16,152 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2024-11-19 09:58:16,152 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 92 flow. Second operand 11 states and 154 transitions. [2024-11-19 09:58:16,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 73 transitions, 356 flow [2024-11-19 09:58:16,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 73 transitions, 347 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-19 09:58:16,155 INFO L231 Difference]: Finished difference. Result has 46 places, 27 transitions, 137 flow [2024-11-19 09:58:16,155 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=137, PETRI_PLACES=46, PETRI_TRANSITIONS=27} [2024-11-19 09:58:16,156 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 17 predicate places. [2024-11-19 09:58:16,156 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 27 transitions, 137 flow [2024-11-19 09:58:16,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:58:16,156 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:58:16,156 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:58:16,160 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:16,357 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:16,357 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 09:58:16,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:58:16,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1777140703, now seen corresponding path program 1 times [2024-11-19 09:58:16,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:58:16,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735762845] [2024-11-19 09:58:16,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:58:16,358 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:16,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:58:16,359 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:16,360 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:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:58:16,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:58:16,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:58:16,443 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:16,443 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:58:16,511 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:16,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:58:16,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735762845] [2024-11-19 09:58:16,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735762845] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:58:16,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:58:16,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-19 09:58:16,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025862809] [2024-11-19 09:58:16,512 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:58:16,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 09:58:16,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:58:16,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 09:58:16,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-19 09:58:16,518 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2024-11-19 09:58:16,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 27 transitions, 137 flow. Second operand has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:58:16,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:58:16,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2024-11-19 09:58:16,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:58:16,732 INFO L124 PetriNetUnfolderBase]: 194/354 cut-off events. [2024-11-19 09:58:16,733 INFO L125 PetriNetUnfolderBase]: For 621/621 co-relation queries the response was YES. [2024-11-19 09:58:16,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1165 conditions, 354 events. 194/354 cut-off events. For 621/621 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1402 event pairs, 16 based on Foata normal form. 6/360 useless extension candidates. Maximal degree in co-relation 1151. Up to 162 conditions per place. [2024-11-19 09:58:16,735 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 46 selfloop transitions, 14 changer transitions 0/63 dead transitions. [2024-11-19 09:58:16,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 63 transitions, 437 flow [2024-11-19 09:58:16,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:58:16,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 09:58:16,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-11-19 09:58:16,737 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44814814814814813 [2024-11-19 09:58:16,737 INFO L175 Difference]: Start difference. First operand has 46 places, 27 transitions, 137 flow. Second operand 10 states and 121 transitions. [2024-11-19 09:58:16,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 63 transitions, 437 flow [2024-11-19 09:58:16,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 63 transitions, 381 flow, removed 28 selfloop flow, removed 2 redundant places. [2024-11-19 09:58:16,742 INFO L231 Difference]: Finished difference. Result has 49 places, 31 transitions, 177 flow [2024-11-19 09:58:16,742 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=177, PETRI_PLACES=49, PETRI_TRANSITIONS=31} [2024-11-19 09:58:16,743 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 20 predicate places. [2024-11-19 09:58:16,744 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 31 transitions, 177 flow [2024-11-19 09:58:16,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:58:16,744 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:58:16,745 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:58:16,749 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:16,945 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:16,945 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 09:58:16,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:58:16,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1285989308, now seen corresponding path program 2 times [2024-11-19 09:58:16,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:58:16,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [417023160] [2024-11-19 09:58:16,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:58:16,946 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:16,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:58:16,947 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:16,948 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:16,983 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:58:16,984 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:58:16,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:58:16,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:58:17,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:58:17,026 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:58:17,072 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:58:17,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:58:17,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [417023160] [2024-11-19 09:58:17,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [417023160] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:58:17,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:58:17,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-11-19 09:58:17,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60088719] [2024-11-19 09:58:17,073 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:58:17,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 09:58:17,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:58:17,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 09:58:17,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:58:17,076 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2024-11-19 09:58:17,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 31 transitions, 177 flow. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:58:17,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:58:17,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2024-11-19 09:58:17,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:58:17,262 INFO L124 PetriNetUnfolderBase]: 112/242 cut-off events. [2024-11-19 09:58:17,262 INFO L125 PetriNetUnfolderBase]: For 355/355 co-relation queries the response was YES. [2024-11-19 09:58:17,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 242 events. 112/242 cut-off events. For 355/355 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 813 event pairs, 20 based on Foata normal form. 12/254 useless extension candidates. Maximal degree in co-relation 739. Up to 93 conditions per place. [2024-11-19 09:58:17,263 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 24 selfloop transitions, 4 changer transitions 19/50 dead transitions. [2024-11-19 09:58:17,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 50 transitions, 318 flow [2024-11-19 09:58:17,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:58:17,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 09:58:17,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-11-19 09:58:17,265 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4185185185185185 [2024-11-19 09:58:17,265 INFO L175 Difference]: Start difference. First operand has 49 places, 31 transitions, 177 flow. Second operand 10 states and 113 transitions. [2024-11-19 09:58:17,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 50 transitions, 318 flow [2024-11-19 09:58:17,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 50 transitions, 273 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-11-19 09:58:17,267 INFO L231 Difference]: Finished difference. Result has 50 places, 23 transitions, 102 flow [2024-11-19 09:58:17,267 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=102, PETRI_PLACES=50, PETRI_TRANSITIONS=23} [2024-11-19 09:58:17,268 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 21 predicate places. [2024-11-19 09:58:17,268 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 23 transitions, 102 flow [2024-11-19 09:58:17,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:58:17,268 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:58:17,268 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:58:17,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-19 09:58:17,471 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:17,471 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 09:58:17,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:58:17,472 INFO L85 PathProgramCache]: Analyzing trace with hash 618180851, now seen corresponding path program 1 times [2024-11-19 09:58:17,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:58:17,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917823775] [2024-11-19 09:58:17,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:58:17,472 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:17,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:58:17,473 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:17,474 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:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:58:17,509 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:58:17,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:58:17,546 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-19 09:58:17,546 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:58:17,547 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2024-11-19 09:58:17,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2024-11-19 09:58:17,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-19 09:58:17,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-19 09:58:17,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2024-11-19 09:58:17,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-19 09:58:17,751 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:17,752 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-11-19 09:58:17,776 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:58:17,776 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:58:17,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:58:17 BasicIcfg [2024-11-19 09:58:17,779 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:58:17,780 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:58:17,780 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:58:17,780 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:58:17,780 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:11" (3/4) ... [2024-11-19 09:58:17,783 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 09:58:17,784 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:58:17,784 INFO L158 Benchmark]: Toolchain (without parser) took 6759.26ms. Allocated memory was 73.4MB in the beginning and 92.3MB in the end (delta: 18.9MB). Free memory was 39.7MB in the beginning and 49.5MB in the end (delta: -9.9MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2024-11-19 09:58:17,784 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 54.5MB. Free memory is still 37.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:58:17,784 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.09ms. Allocated memory is still 73.4MB. Free memory was 39.3MB in the beginning and 44.5MB in the end (delta: -5.2MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2024-11-19 09:58:17,785 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.14ms. Allocated memory is still 73.4MB. Free memory was 44.5MB in the beginning and 42.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:58:17,785 INFO L158 Benchmark]: Boogie Preprocessor took 48.28ms. Allocated memory is still 73.4MB. Free memory was 42.4MB in the beginning and 40.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:58:17,785 INFO L158 Benchmark]: RCFGBuilder took 422.03ms. Allocated memory is still 73.4MB. Free memory was 39.9MB in the beginning and 40.0MB in the end (delta: -80.0kB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2024-11-19 09:58:17,785 INFO L158 Benchmark]: TraceAbstraction took 5797.29ms. Allocated memory was 73.4MB in the beginning and 92.3MB in the end (delta: 18.9MB). Free memory was 39.6MB in the beginning and 50.3MB in the end (delta: -10.7MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2024-11-19 09:58:17,785 INFO L158 Benchmark]: Witness Printer took 4.07ms. Allocated memory is still 92.3MB. Free memory was 50.3MB in the beginning and 49.5MB in the end (delta: 757.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:58:17,787 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.16ms. Allocated memory is still 54.5MB. Free memory is still 37.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 443.09ms. Allocated memory is still 73.4MB. Free memory was 39.3MB in the beginning and 44.5MB in the end (delta: -5.2MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.14ms. Allocated memory is still 73.4MB. Free memory was 44.5MB in the beginning and 42.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.28ms. Allocated memory is still 73.4MB. Free memory was 42.4MB in the beginning and 40.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 422.03ms. Allocated memory is still 73.4MB. Free memory was 39.9MB in the beginning and 40.0MB in the end (delta: -80.0kB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5797.29ms. Allocated memory was 73.4MB in the beginning and 92.3MB in the end (delta: 18.9MB). Free memory was 39.6MB in the beginning and 50.3MB in the end (delta: -10.7MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * Witness Printer took 4.07ms. Allocated memory is still 92.3MB. Free memory was 50.3MB in the beginning and 49.5MB in the end (delta: 757.3kB). 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; [L770] 0 _N = 1 [L771] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff / 2) [L750] COND FALSE 0 !(!cond) [L771] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff / 2) [L772] 0 limit = _N VAL [_N=1, limit=1] [L773] 0 int i = 0; VAL [_N=1, i=0, limit=1] [L773] COND TRUE 0 i < _N [L774] 0 pthread_t t; [L775] FCALL, FORK 0 pthread_create(&t, 0, f1, 0) VAL [\old(arg)={0:0}, _N=1, i=0, limit=1, t=-1] [L773] 0 ++i VAL [\old(arg)={0:0}, _N=1, i=1, limit=1] [L757] 1 int l; [L758] 1 l = limit VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=1] [L773] COND FALSE 0 !(i < _N) [L777] 0 pthread_t t; [L778] FCALL, FORK 0 pthread_create(&t, 0, f2, 0) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=1, t=0] [L759] 1 limit = l + 1 VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=2] [L763] 2 int i, bound; [L764] 2 bound = limit [L765] 2 i = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=0, l=1, limit=2] [L765] COND TRUE 2 i < bound [L765] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=1, l=1, limit=2] [L765] COND TRUE 2 i < bound [L765] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=1, arg={0:0}, arg={0:0}, bound=2, i=2, l=1, limit=2] [L765] COND FALSE 2 !(i < bound) [L766] CALL 2 __VERIFIER_assert(i != 2 * _N) [L753] COND TRUE 2 !expression [L753] CALL 2 reach_error() [L752] COND FALSE 2 !(0) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=2] [L752] 2 __assert_fail ("0", "generated/unwind3.h", 11, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, _N=1, arg={0:0}, l=1, limit=2] - UnprovableResult [Line: 769]: 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: 775]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 39 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.7s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 373 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 368 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 591 IncrementalHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 8 mSDtfsCounter, 591 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=6, InterpolantAutomatonStates: 49, 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, 0.6s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 123 ConstructedInterpolants, 2 QuantifiedInterpolants, 374 SizeOfPredicates, 12 NumberOfNonLiveVariables, 286 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 12/20 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:17,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample