./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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-wip.dd.update-z3-fca748b-m [2024-11-20 17:53:05,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 17:53:05,984 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 17:53:05,989 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 17:53:05,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 17:53:06,016 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 17:53:06,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 17:53:06,017 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 17:53:06,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 17:53:06,017 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 17:53:06,018 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 17:53:06,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 17:53:06,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 17:53:06,018 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 17:53:06,019 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 17:53:06,019 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 17:53:06,019 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 17:53:06,020 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 17:53:06,020 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 17:53:06,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 17:53:06,020 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 17:53:06,021 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 17:53:06,021 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 17:53:06,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 17:53:06,021 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 17:53:06,022 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 17:53:06,022 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 17:53:06,022 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 17:53:06,023 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 17:53:06,023 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 17:53:06,023 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 17:53:06,023 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 17:53:06,024 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 17:53:06,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:53:06,024 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 17:53:06,024 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 17:53:06,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 17:53:06,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 17:53:06,025 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 17:53:06,025 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 17:53:06,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 17:53:06,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 17:53:06,026 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-20 17:53:06,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 17:53:06,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 17:53:06,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 17:53:06,271 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 17:53:06,272 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 17:53:06,273 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-1.i [2024-11-20 17:53:07,559 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 17:53:07,765 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 17:53:07,766 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-1.i [2024-11-20 17:53:07,781 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38e599c33/29f073a6855d49f892e9f95db1f24798/FLAGdd65a1080 [2024-11-20 17:53:07,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38e599c33/29f073a6855d49f892e9f95db1f24798 [2024-11-20 17:53:07,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 17:53:07,800 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 17:53:07,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 17:53:07,802 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 17:53:07,806 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 17:53:07,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:53:07" (1/1) ... [2024-11-20 17:53:07,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3708dd32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:07, skipping insertion in model container [2024-11-20 17:53:07,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:53:07" (1/1) ... [2024-11-20 17:53:07,845 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 17:53:08,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:53:08,162 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 17:53:08,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:53:08,235 INFO L204 MainTranslator]: Completed translation [2024-11-20 17:53:08,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:08 WrapperNode [2024-11-20 17:53:08,235 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 17:53:08,236 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 17:53:08,236 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 17:53:08,236 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 17:53:08,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:08" (1/1) ... [2024-11-20 17:53:08,273 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:08" (1/1) ... [2024-11-20 17:53:08,296 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 66 [2024-11-20 17:53:08,297 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 17:53:08,298 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 17:53:08,299 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 17:53:08,299 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 17:53:08,306 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:08" (1/1) ... [2024-11-20 17:53:08,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:08" (1/1) ... [2024-11-20 17:53:08,311 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:08" (1/1) ... [2024-11-20 17:53:08,331 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-20 17:53:08,331 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:08" (1/1) ... [2024-11-20 17:53:08,331 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:08" (1/1) ... [2024-11-20 17:53:08,335 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:08" (1/1) ... [2024-11-20 17:53:08,340 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:08" (1/1) ... [2024-11-20 17:53:08,342 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:08" (1/1) ... [2024-11-20 17:53:08,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:08" (1/1) ... [2024-11-20 17:53:08,348 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 17:53:08,349 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 17:53:08,349 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 17:53:08,349 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 17:53:08,350 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:08" (1/1) ... [2024-11-20 17:53:08,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:53:08,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:53:08,403 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-20 17:53:08,407 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-20 17:53:08,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 17:53:08,443 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-20 17:53:08,443 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-20 17:53:08,443 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-20 17:53:08,443 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-20 17:53:08,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 17:53:08,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 17:53:08,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 17:53:08,445 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 17:53:08,536 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 17:53:08,537 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 17:53:08,634 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 17:53:08,634 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 17:53:08,706 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 17:53:08,706 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-20 17:53:08,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:53:08 BoogieIcfgContainer [2024-11-20 17:53:08,707 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 17:53:08,709 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 17:53:08,709 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 17:53:08,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 17:53:08,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:53:07" (1/3) ... [2024-11-20 17:53:08,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8448e48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:53:08, skipping insertion in model container [2024-11-20 17:53:08,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:08" (2/3) ... [2024-11-20 17:53:08,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8448e48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:53:08, skipping insertion in model container [2024-11-20 17:53:08,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:53:08" (3/3) ... [2024-11-20 17:53:08,713 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind3-1.i [2024-11-20 17:53:08,725 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 17:53:08,726 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 17:53:08,726 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 17:53:08,753 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-20 17:53:08,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 62 flow [2024-11-20 17:53:08,798 INFO L124 PetriNetUnfolderBase]: 6/43 cut-off events. [2024-11-20 17:53:08,799 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 17:53:08,801 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-20 17:53:08,801 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 62 flow [2024-11-20 17:53:08,804 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 59 flow [2024-11-20 17:53:08,810 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 17:53:08,815 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;@6e83b898, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 17:53:08,815 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-20 17:53:08,821 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 17:53:08,821 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2024-11-20 17:53:08,821 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 17:53:08,821 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:53:08,822 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:53:08,822 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-20 17:53:08,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:53:08,827 INFO L85 PathProgramCache]: Analyzing trace with hash -242791537, now seen corresponding path program 1 times [2024-11-20 17:53:08,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:53:08,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021944494] [2024-11-20 17:53:08,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:53:08,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:53:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:53:09,071 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-20 17:53:09,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:53:09,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021944494] [2024-11-20 17:53:09,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021944494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:53:09,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:53:09,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:53:09,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714296987] [2024-11-20 17:53:09,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:53:09,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:53:09,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:53:09,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:53:09,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:53:09,106 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2024-11-20 17:53:09,107 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-20 17:53:09,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:53:09,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2024-11-20 17:53:09,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:53:09,168 INFO L124 PetriNetUnfolderBase]: 69/163 cut-off events. [2024-11-20 17:53:09,168 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-20 17:53:09,169 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-20 17:53:09,171 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 16 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2024-11-20 17:53:09,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 26 transitions, 97 flow [2024-11-20 17:53:09,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:53:09,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 17:53:09,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2024-11-20 17:53:09,180 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-20 17:53:09,181 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 59 flow. Second operand 4 states and 54 transitions. [2024-11-20 17:53:09,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 26 transitions, 97 flow [2024-11-20 17:53:09,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 96 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 17:53:09,185 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 62 flow [2024-11-20 17:53:09,186 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-20 17:53:09,189 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2024-11-20 17:53:09,189 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 62 flow [2024-11-20 17:53:09,189 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-20 17:53:09,189 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:53:09,190 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-20 17:53:09,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 17:53:09,190 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-20 17:53:09,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:53:09,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1062405037, now seen corresponding path program 1 times [2024-11-20 17:53:09,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:53:09,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201492045] [2024-11-20 17:53:09,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:53:09,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:53:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:53:09,273 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-20 17:53:09,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:53:09,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201492045] [2024-11-20 17:53:09,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201492045] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:53:09,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611878302] [2024-11-20 17:53:09,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:53:09,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:53:09,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:53:09,279 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-20 17:53:09,280 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-20 17:53:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:53:09,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 17:53:09,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:53:09,398 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-20 17:53:09,399 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:53:09,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611878302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:53:09,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 17:53:09,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-20 17:53:09,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713611617] [2024-11-20 17:53:09,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:53:09,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:53:09,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:53:09,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:53:09,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 17:53:09,407 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2024-11-20 17:53:09,408 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-20 17:53:09,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:53:09,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2024-11-20 17:53:09,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:53:09,454 INFO L124 PetriNetUnfolderBase]: 67/156 cut-off events. [2024-11-20 17:53:09,454 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-20 17:53:09,455 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-20 17:53:09,456 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 16 selfloop transitions, 4 changer transitions 0/26 dead transitions. [2024-11-20 17:53:09,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 26 transitions, 107 flow [2024-11-20 17:53:09,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:53:09,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 17:53:09,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2024-11-20 17:53:09,457 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45185185185185184 [2024-11-20 17:53:09,457 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 62 flow. Second operand 5 states and 61 transitions. [2024-11-20 17:53:09,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 26 transitions, 107 flow [2024-11-20 17:53:09,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 100 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-20 17:53:09,458 INFO L231 Difference]: Finished difference. Result has 31 places, 22 transitions, 64 flow [2024-11-20 17:53:09,458 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-20 17:53:09,459 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2024-11-20 17:53:09,459 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 64 flow [2024-11-20 17:53:09,459 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-20 17:53:09,459 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:53:09,459 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:53:09,467 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-20 17:53:09,663 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-20 17:53:09,664 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-20 17:53:09,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:53:09,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1230936796, now seen corresponding path program 1 times [2024-11-20 17:53:09,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:53:09,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142926839] [2024-11-20 17:53:09,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:53:09,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:53:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:53:09,699 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-20 17:53:09,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:53:09,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142926839] [2024-11-20 17:53:09,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142926839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:53:09,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:53:09,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 17:53:09,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490112611] [2024-11-20 17:53:09,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:53:09,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:53:09,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:53:09,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:53:09,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:53:09,702 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2024-11-20 17:53:09,702 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-20 17:53:09,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:53:09,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2024-11-20 17:53:09,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:53:09,727 INFO L124 PetriNetUnfolderBase]: 67/151 cut-off events. [2024-11-20 17:53:09,728 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-11-20 17:53:09,728 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-20 17:53:09,729 INFO L140 encePairwiseOnDemand]: 25/27 looper letters, 13 selfloop transitions, 1 changer transitions 1/21 dead transitions. [2024-11-20 17:53:09,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 21 transitions, 92 flow [2024-11-20 17:53:09,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:53:09,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:53:09,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2024-11-20 17:53:09,731 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49382716049382713 [2024-11-20 17:53:09,731 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 64 flow. Second operand 3 states and 40 transitions. [2024-11-20 17:53:09,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 21 transitions, 92 flow [2024-11-20 17:53:09,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 21 transitions, 82 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-11-20 17:53:09,732 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 52 flow [2024-11-20 17:53:09,732 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-20 17:53:09,732 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, -1 predicate places. [2024-11-20 17:53:09,732 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 20 transitions, 52 flow [2024-11-20 17:53:09,733 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-20 17:53:09,733 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:53:09,733 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:53:09,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 17:53:09,733 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-20 17:53:09,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:53:09,734 INFO L85 PathProgramCache]: Analyzing trace with hash -402908222, now seen corresponding path program 1 times [2024-11-20 17:53:09,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:53:09,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801548786] [2024-11-20 17:53:09,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:53:09,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:53:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:53:09,806 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-20 17:53:09,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:53:09,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801548786] [2024-11-20 17:53:09,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801548786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:53:09,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:53:09,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:53:09,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338102133] [2024-11-20 17:53:09,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:53:09,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:53:09,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:53:09,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:53:09,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:53:09,814 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2024-11-20 17:53:09,814 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-20 17:53:09,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:53:09,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2024-11-20 17:53:09,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:53:09,901 INFO L124 PetriNetUnfolderBase]: 103/207 cut-off events. [2024-11-20 17:53:09,901 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-20 17:53:09,902 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-20 17:53:09,904 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 16 selfloop transitions, 3 changer transitions 11/35 dead transitions. [2024-11-20 17:53:09,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 35 transitions, 142 flow [2024-11-20 17:53:09,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:53:09,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 17:53:09,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2024-11-20 17:53:09,906 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4876543209876543 [2024-11-20 17:53:09,906 INFO L175 Difference]: Start difference. First operand has 28 places, 20 transitions, 52 flow. Second operand 6 states and 79 transitions. [2024-11-20 17:53:09,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 35 transitions, 142 flow [2024-11-20 17:53:09,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 35 transitions, 141 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 17:53:09,908 INFO L231 Difference]: Finished difference. Result has 33 places, 20 transitions, 65 flow [2024-11-20 17:53:09,909 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-20 17:53:09,909 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2024-11-20 17:53:09,909 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 20 transitions, 65 flow [2024-11-20 17:53:09,909 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-20 17:53:09,909 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:53:09,909 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:53:09,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 17:53:09,910 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-20 17:53:09,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:53:09,910 INFO L85 PathProgramCache]: Analyzing trace with hash 393761172, now seen corresponding path program 1 times [2024-11-20 17:53:09,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:53:09,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989918013] [2024-11-20 17:53:09,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:53:09,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:53:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:53:10,005 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-20 17:53:10,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:53:10,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989918013] [2024-11-20 17:53:10,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989918013] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:53:10,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543326430] [2024-11-20 17:53:10,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:53:10,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:53:10,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:53:10,008 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-20 17:53:10,010 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-20 17:53:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:53:10,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 17:53:10,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:53:10,123 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-20 17:53:10,123 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:53:10,179 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-20 17:53:10,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543326430] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:53:10,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 17:53:10,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-20 17:53:10,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661070579] [2024-11-20 17:53:10,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 17:53:10,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 17:53:10,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:53:10,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 17:53:10,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-20 17:53:10,195 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2024-11-20 17:53:10,195 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-20 17:53:10,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:53:10,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2024-11-20 17:53:10,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:53:10,269 INFO L124 PetriNetUnfolderBase]: 91/186 cut-off events. [2024-11-20 17:53:10,270 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-11-20 17:53:10,270 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-20 17:53:10,271 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 20 selfloop transitions, 4 changer transitions 5/34 dead transitions. [2024-11-20 17:53:10,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 34 transitions, 155 flow [2024-11-20 17:53:10,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:53:10,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 17:53:10,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2024-11-20 17:53:10,272 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2024-11-20 17:53:10,272 INFO L175 Difference]: Start difference. First operand has 33 places, 20 transitions, 65 flow. Second operand 6 states and 78 transitions. [2024-11-20 17:53:10,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 34 transitions, 155 flow [2024-11-20 17:53:10,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 147 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-20 17:53:10,274 INFO L231 Difference]: Finished difference. Result has 34 places, 21 transitions, 77 flow [2024-11-20 17:53:10,274 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-20 17:53:10,275 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2024-11-20 17:53:10,275 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 21 transitions, 77 flow [2024-11-20 17:53:10,275 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-20 17:53:10,275 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:53:10,275 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:53:10,282 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-20 17:53:10,478 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-20 17:53:10,479 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-20 17:53:10,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:53:10,480 INFO L85 PathProgramCache]: Analyzing trace with hash -679291390, now seen corresponding path program 2 times [2024-11-20 17:53:10,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:53:10,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105349877] [2024-11-20 17:53:10,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:53:10,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:53:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:53:10,529 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-20 17:53:10,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:53:10,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105349877] [2024-11-20 17:53:10,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105349877] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:53:10,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057521108] [2024-11-20 17:53:10,530 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 17:53:10,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:53:10,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:53:10,558 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-20 17:53:10,559 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-20 17:53:10,600 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 17:53:10,601 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:53:10,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 17:53:10,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:53:10,632 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-20 17:53:10,633 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:53:10,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057521108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:53:10,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 17:53:10,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-20 17:53:10,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499488865] [2024-11-20 17:53:10,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:53:10,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:53:10,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:53:10,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:53:10,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-20 17:53:10,636 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2024-11-20 17:53:10,636 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-20 17:53:10,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:53:10,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2024-11-20 17:53:10,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:53:10,721 INFO L124 PetriNetUnfolderBase]: 84/178 cut-off events. [2024-11-20 17:53:10,724 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2024-11-20 17:53:10,725 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-20 17:53:10,725 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 21 selfloop transitions, 2 changer transitions 17/43 dead transitions. [2024-11-20 17:53:10,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 217 flow [2024-11-20 17:53:10,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 17:53:10,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-20 17:53:10,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2024-11-20 17:53:10,727 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-11-20 17:53:10,727 INFO L175 Difference]: Start difference. First operand has 34 places, 21 transitions, 77 flow. Second operand 8 states and 96 transitions. [2024-11-20 17:53:10,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 217 flow [2024-11-20 17:53:10,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 43 transitions, 201 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-20 17:53:10,729 INFO L231 Difference]: Finished difference. Result has 41 places, 21 transitions, 81 flow [2024-11-20 17:53:10,729 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-20 17:53:10,729 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 12 predicate places. [2024-11-20 17:53:10,729 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 21 transitions, 81 flow [2024-11-20 17:53:10,730 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-20 17:53:10,730 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:53:10,730 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:53:10,737 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-20 17:53:10,930 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-20 17:53:10,931 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-20 17:53:10,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:53:10,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1619799325, now seen corresponding path program 1 times [2024-11-20 17:53:10,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:53:10,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417440257] [2024-11-20 17:53:10,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:53:10,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:53:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 17:53:10,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 17:53:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 17:53:10,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 17:53:10,961 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 17:53:10,962 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2024-11-20 17:53:10,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2024-11-20 17:53:10,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-20 17:53:10,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-20 17:53:10,964 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2024-11-20 17:53:10,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 17:53:10,964 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2024-11-20 17:53:10,995 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-20 17:53:10,995 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 17:53:11,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:53:11 BasicIcfg [2024-11-20 17:53:11,002 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 17:53:11,002 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 17:53:11,002 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 17:53:11,003 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 17:53:11,003 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:53:08" (3/4) ... [2024-11-20 17:53:11,004 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 17:53:11,006 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 17:53:11,007 INFO L158 Benchmark]: Toolchain (without parser) took 3206.80ms. Allocated memory was 142.6MB in the beginning and 220.2MB in the end (delta: 77.6MB). Free memory was 70.9MB in the beginning and 122.4MB in the end (delta: -51.5MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2024-11-20 17:53:11,007 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 142.6MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:53:11,007 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.79ms. Allocated memory is still 142.6MB. Free memory was 70.6MB in the beginning and 48.3MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-20 17:53:11,009 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.85ms. Allocated memory was 142.6MB in the beginning and 220.2MB in the end (delta: 77.6MB). Free memory was 48.3MB in the beginning and 186.6MB in the end (delta: -138.3MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2024-11-20 17:53:11,010 INFO L158 Benchmark]: Boogie Preprocessor took 49.83ms. Allocated memory is still 220.2MB. Free memory was 186.6MB in the beginning and 184.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 17:53:11,010 INFO L158 Benchmark]: RCFGBuilder took 358.21ms. Allocated memory is still 220.2MB. Free memory was 184.4MB in the beginning and 167.4MB in the end (delta: 17.0MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2024-11-20 17:53:11,010 INFO L158 Benchmark]: TraceAbstraction took 2293.47ms. Allocated memory is still 220.2MB. Free memory was 166.3MB in the beginning and 123.5MB in the end (delta: 42.9MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. [2024-11-20 17:53:11,011 INFO L158 Benchmark]: Witness Printer took 3.59ms. Allocated memory is still 220.2MB. Free memory was 123.5MB in the beginning and 122.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:53:11,012 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.08ms. Allocated memory is still 142.6MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 433.79ms. Allocated memory is still 142.6MB. Free memory was 70.6MB in the beginning and 48.3MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.85ms. Allocated memory was 142.6MB in the beginning and 220.2MB in the end (delta: 77.6MB). Free memory was 48.3MB in the beginning and 186.6MB in the end (delta: -138.3MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.83ms. Allocated memory is still 220.2MB. Free memory was 186.6MB in the beginning and 184.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 358.21ms. Allocated memory is still 220.2MB. Free memory was 184.4MB in the beginning and 167.4MB in the end (delta: 17.0MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2293.47ms. Allocated memory is still 220.2MB. Free memory was 166.3MB in the beginning and 123.5MB in the end (delta: 42.9MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. * Witness Printer took 3.59ms. Allocated memory is still 220.2MB. Free memory was 123.5MB in the beginning and 122.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 752]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 752. Possible FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [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.2s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 168 SdHoareTripleChecker+Valid, 0.2s 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.6s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 11 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-20 17:53:11,033 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/current/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 /storage/repos/ultimate/releaseScripts/default/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-wip.dd.update-z3-fca748b-m [2024-11-20 17:53:12,948 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 17:53:13,027 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-20 17:53:13,034 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 17:53:13,035 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 17:53:13,065 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 17:53:13,067 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 17:53:13,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 17:53:13,068 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 17:53:13,068 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 17:53:13,068 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 17:53:13,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 17:53:13,069 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 17:53:13,069 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 17:53:13,069 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 17:53:13,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 17:53:13,070 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 17:53:13,072 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 17:53:13,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 17:53:13,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 17:53:13,075 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 17:53:13,076 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 17:53:13,076 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 17:53:13,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 17:53:13,077 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 17:53:13,077 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 17:53:13,078 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 17:53:13,078 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 17:53:13,078 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 17:53:13,078 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 17:53:13,078 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 17:53:13,079 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 17:53:13,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 17:53:13,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 17:53:13,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 17:53:13,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:53:13,080 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 17:53:13,080 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 17:53:13,081 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 17:53:13,081 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 17:53:13,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 17:53:13,081 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 17:53:13,082 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 17:53:13,082 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 17:53:13,082 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-20 17:53:13,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 17:53:13,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 17:53:13,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 17:53:13,356 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 17:53:13,356 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 17:53:13,357 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-1.i [2024-11-20 17:53:14,667 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 17:53:14,884 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 17:53:14,885 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-1.i [2024-11-20 17:53:14,904 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6be1768f/a551fe05c1d743a9a7be2fb7820a5ea4/FLAG540aaa290 [2024-11-20 17:53:14,916 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6be1768f/a551fe05c1d743a9a7be2fb7820a5ea4 [2024-11-20 17:53:14,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 17:53:14,919 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 17:53:14,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 17:53:14,920 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 17:53:14,924 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 17:53:14,925 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:53:14" (1/1) ... [2024-11-20 17:53:14,926 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3df29b01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:14, skipping insertion in model container [2024-11-20 17:53:14,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:53:14" (1/1) ... [2024-11-20 17:53:14,980 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 17:53:15,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:53:15,242 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 17:53:15,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:53:15,297 INFO L204 MainTranslator]: Completed translation [2024-11-20 17:53:15,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:15 WrapperNode [2024-11-20 17:53:15,298 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 17:53:15,298 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 17:53:15,298 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 17:53:15,299 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 17:53:15,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:15" (1/1) ... [2024-11-20 17:53:15,314 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:15" (1/1) ... [2024-11-20 17:53:15,338 INFO L138 Inliner]: procedures = 170, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 67 [2024-11-20 17:53:15,338 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 17:53:15,339 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 17:53:15,339 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 17:53:15,339 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 17:53:15,347 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:15" (1/1) ... [2024-11-20 17:53:15,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:15" (1/1) ... [2024-11-20 17:53:15,349 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:15" (1/1) ... [2024-11-20 17:53:15,358 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-20 17:53:15,358 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:15" (1/1) ... [2024-11-20 17:53:15,358 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:15" (1/1) ... [2024-11-20 17:53:15,366 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:15" (1/1) ... [2024-11-20 17:53:15,372 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:15" (1/1) ... [2024-11-20 17:53:15,374 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:15" (1/1) ... [2024-11-20 17:53:15,375 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:15" (1/1) ... [2024-11-20 17:53:15,379 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 17:53:15,380 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 17:53:15,380 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 17:53:15,380 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 17:53:15,381 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:15" (1/1) ... [2024-11-20 17:53:15,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:53:15,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:53:15,419 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-20 17:53:15,427 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-20 17:53:15,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 17:53:15,460 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-20 17:53:15,460 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-20 17:53:15,460 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-20 17:53:15,460 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-20 17:53:15,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 17:53:15,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 17:53:15,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 17:53:15,461 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 17:53:15,579 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 17:53:15,581 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 17:53:15,708 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 17:53:15,708 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 17:53:15,831 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 17:53:15,832 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-20 17:53:15,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:53:15 BoogieIcfgContainer [2024-11-20 17:53:15,832 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 17:53:15,834 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 17:53:15,834 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 17:53:15,837 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 17:53:15,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:53:14" (1/3) ... [2024-11-20 17:53:15,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f8c797b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:53:15, skipping insertion in model container [2024-11-20 17:53:15,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:53:15" (2/3) ... [2024-11-20 17:53:15,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f8c797b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:53:15, skipping insertion in model container [2024-11-20 17:53:15,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:53:15" (3/3) ... [2024-11-20 17:53:15,841 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind3-1.i [2024-11-20 17:53:15,854 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 17:53:15,854 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 17:53:15,854 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 17:53:15,895 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-20 17:53:15,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 62 flow [2024-11-20 17:53:15,982 INFO L124 PetriNetUnfolderBase]: 6/43 cut-off events. [2024-11-20 17:53:15,984 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 17:53:15,986 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-20 17:53:15,986 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 62 flow [2024-11-20 17:53:15,989 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 59 flow [2024-11-20 17:53:15,998 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 17:53:16,021 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;@52faf921, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 17:53:16,022 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-20 17:53:16,029 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 17:53:16,031 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2024-11-20 17:53:16,031 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 17:53:16,031 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:53:16,032 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:53:16,032 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-20 17:53:16,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:53:16,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1591382737, now seen corresponding path program 1 times [2024-11-20 17:53:16,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:53:16,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992188289] [2024-11-20 17:53:16,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:53:16,046 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-20 17:53:16,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:53:16,052 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-20 17:53:16,053 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-20 17:53:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:53:16,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:53:16,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:53:16,157 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-20 17:53:16,157 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:53:16,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:53:16,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [992188289] [2024-11-20 17:53:16,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [992188289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:53:16,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:53:16,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:53:16,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001800191] [2024-11-20 17:53:16,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:53:16,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:53:16,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:53:16,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:53:16,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:53:16,196 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2024-11-20 17:53:16,199 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-20 17:53:16,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:53:16,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2024-11-20 17:53:16,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:53:16,275 INFO L124 PetriNetUnfolderBase]: 69/163 cut-off events. [2024-11-20 17:53:16,276 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-20 17:53:16,277 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-20 17:53:16,280 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 16 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2024-11-20 17:53:16,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 26 transitions, 97 flow [2024-11-20 17:53:16,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:53:16,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 17:53:16,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2024-11-20 17:53:16,289 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-20 17:53:16,290 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 59 flow. Second operand 4 states and 54 transitions. [2024-11-20 17:53:16,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 26 transitions, 97 flow [2024-11-20 17:53:16,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 96 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 17:53:16,295 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 62 flow [2024-11-20 17:53:16,297 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-20 17:53:16,300 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2024-11-20 17:53:16,300 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 62 flow [2024-11-20 17:53:16,300 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-20 17:53:16,300 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:53:16,300 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-20 17:53:16,303 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-20 17:53:16,502 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-20 17:53:16,503 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-20 17:53:16,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:53:16,504 INFO L85 PathProgramCache]: Analyzing trace with hash 2087232685, now seen corresponding path program 1 times [2024-11-20 17:53:16,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:53:16,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1080928791] [2024-11-20 17:53:16,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:53:16,505 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-20 17:53:16,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:53:16,509 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-20 17:53:16,511 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-20 17:53:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:53:16,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 17:53:16,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:53:16,626 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-20 17:53:16,626 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:53:16,669 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-20 17:53:16,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:53:16,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1080928791] [2024-11-20 17:53:16,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1080928791] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:53:16,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:53:16,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-20 17:53:16,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693411357] [2024-11-20 17:53:16,670 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:53:16,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 17:53:16,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:53:16,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 17:53:16,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-20 17:53:16,689 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2024-11-20 17:53:16,690 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-20 17:53:16,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:53:16,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2024-11-20 17:53:16,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:53:16,787 INFO L124 PetriNetUnfolderBase]: 67/156 cut-off events. [2024-11-20 17:53:16,787 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-20 17:53:16,788 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-20 17:53:16,788 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 16 selfloop transitions, 4 changer transitions 0/26 dead transitions. [2024-11-20 17:53:16,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 26 transitions, 107 flow [2024-11-20 17:53:16,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:53:16,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 17:53:16,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2024-11-20 17:53:16,790 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45185185185185184 [2024-11-20 17:53:16,790 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 62 flow. Second operand 5 states and 61 transitions. [2024-11-20 17:53:16,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 26 transitions, 107 flow [2024-11-20 17:53:16,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 100 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-20 17:53:16,791 INFO L231 Difference]: Finished difference. Result has 31 places, 22 transitions, 64 flow [2024-11-20 17:53:16,791 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-20 17:53:16,792 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2024-11-20 17:53:16,792 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 64 flow [2024-11-20 17:53:16,792 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-20 17:53:16,792 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:53:16,793 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:53:16,798 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-20 17:53:16,993 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-20 17:53:16,994 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-20 17:53:16,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:53:16,994 INFO L85 PathProgramCache]: Analyzing trace with hash 80922212, now seen corresponding path program 1 times [2024-11-20 17:53:16,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:53:16,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32551630] [2024-11-20 17:53:16,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:53:16,995 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-20 17:53:16,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:53:17,000 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-20 17:53:17,005 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-20 17:53:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:53:17,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 17:53:17,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:53:17,075 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-20 17:53:17,075 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:53:17,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:53:17,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32551630] [2024-11-20 17:53:17,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [32551630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:53:17,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:53:17,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 17:53:17,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211580954] [2024-11-20 17:53:17,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:53:17,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:53:17,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:53:17,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:53:17,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:53:17,077 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2024-11-20 17:53:17,077 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-20 17:53:17,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:53:17,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2024-11-20 17:53:17,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:53:17,107 INFO L124 PetriNetUnfolderBase]: 67/151 cut-off events. [2024-11-20 17:53:17,107 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-11-20 17:53:17,108 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-20 17:53:17,108 INFO L140 encePairwiseOnDemand]: 25/27 looper letters, 13 selfloop transitions, 1 changer transitions 1/21 dead transitions. [2024-11-20 17:53:17,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 21 transitions, 92 flow [2024-11-20 17:53:17,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:53:17,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 17:53:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2024-11-20 17:53:17,109 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49382716049382713 [2024-11-20 17:53:17,109 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 64 flow. Second operand 3 states and 40 transitions. [2024-11-20 17:53:17,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 21 transitions, 92 flow [2024-11-20 17:53:17,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 21 transitions, 82 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-11-20 17:53:17,110 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 52 flow [2024-11-20 17:53:17,110 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-20 17:53:17,111 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, -1 predicate places. [2024-11-20 17:53:17,111 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 20 transitions, 52 flow [2024-11-20 17:53:17,111 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-20 17:53:17,111 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:53:17,111 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:53:17,114 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-20 17:53:17,313 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-20 17:53:17,313 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-20 17:53:17,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:53:17,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1281374788, now seen corresponding path program 1 times [2024-11-20 17:53:17,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:53:17,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394790250] [2024-11-20 17:53:17,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:53:17,314 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-20 17:53:17,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:53:17,318 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-20 17:53:17,319 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-20 17:53:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:53:17,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 17:53:17,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:53:17,386 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-20 17:53:17,387 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:53:17,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:53:17,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394790250] [2024-11-20 17:53:17,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394790250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:53:17,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:53:17,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:53:17,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131805476] [2024-11-20 17:53:17,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:53:17,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:53:17,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:53:17,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:53:17,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:53:17,391 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2024-11-20 17:53:17,391 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-20 17:53:17,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:53:17,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2024-11-20 17:53:17,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:53:17,480 INFO L124 PetriNetUnfolderBase]: 95/207 cut-off events. [2024-11-20 17:53:17,481 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-20 17:53:17,481 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-20 17:53:17,482 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 27 selfloop transitions, 7 changer transitions 0/38 dead transitions. [2024-11-20 17:53:17,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 38 transitions, 162 flow [2024-11-20 17:53:17,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:53:17,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 17:53:17,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2024-11-20 17:53:17,483 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2024-11-20 17:53:17,483 INFO L175 Difference]: Start difference. First operand has 28 places, 20 transitions, 52 flow. Second operand 6 states and 78 transitions. [2024-11-20 17:53:17,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 38 transitions, 162 flow [2024-11-20 17:53:17,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 38 transitions, 161 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 17:53:17,484 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 92 flow [2024-11-20 17:53:17,484 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-20 17:53:17,485 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2024-11-20 17:53:17,485 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 92 flow [2024-11-20 17:53:17,485 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-20 17:53:17,485 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:53:17,485 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:53:17,489 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-20 17:53:17,685 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-20 17:53:17,686 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-20 17:53:17,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:53:17,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1066926932, now seen corresponding path program 1 times [2024-11-20 17:53:17,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:53:17,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1647283744] [2024-11-20 17:53:17,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:53:17,688 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-20 17:53:17,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:53:17,690 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-20 17:53:17,691 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-20 17:53:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:53:17,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 17:53:17,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:53:17,777 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-20 17:53:17,777 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:53:17,869 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-20 17:53:17,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:53:17,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1647283744] [2024-11-20 17:53:17,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1647283744] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:53:17,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:53:17,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-20 17:53:17,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543441916] [2024-11-20 17:53:17,870 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:53:17,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 17:53:17,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:53:17,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 17:53:17,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-20 17:53:17,872 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2024-11-20 17:53:17,872 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-20 17:53:17,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:53:17,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2024-11-20 17:53:17,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:53:19,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-20 17:53:20,240 INFO L124 PetriNetUnfolderBase]: 233/469 cut-off events. [2024-11-20 17:53:20,240 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2024-11-20 17:53:20,242 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-20 17:53:20,243 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 33 selfloop transitions, 8 changer transitions 26/73 dead transitions. [2024-11-20 17:53:20,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 73 transitions, 356 flow [2024-11-20 17:53:20,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 17:53:20,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-20 17:53:20,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 154 transitions. [2024-11-20 17:53:20,244 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2024-11-20 17:53:20,245 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 92 flow. Second operand 11 states and 154 transitions. [2024-11-20 17:53:20,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 73 transitions, 356 flow [2024-11-20 17:53:20,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 73 transitions, 347 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-20 17:53:20,247 INFO L231 Difference]: Finished difference. Result has 46 places, 27 transitions, 137 flow [2024-11-20 17:53:20,247 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-20 17:53:20,248 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 17 predicate places. [2024-11-20 17:53:20,248 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 27 transitions, 137 flow [2024-11-20 17:53:20,248 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-20 17:53:20,248 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:53:20,248 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:53:20,255 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-20 17:53:20,448 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-20 17:53:20,449 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-20 17:53:20,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:53:20,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1777140703, now seen corresponding path program 1 times [2024-11-20 17:53:20,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:53:20,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239103315] [2024-11-20 17:53:20,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:53:20,449 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-20 17:53:20,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:53:20,452 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-20 17:53:20,453 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-20 17:53:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:53:20,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 17:53:20,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:53:20,537 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-20 17:53:20,537 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:53:20,602 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-20 17:53:20,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:53:20,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239103315] [2024-11-20 17:53:20,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [239103315] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:53:20,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:53:20,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-20 17:53:20,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873940787] [2024-11-20 17:53:20,603 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:53:20,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 17:53:20,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:53:20,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 17:53:20,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-20 17:53:20,606 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2024-11-20 17:53:20,606 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-20 17:53:20,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:53:20,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2024-11-20 17:53:20,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:53:20,939 INFO L124 PetriNetUnfolderBase]: 194/354 cut-off events. [2024-11-20 17:53:20,943 INFO L125 PetriNetUnfolderBase]: For 621/621 co-relation queries the response was YES. [2024-11-20 17:53:20,948 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-20 17:53:20,949 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 46 selfloop transitions, 14 changer transitions 0/63 dead transitions. [2024-11-20 17:53:20,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 63 transitions, 437 flow [2024-11-20 17:53:20,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 17:53:20,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-20 17:53:20,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-11-20 17:53:20,954 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44814814814814813 [2024-11-20 17:53:20,954 INFO L175 Difference]: Start difference. First operand has 46 places, 27 transitions, 137 flow. Second operand 10 states and 121 transitions. [2024-11-20 17:53:20,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 63 transitions, 437 flow [2024-11-20 17:53:20,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 63 transitions, 381 flow, removed 28 selfloop flow, removed 2 redundant places. [2024-11-20 17:53:20,959 INFO L231 Difference]: Finished difference. Result has 49 places, 31 transitions, 177 flow [2024-11-20 17:53:20,960 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-20 17:53:20,962 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 20 predicate places. [2024-11-20 17:53:20,962 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 31 transitions, 177 flow [2024-11-20 17:53:20,962 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-20 17:53:20,962 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:53:20,963 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:53:20,968 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-20 17:53:21,163 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-20 17:53:21,163 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-20 17:53:21,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:53:21,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1285989308, now seen corresponding path program 2 times [2024-11-20 17:53:21,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:53:21,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1884033335] [2024-11-20 17:53:21,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 17:53:21,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:53:21,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:53:21,166 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-20 17:53:21,167 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-20 17:53:21,231 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 17:53:21,231 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:53:21,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 17:53:21,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:53:21,282 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-20 17:53:21,282 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:53:21,340 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-20 17:53:21,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:53:21,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1884033335] [2024-11-20 17:53:21,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1884033335] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:53:21,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:53:21,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-11-20 17:53:21,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599819541] [2024-11-20 17:53:21,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:53:21,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 17:53:21,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:53:21,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 17:53:21,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-20 17:53:21,345 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2024-11-20 17:53:21,346 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-20 17:53:21,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 17:53:21,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2024-11-20 17:53:21,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 17:53:21,525 INFO L124 PetriNetUnfolderBase]: 112/242 cut-off events. [2024-11-20 17:53:21,525 INFO L125 PetriNetUnfolderBase]: For 355/355 co-relation queries the response was YES. [2024-11-20 17:53:21,526 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-20 17:53:21,527 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 24 selfloop transitions, 4 changer transitions 19/50 dead transitions. [2024-11-20 17:53:21,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 50 transitions, 318 flow [2024-11-20 17:53:21,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 17:53:21,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-20 17:53:21,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-11-20 17:53:21,528 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4185185185185185 [2024-11-20 17:53:21,528 INFO L175 Difference]: Start difference. First operand has 49 places, 31 transitions, 177 flow. Second operand 10 states and 113 transitions. [2024-11-20 17:53:21,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 50 transitions, 318 flow [2024-11-20 17:53:21,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 50 transitions, 273 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-11-20 17:53:21,530 INFO L231 Difference]: Finished difference. Result has 50 places, 23 transitions, 102 flow [2024-11-20 17:53:21,530 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-20 17:53:21,531 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 21 predicate places. [2024-11-20 17:53:21,531 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 23 transitions, 102 flow [2024-11-20 17:53:21,531 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-20 17:53:21,536 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 17:53:21,536 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:53:21,539 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-20 17:53:21,737 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-20 17:53:21,737 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-20 17:53:21,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:53:21,738 INFO L85 PathProgramCache]: Analyzing trace with hash 618180851, now seen corresponding path program 1 times [2024-11-20 17:53:21,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:53:21,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770446627] [2024-11-20 17:53:21,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:53:21,738 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-20 17:53:21,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:53:21,740 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-20 17:53:21,752 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-20 17:53:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 17:53:21,795 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 17:53:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 17:53:21,826 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-20 17:53:21,826 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 17:53:21,826 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2024-11-20 17:53:21,827 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2024-11-20 17:53:21,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-20 17:53:21,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-20 17:53:21,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2024-11-20 17:53:21,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-20 17:53:22,030 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-20 17:53:22,031 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-11-20 17:53:22,058 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-20 17:53:22,058 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 17:53:22,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:53:22 BasicIcfg [2024-11-20 17:53:22,062 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 17:53:22,062 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 17:53:22,062 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 17:53:22,062 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 17:53:22,062 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:53:15" (3/4) ... [2024-11-20 17:53:22,064 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 17:53:22,064 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 17:53:22,065 INFO L158 Benchmark]: Toolchain (without parser) took 7145.36ms. Allocated memory was 75.5MB in the beginning and 146.8MB in the end (delta: 71.3MB). Free memory was 36.8MB in the beginning and 111.9MB in the end (delta: -75.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:53:22,065 INFO L158 Benchmark]: CDTParser took 0.66ms. Allocated memory is still 75.5MB. Free memory is still 45.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:53:22,065 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.67ms. Allocated memory is still 75.5MB. Free memory was 36.6MB in the beginning and 34.5MB in the end (delta: 2.1MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2024-11-20 17:53:22,065 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.28ms. Allocated memory was 75.5MB in the beginning and 119.5MB in the end (delta: 44.0MB). Free memory was 34.5MB in the beginning and 97.5MB in the end (delta: -63.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 17:53:22,066 INFO L158 Benchmark]: Boogie Preprocessor took 40.48ms. Allocated memory is still 119.5MB. Free memory was 97.5MB in the beginning and 95.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 17:53:22,066 INFO L158 Benchmark]: RCFGBuilder took 452.06ms. Allocated memory is still 119.5MB. Free memory was 95.4MB in the beginning and 69.7MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-20 17:53:22,066 INFO L158 Benchmark]: TraceAbstraction took 6227.66ms. Allocated memory was 119.5MB in the beginning and 146.8MB in the end (delta: 27.3MB). Free memory was 69.2MB in the beginning and 111.9MB in the end (delta: -42.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:53:22,066 INFO L158 Benchmark]: Witness Printer took 2.34ms. Allocated memory is still 146.8MB. Free memory is still 111.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:53:22,068 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.66ms. Allocated memory is still 75.5MB. Free memory is still 45.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 377.67ms. Allocated memory is still 75.5MB. Free memory was 36.6MB in the beginning and 34.5MB in the end (delta: 2.1MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.28ms. Allocated memory was 75.5MB in the beginning and 119.5MB in the end (delta: 44.0MB). Free memory was 34.5MB in the beginning and 97.5MB in the end (delta: -63.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.48ms. Allocated memory is still 119.5MB. Free memory was 97.5MB in the beginning and 95.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 452.06ms. Allocated memory is still 119.5MB. Free memory was 95.4MB in the beginning and 69.7MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6227.66ms. Allocated memory was 119.5MB in the beginning and 146.8MB in the end (delta: 27.3MB). Free memory was 69.2MB in the beginning and 111.9MB in the end (delta: -42.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.34ms. Allocated memory is still 146.8MB. Free memory is still 111.9MB. 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: 6.1s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 373 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 368 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 2.6s 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.1s 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-20 17:53:22,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample