./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-C-DAC/pthread-demo-datarace-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d 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-C-DAC/pthread-demo-datarace-3.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 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:27:54,897 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:27:54,979 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 12:27:54,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:27:54,984 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:27:55,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:27:55,024 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:27:55,024 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:27:55,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:27:55,025 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:27:55,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:27:55,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:27:55,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:27:55,029 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:27:55,030 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:27:55,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:27:55,030 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:27:55,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:27:55,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:27:55,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:27:55,031 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:27:55,037 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:27:55,037 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:27:55,037 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:27:55,037 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:27:55,038 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:27:55,038 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:27:55,038 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:27:55,038 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:27:55,039 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:27:55,039 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:27:55,039 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:27:55,039 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:27:55,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:27:55,040 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:27:55,042 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:27:55,042 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:27:55,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:27:55,043 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:27:55,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:27:55,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:27:55,044 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:27:55,045 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 -> 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 [2024-10-13 12:27:55,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:27:55,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:27:55,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:27:55,401 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:27:55,402 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:27:55,404 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i [2024-10-13 12:27:57,017 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:27:57,345 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:27:57,345 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i [2024-10-13 12:27:57,367 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f9d32fb2/6bb04ed24dbc4b159ad2ec38f5354c2d/FLAG7342b2748 [2024-10-13 12:27:57,390 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f9d32fb2/6bb04ed24dbc4b159ad2ec38f5354c2d [2024-10-13 12:27:57,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:27:57,394 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:27:57,395 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:27:57,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:27:57,402 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:27:57,403 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:27:57" (1/1) ... [2024-10-13 12:27:57,403 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ab14923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:27:57, skipping insertion in model container [2024-10-13 12:27:57,404 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:27:57" (1/1) ... [2024-10-13 12:27:57,465 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:27:58,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:27:58,095 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:27:58,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:27:58,333 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:27:58,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:27:58 WrapperNode [2024-10-13 12:27:58,335 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:27:58,336 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:27:58,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:27:58,338 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:27:58,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:27:58" (1/1) ... [2024-10-13 12:27:58,383 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:27:58" (1/1) ... [2024-10-13 12:27:58,418 INFO L138 Inliner]: procedures = 364, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 69 [2024-10-13 12:27:58,419 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:27:58,421 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:27:58,421 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:27:58,421 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:27:58,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:27:58" (1/1) ... [2024-10-13 12:27:58,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:27:58" (1/1) ... [2024-10-13 12:27:58,438 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:27:58" (1/1) ... [2024-10-13 12:27:58,465 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-10-13 12:27:58,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:27:58" (1/1) ... [2024-10-13 12:27:58,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:27:58" (1/1) ... [2024-10-13 12:27:58,479 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:27:58" (1/1) ... [2024-10-13 12:27:58,483 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:27:58" (1/1) ... [2024-10-13 12:27:58,485 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:27:58" (1/1) ... [2024-10-13 12:27:58,486 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:27:58" (1/1) ... [2024-10-13 12:27:58,491 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:27:58,492 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:27:58,492 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:27:58,493 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:27:58,494 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:27:58" (1/1) ... [2024-10-13 12:27:58,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:27:58,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:27:58,539 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-10-13 12:27:58,545 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-10-13 12:27:58,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 12:27:58,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 12:27:58,602 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2024-10-13 12:27:58,602 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2024-10-13 12:27:58,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:27:58,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 12:27:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:27:58,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:27:58,605 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:27:58,782 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:27:58,784 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:27:58,925 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:27:58,926 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:27:59,054 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:27:59,054 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 12:27:59,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:27:59 BoogieIcfgContainer [2024-10-13 12:27:59,055 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:27:59,059 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:27:59,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:27:59,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:27:59,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:27:57" (1/3) ... [2024-10-13 12:27:59,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497892a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:27:59, skipping insertion in model container [2024-10-13 12:27:59,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:27:58" (2/3) ... [2024-10-13 12:27:59,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497892a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:27:59, skipping insertion in model container [2024-10-13 12:27:59,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:27:59" (3/3) ... [2024-10-13 12:27:59,072 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2024-10-13 12:27:59,091 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:27:59,092 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 12:27:59,092 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:27:59,126 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-13 12:27:59,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 27 transitions, 61 flow [2024-10-13 12:27:59,193 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2024-10-13 12:27:59,194 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-13 12:27:59,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 26 events. 4/26 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 35 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 12. Up to 2 conditions per place. [2024-10-13 12:27:59,196 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 27 transitions, 61 flow [2024-10-13 12:27:59,199 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 25 transitions, 56 flow [2024-10-13 12:27:59,209 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:27:59,216 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;@769d1302, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:27:59,216 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-13 12:27:59,225 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:27:59,225 INFO L124 PetriNetUnfolderBase]: 4/23 cut-off events. [2024-10-13 12:27:59,226 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-13 12:27:59,226 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:27:59,227 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:27:59,228 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:27:59,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:27:59,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1903401860, now seen corresponding path program 1 times [2024-10-13 12:27:59,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:27:59,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618814977] [2024-10-13 12:27:59,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:27:59,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:27:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:27:59,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:27:59,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:27:59,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618814977] [2024-10-13 12:27:59,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618814977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:27:59,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:27:59,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:27:59,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199085133] [2024-10-13 12:27:59,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:27:59,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:27:59,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:27:59,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:27:59,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:27:59,568 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2024-10-13 12:27:59,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-10-13 12:27:59,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:27:59,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2024-10-13 12:27:59,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:27:59,638 INFO L124 PetriNetUnfolderBase]: 17/56 cut-off events. [2024-10-13 12:27:59,640 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-13 12:27:59,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 56 events. 17/56 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 138 event pairs, 6 based on Foata normal form. 7/59 useless extension candidates. Maximal degree in co-relation 80. Up to 30 conditions per place. [2024-10-13 12:27:59,643 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 15 selfloop transitions, 2 changer transitions 1/25 dead transitions. [2024-10-13 12:27:59,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 25 transitions, 90 flow [2024-10-13 12:27:59,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:27:59,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:27:59,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2024-10-13 12:27:59,654 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2024-10-13 12:27:59,655 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 56 flow. Second operand 3 states and 51 transitions. [2024-10-13 12:27:59,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 25 transitions, 90 flow [2024-10-13 12:27:59,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 25 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:27:59,663 INFO L231 Difference]: Finished difference. Result has 23 places, 20 transitions, 52 flow [2024-10-13 12:27:59,665 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=23, PETRI_TRANSITIONS=20} [2024-10-13 12:27:59,670 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, -2 predicate places. [2024-10-13 12:27:59,670 INFO L471 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 52 flow [2024-10-13 12:27:59,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-10-13 12:27:59,671 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:27:59,671 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:27:59,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 12:27:59,673 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:27:59,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:27:59,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1055756235, now seen corresponding path program 1 times [2024-10-13 12:27:59,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:27:59,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466307006] [2024-10-13 12:27:59,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:27:59,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:27:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:27:59,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:27:59,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:27:59,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466307006] [2024-10-13 12:27:59,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466307006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:27:59,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:27:59,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:27:59,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728367652] [2024-10-13 12:27:59,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:27:59,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:27:59,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:27:59,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:27:59,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:27:59,817 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2024-10-13 12:27:59,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 20 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:27:59,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:27:59,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2024-10-13 12:27:59,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:27:59,900 INFO L124 PetriNetUnfolderBase]: 25/82 cut-off events. [2024-10-13 12:27:59,901 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-10-13 12:27:59,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 82 events. 25/82 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 226 event pairs, 9 based on Foata normal form. 4/82 useless extension candidates. Maximal degree in co-relation 38. Up to 38 conditions per place. [2024-10-13 12:27:59,905 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 17 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2024-10-13 12:27:59,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 26 transitions, 112 flow [2024-10-13 12:27:59,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:27:59,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:27:59,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2024-10-13 12:27:59,908 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-10-13 12:27:59,908 INFO L175 Difference]: Start difference. First operand has 23 places, 20 transitions, 52 flow. Second operand 3 states and 48 transitions. [2024-10-13 12:27:59,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 26 transitions, 112 flow [2024-10-13 12:27:59,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 26 transitions, 108 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:27:59,911 INFO L231 Difference]: Finished difference. Result has 24 places, 21 transitions, 62 flow [2024-10-13 12:27:59,912 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=24, PETRI_TRANSITIONS=21} [2024-10-13 12:27:59,913 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2024-10-13 12:27:59,913 INFO L471 AbstractCegarLoop]: Abstraction has has 24 places, 21 transitions, 62 flow [2024-10-13 12:27:59,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:27:59,915 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:27:59,915 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:27:59,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 12:27:59,916 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:27:59,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:27:59,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1776145626, now seen corresponding path program 1 times [2024-10-13 12:27:59,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:27:59,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349237595] [2024-10-13 12:27:59,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:27:59,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:27:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:28:00,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:28:00,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:28:00,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349237595] [2024-10-13 12:28:00,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349237595] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:28:00,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730442306] [2024-10-13 12:28:00,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:28:00,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:28:00,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:28:00,048 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-10-13 12:28:00,050 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-10-13 12:28:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:28:00,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:28:00,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:28:00,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 12:28:00,212 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:28:00,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 12:28:00,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730442306] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:28:00,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:28:00,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-10-13 12:28:00,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000547122] [2024-10-13 12:28:00,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:28:00,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 12:28:00,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:28:00,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 12:28:00,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-13 12:28:00,292 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-10-13 12:28:00,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 21 transitions, 62 flow. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 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-10-13 12:28:00,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:28:00,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-10-13 12:28:00,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:28:00,573 INFO L124 PetriNetUnfolderBase]: 76/215 cut-off events. [2024-10-13 12:28:00,573 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2024-10-13 12:28:00,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 215 events. 76/215 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 688 event pairs, 4 based on Foata normal form. 30/244 useless extension candidates. Maximal degree in co-relation 113. Up to 61 conditions per place. [2024-10-13 12:28:00,580 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 42 selfloop transitions, 33 changer transitions 0/81 dead transitions. [2024-10-13 12:28:00,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 81 transitions, 406 flow [2024-10-13 12:28:00,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 12:28:00,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-10-13 12:28:00,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 233 transitions. [2024-10-13 12:28:00,587 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5393518518518519 [2024-10-13 12:28:00,588 INFO L175 Difference]: Start difference. First operand has 24 places, 21 transitions, 62 flow. Second operand 16 states and 233 transitions. [2024-10-13 12:28:00,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 81 transitions, 406 flow [2024-10-13 12:28:00,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 81 transitions, 400 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:28:00,593 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 334 flow [2024-10-13 12:28:00,593 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=334, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2024-10-13 12:28:00,594 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 26 predicate places. [2024-10-13 12:28:00,594 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 334 flow [2024-10-13 12:28:00,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 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-10-13 12:28:00,597 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:28:00,597 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:28:00,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 12:28:00,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:28:00,802 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:28:00,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:28:00,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1872952531, now seen corresponding path program 2 times [2024-10-13 12:28:00,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:28:00,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947313271] [2024-10-13 12:28:00,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:28:00,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:28:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:28:00,972 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 12:28:00,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:28:00,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947313271] [2024-10-13 12:28:00,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947313271] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:28:00,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288937238] [2024-10-13 12:28:00,973 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:28:00,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:28:00,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:28:00,976 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-10-13 12:28:00,977 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-10-13 12:28:01,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 12:28:01,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:28:01,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:28:01,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:28:01,129 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 12:28:01,129 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:28:01,247 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 12:28:01,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288937238] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:28:01,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:28:01,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-10-13 12:28:01,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095452224] [2024-10-13 12:28:01,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:28:01,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 12:28:01,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:28:01,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 12:28:01,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-13 12:28:01,298 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-10-13 12:28:01,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 334 flow. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:28:01,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:28:01,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-10-13 12:28:01,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:28:01,490 INFO L124 PetriNetUnfolderBase]: 175/501 cut-off events. [2024-10-13 12:28:01,490 INFO L125 PetriNetUnfolderBase]: For 3066/3066 co-relation queries the response was YES. [2024-10-13 12:28:01,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1900 conditions, 501 events. 175/501 cut-off events. For 3066/3066 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2305 event pairs, 41 based on Foata normal form. 59/546 useless extension candidates. Maximal degree in co-relation 1459. Up to 121 conditions per place. [2024-10-13 12:28:01,501 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 61 selfloop transitions, 20 changer transitions 0/90 dead transitions. [2024-10-13 12:28:01,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 90 transitions, 846 flow [2024-10-13 12:28:01,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:28:01,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-13 12:28:01,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2024-10-13 12:28:01,505 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2024-10-13 12:28:01,506 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 334 flow. Second operand 8 states and 124 transitions. [2024-10-13 12:28:01,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 90 transitions, 846 flow [2024-10-13 12:28:01,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 90 transitions, 770 flow, removed 26 selfloop flow, removed 2 redundant places. [2024-10-13 12:28:01,528 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 404 flow [2024-10-13 12:28:01,528 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=404, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2024-10-13 12:28:01,529 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 36 predicate places. [2024-10-13 12:28:01,529 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 404 flow [2024-10-13 12:28:01,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 9 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:28:01,530 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:28:01,530 INFO L204 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:28:01,550 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-10-13 12:28:01,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-13 12:28:01,731 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:28:01,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:28:01,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1655872447, now seen corresponding path program 3 times [2024-10-13 12:28:01,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:28:01,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067600297] [2024-10-13 12:28:01,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:28:01,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:28:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:28:01,881 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-13 12:28:01,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:28:01,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067600297] [2024-10-13 12:28:01,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067600297] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:28:01,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615374160] [2024-10-13 12:28:01,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 12:28:01,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:28:01,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:28:01,884 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-10-13 12:28:01,886 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-10-13 12:28:01,963 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-10-13 12:28:01,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:28:01,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:28:01,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:28:02,052 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-13 12:28:02,053 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:28:02,179 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-13 12:28:02,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615374160] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:28:02,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:28:02,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-13 12:28:02,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079804736] [2024-10-13 12:28:02,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:28:02,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 12:28:02,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:28:02,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 12:28:02,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-13 12:28:02,199 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-10-13 12:28:02,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 404 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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-10-13 12:28:02,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:28:02,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-10-13 12:28:02,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:28:02,486 INFO L124 PetriNetUnfolderBase]: 266/767 cut-off events. [2024-10-13 12:28:02,486 INFO L125 PetriNetUnfolderBase]: For 9650/9698 co-relation queries the response was YES. [2024-10-13 12:28:02,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3633 conditions, 767 events. 266/767 cut-off events. For 9650/9698 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3978 event pairs, 16 based on Foata normal form. 56/815 useless extension candidates. Maximal degree in co-relation 3162. Up to 231 conditions per place. [2024-10-13 12:28:02,502 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 144 selfloop transitions, 36 changer transitions 0/187 dead transitions. [2024-10-13 12:28:02,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 187 transitions, 2298 flow [2024-10-13 12:28:02,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 12:28:02,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-13 12:28:02,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 185 transitions. [2024-10-13 12:28:02,504 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5709876543209876 [2024-10-13 12:28:02,504 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 404 flow. Second operand 12 states and 185 transitions. [2024-10-13 12:28:02,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 187 transitions, 2298 flow [2024-10-13 12:28:02,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 187 transitions, 2054 flow, removed 88 selfloop flow, removed 2 redundant places. [2024-10-13 12:28:02,526 INFO L231 Difference]: Finished difference. Result has 77 places, 74 transitions, 632 flow [2024-10-13 12:28:02,526 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=632, PETRI_PLACES=77, PETRI_TRANSITIONS=74} [2024-10-13 12:28:02,528 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 52 predicate places. [2024-10-13 12:28:02,529 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 74 transitions, 632 flow [2024-10-13 12:28:02,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 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-10-13 12:28:02,530 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:28:02,530 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:28:02,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 12:28:02,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:28:02,732 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:28:02,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:28:02,732 INFO L85 PathProgramCache]: Analyzing trace with hash -2068348941, now seen corresponding path program 4 times [2024-10-13 12:28:02,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:28:02,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747907306] [2024-10-13 12:28:02,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:28:02,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:28:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:28:02,959 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 10 proven. 51 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-10-13 12:28:02,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:28:02,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747907306] [2024-10-13 12:28:02,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747907306] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:28:02,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27245773] [2024-10-13 12:28:02,962 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 12:28:02,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:28:02,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:28:02,965 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:28:02,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 12:28:03,062 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 12:28:03,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:28:03,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 12:28:03,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:28:03,186 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 10 proven. 51 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-10-13 12:28:03,186 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:28:03,400 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 10 proven. 51 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-10-13 12:28:03,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27245773] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:28:03,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:28:03,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-10-13 12:28:03,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669078373] [2024-10-13 12:28:03,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:28:03,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 12:28:03,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:28:03,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 12:28:03,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2024-10-13 12:28:03,411 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-10-13 12:28:03,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 74 transitions, 632 flow. Second operand has 17 states, 17 states have (on average 11.529411764705882) internal successors, (196), 17 states have internal predecessors, (196), 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-10-13 12:28:03,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:28:03,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-10-13 12:28:03,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:28:03,998 INFO L124 PetriNetUnfolderBase]: 758/2054 cut-off events. [2024-10-13 12:28:03,999 INFO L125 PetriNetUnfolderBase]: For 18092/18167 co-relation queries the response was YES. [2024-10-13 12:28:04,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8734 conditions, 2054 events. 758/2054 cut-off events. For 18092/18167 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 12867 event pairs, 96 based on Foata normal form. 291/2293 useless extension candidates. Maximal degree in co-relation 7157. Up to 444 conditions per place. [2024-10-13 12:28:04,024 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 215 selfloop transitions, 28 changer transitions 0/255 dead transitions. [2024-10-13 12:28:04,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 255 transitions, 3026 flow [2024-10-13 12:28:04,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 12:28:04,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-10-13 12:28:04,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 248 transitions. [2024-10-13 12:28:04,028 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2024-10-13 12:28:04,028 INFO L175 Difference]: Start difference. First operand has 77 places, 74 transitions, 632 flow. Second operand 16 states and 248 transitions. [2024-10-13 12:28:04,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 255 transitions, 3026 flow [2024-10-13 12:28:04,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 255 transitions, 2936 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:28:04,058 INFO L231 Difference]: Finished difference. Result has 98 places, 83 transitions, 830 flow [2024-10-13 12:28:04,058 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=830, PETRI_PLACES=98, PETRI_TRANSITIONS=83} [2024-10-13 12:28:04,059 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 73 predicate places. [2024-10-13 12:28:04,060 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 83 transitions, 830 flow [2024-10-13 12:28:04,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.529411764705882) internal successors, (196), 17 states have internal predecessors, (196), 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-10-13 12:28:04,061 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:28:04,061 INFO L204 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:28:04,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 12:28:04,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:28:04,266 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:28:04,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:28:04,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1218453727, now seen corresponding path program 5 times [2024-10-13 12:28:04,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:28:04,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631692801] [2024-10-13 12:28:04,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:28:04,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:28:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:28:04,707 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 130 proven. 287 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-13 12:28:04,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:28:04,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631692801] [2024-10-13 12:28:04,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631692801] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:28:04,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785116821] [2024-10-13 12:28:04,708 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 12:28:04,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:28:04,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:28:04,710 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:28:04,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 12:28:04,824 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2024-10-13 12:28:04,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:28:04,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 12:28:04,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:28:04,971 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 130 proven. 287 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-13 12:28:04,971 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:28:05,303 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 130 proven. 287 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-13 12:28:05,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785116821] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:28:05,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:28:05,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2024-10-13 12:28:05,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148962124] [2024-10-13 12:28:05,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:28:05,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-13 12:28:05,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:28:05,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-13 12:28:05,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2024-10-13 12:28:05,321 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-10-13 12:28:05,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 83 transitions, 830 flow. Second operand has 23 states, 23 states have (on average 11.521739130434783) internal successors, (265), 23 states have internal predecessors, (265), 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-10-13 12:28:05,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:28:05,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-10-13 12:28:05,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:28:06,089 INFO L124 PetriNetUnfolderBase]: 1046/2822 cut-off events. [2024-10-13 12:28:06,089 INFO L125 PetriNetUnfolderBase]: For 42613/42724 co-relation queries the response was YES. [2024-10-13 12:28:06,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13754 conditions, 2822 events. 1046/2822 cut-off events. For 42613/42724 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 18742 event pairs, 120 based on Foata normal form. 273/3031 useless extension candidates. Maximal degree in co-relation 11228. Up to 630 conditions per place. [2024-10-13 12:28:06,126 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 299 selfloop transitions, 34 changer transitions 0/345 dead transitions. [2024-10-13 12:28:06,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 345 transitions, 4188 flow [2024-10-13 12:28:06,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-13 12:28:06,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-10-13 12:28:06,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 336 transitions. [2024-10-13 12:28:06,129 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5656565656565656 [2024-10-13 12:28:06,129 INFO L175 Difference]: Start difference. First operand has 98 places, 83 transitions, 830 flow. Second operand 22 states and 336 transitions. [2024-10-13 12:28:06,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 345 transitions, 4188 flow [2024-10-13 12:28:06,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 345 transitions, 4158 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 12:28:06,175 INFO L231 Difference]: Finished difference. Result has 121 places, 90 transitions, 1020 flow [2024-10-13 12:28:06,176 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1020, PETRI_PLACES=121, PETRI_TRANSITIONS=90} [2024-10-13 12:28:06,176 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 96 predicate places. [2024-10-13 12:28:06,177 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 90 transitions, 1020 flow [2024-10-13 12:28:06,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 11.521739130434783) internal successors, (265), 23 states have internal predecessors, (265), 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-10-13 12:28:06,177 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:28:06,177 INFO L204 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:28:06,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 12:28:06,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:28:06,382 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:28:06,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:28:06,382 INFO L85 PathProgramCache]: Analyzing trace with hash -949791755, now seen corresponding path program 6 times [2024-10-13 12:28:06,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:28:06,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359500242] [2024-10-13 12:28:06,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:28:06,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:28:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:28:06,723 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 20 proven. 235 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2024-10-13 12:28:06,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:28:06,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359500242] [2024-10-13 12:28:06,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359500242] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:28:06,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582451912] [2024-10-13 12:28:06,724 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-13 12:28:06,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:28:06,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:28:06,726 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 12:28:06,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 12:28:06,825 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2024-10-13 12:28:06,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:28:06,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 12:28:06,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:28:07,009 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 20 proven. 235 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2024-10-13 12:28:07,009 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:28:07,323 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 20 proven. 235 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2024-10-13 12:28:07,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582451912] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:28:07,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 12:28:07,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2024-10-13 12:28:07,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740242160] [2024-10-13 12:28:07,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 12:28:07,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-13 12:28:07,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:28:07,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-13 12:28:07,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2024-10-13 12:28:07,344 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-10-13 12:28:07,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 90 transitions, 1020 flow. Second operand has 23 states, 23 states have (on average 12.26086956521739) internal successors, (282), 23 states have internal predecessors, (282), 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-10-13 12:28:07,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:28:07,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-10-13 12:28:07,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:28:08,624 INFO L124 PetriNetUnfolderBase]: 1388/3809 cut-off events. [2024-10-13 12:28:08,624 INFO L125 PetriNetUnfolderBase]: For 99502/99742 co-relation queries the response was YES. [2024-10-13 12:28:08,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23200 conditions, 3809 events. 1388/3809 cut-off events. For 99502/99742 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 27467 event pairs, 44 based on Foata normal form. 232/4019 useless extension candidates. Maximal degree in co-relation 21859. Up to 1327 conditions per place. [2024-10-13 12:28:08,687 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 588 selfloop transitions, 66 changer transitions 0/663 dead transitions. [2024-10-13 12:28:08,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 663 transitions, 12386 flow [2024-10-13 12:28:08,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-13 12:28:08,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-10-13 12:28:08,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 339 transitions. [2024-10-13 12:28:08,690 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5707070707070707 [2024-10-13 12:28:08,690 INFO L175 Difference]: Start difference. First operand has 121 places, 90 transitions, 1020 flow. Second operand 22 states and 339 transitions. [2024-10-13 12:28:08,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 663 transitions, 12386 flow [2024-10-13 12:28:08,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 663 transitions, 11760 flow, removed 0 selfloop flow, removed 13 redundant places. [2024-10-13 12:28:08,807 INFO L231 Difference]: Finished difference. Result has 140 places, 123 transitions, 1534 flow [2024-10-13 12:28:08,808 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=974, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1534, PETRI_PLACES=140, PETRI_TRANSITIONS=123} [2024-10-13 12:28:08,808 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 115 predicate places. [2024-10-13 12:28:08,808 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 123 transitions, 1534 flow [2024-10-13 12:28:08,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 12.26086956521739) internal successors, (282), 23 states have internal predecessors, (282), 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-10-13 12:28:08,809 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:28:08,809 INFO L204 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:28:08,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-13 12:28:09,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 12:28:09,010 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:28:09,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:28:09,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1102348205, now seen corresponding path program 7 times [2024-10-13 12:28:09,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:28:09,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126196843] [2024-10-13 12:28:09,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:28:09,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:28:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:28:09,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:28:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:28:09,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 12:28:09,213 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:28:09,215 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 3 remaining) [2024-10-13 12:28:09,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (1 of 3 remaining) [2024-10-13 12:28:09,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-10-13 12:28:09,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 12:28:09,218 INFO L407 BasicCegarLoop]: Path program histogram: [7, 1, 1] [2024-10-13 12:28:09,424 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 12:28:09,424 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:28:09,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:28:09 BasicIcfg [2024-10-13 12:28:09,432 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:28:09,433 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:28:09,433 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:28:09,433 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:28:09,434 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:27:59" (3/4) ... [2024-10-13 12:28:09,436 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 12:28:09,438 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:28:09,439 INFO L158 Benchmark]: Toolchain (without parser) took 12045.43ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 108.7MB in the beginning and 262.1MB in the end (delta: -153.5MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB. [2024-10-13 12:28:09,439 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 167.8MB. Free memory is still 129.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:28:09,441 INFO L158 Benchmark]: CACSL2BoogieTranslator took 940.19ms. Allocated memory was 167.8MB in the beginning and 241.2MB in the end (delta: 73.4MB). Free memory was 108.7MB in the beginning and 207.6MB in the end (delta: -99.0MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. [2024-10-13 12:28:09,442 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.68ms. Allocated memory is still 241.2MB. Free memory was 207.6MB in the beginning and 205.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:28:09,442 INFO L158 Benchmark]: Boogie Preprocessor took 70.75ms. Allocated memory is still 241.2MB. Free memory was 205.5MB in the beginning and 203.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:28:09,442 INFO L158 Benchmark]: RCFGBuilder took 564.50ms. Allocated memory is still 241.2MB. Free memory was 203.4MB in the beginning and 181.4MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-13 12:28:09,442 INFO L158 Benchmark]: TraceAbstraction took 10373.37ms. Allocated memory was 241.2MB in the beginning and 369.1MB in the end (delta: 127.9MB). Free memory was 180.4MB in the beginning and 262.1MB in the end (delta: -81.8MB). Peak memory consumption was 181.4MB. Max. memory is 16.1GB. [2024-10-13 12:28:09,443 INFO L158 Benchmark]: Witness Printer took 5.71ms. Allocated memory is still 369.1MB. Free memory is still 262.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:28:09,444 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.37ms. Allocated memory is still 167.8MB. Free memory is still 129.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 940.19ms. Allocated memory was 167.8MB in the beginning and 241.2MB in the end (delta: 73.4MB). Free memory was 108.7MB in the beginning and 207.6MB in the end (delta: -99.0MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.68ms. Allocated memory is still 241.2MB. Free memory was 207.6MB in the beginning and 205.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.75ms. Allocated memory is still 241.2MB. Free memory was 205.5MB in the beginning and 203.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 564.50ms. Allocated memory is still 241.2MB. Free memory was 203.4MB in the beginning and 181.4MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 10373.37ms. Allocated memory was 241.2MB in the beginning and 369.1MB in the end (delta: 127.9MB). Free memory was 180.4MB in the beginning and 262.1MB in the end (delta: -81.8MB). Peak memory consumption was 181.4MB. Max. memory is 16.1GB. * Witness Printer took 5.71ms. Allocated memory is still 369.1MB. Free memory is still 262.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 12]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 12. Possible FailurePath: [L1320] 0 int myglobal; [L1321] 0 pthread_mutex_t mymutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1340] 0 pthread_t mythread; [L1341] 0 int i; [L1342] FCALL, FORK 0 pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0)) VAL [\old(arg)={0:0}, myglobal=0, mythread=-1] [L1342] COND FALSE 0 !(pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0))) [L1352] 0 i=0 VAL [\old(arg)={0:0}, i=0, myglobal=0, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=0, myglobal=0, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=0, myglobal=1, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=1, myglobal=1, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=1, myglobal=1, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=1, myglobal=2, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=2, myglobal=2, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=2, myglobal=2, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=2, myglobal=3, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=3, myglobal=3, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=3, myglobal=3, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=3, myglobal=4, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=4, myglobal=4, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=4, myglobal=4, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=4, myglobal=5, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=5, myglobal=5, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=5, myglobal=5, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=5, myglobal=6, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=6, myglobal=6, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=6, myglobal=6, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=6, myglobal=7, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=7, myglobal=7, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=7, myglobal=7, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=7, myglobal=8, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=8, myglobal=8, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=8, myglobal=8, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=8, myglobal=9, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=9, myglobal=9, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=9, myglobal=9, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=9, myglobal=10, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=10, myglobal=10, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=10, myglobal=10, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=10, myglobal=11, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=11, myglobal=11, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=11, myglobal=11, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=11, myglobal=12, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=12, myglobal=12, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=12, myglobal=12, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=12, myglobal=13, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=13, myglobal=13, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=13, myglobal=13, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=13, myglobal=14, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=14, myglobal=14, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=14, myglobal=14, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=14, myglobal=15, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=15, myglobal=15, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=15, myglobal=15, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=15, myglobal=16, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=16, myglobal=16, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=16, myglobal=16, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=16, myglobal=17, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=17, myglobal=17, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=17, myglobal=17, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=17, myglobal=18, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=18, myglobal=18, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=18, myglobal=18, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=18, myglobal=19, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=19, myglobal=19, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=19, myglobal=19, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=19, myglobal=20, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, i=20, myglobal=20, mythread=-1] [L1324] 1 int i,j; [L1325] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, i=0, myglobal=20] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, myglobal=20] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=0, j=20, myglobal=20] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=0, j=21, myglobal=21] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=21, myglobal=21] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=21, myglobal=21] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=21, myglobal=21] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=22, myglobal=22] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=22, myglobal=22] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=22, myglobal=22] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=22, myglobal=22] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=23, myglobal=23] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=23, myglobal=23] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=23, myglobal=23] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=23, myglobal=23] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=24, myglobal=24] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=24, myglobal=24] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=24, myglobal=24] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=24, myglobal=24] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=25, myglobal=25] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=25, myglobal=25] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=25, myglobal=25] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=25, myglobal=25] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=26, myglobal=26] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=26, myglobal=26] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=26, myglobal=26] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=26, myglobal=26] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=27, myglobal=27] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=27, myglobal=27] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=27, myglobal=27] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=27, myglobal=27] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=28, myglobal=28] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=28, myglobal=28] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=28, myglobal=28] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=28, myglobal=28] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=29, myglobal=29] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=29, myglobal=29] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=29, myglobal=29] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=29, myglobal=29] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=30, myglobal=30] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=30, myglobal=30] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=30, myglobal=30] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=30, myglobal=30] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=31, myglobal=31] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=31, myglobal=31] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=31, myglobal=31] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=31, myglobal=31] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=32, myglobal=32] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=32, myglobal=32] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=32, myglobal=32] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=32, myglobal=32] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=33, myglobal=33] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=33, myglobal=33] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=33, myglobal=33] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=33, myglobal=33] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=34, myglobal=34] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=34, myglobal=34] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=34, myglobal=34] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=34, myglobal=34] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=35, myglobal=35] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=35, myglobal=35] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=35, myglobal=35] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=35, myglobal=35] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=36, myglobal=36] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=36, myglobal=36] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=36, myglobal=36] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=36, myglobal=36] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=37, myglobal=37] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=37, myglobal=37] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=37, myglobal=37] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=37, myglobal=37] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=38, myglobal=38] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=38, myglobal=38] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=38, myglobal=38] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=38, myglobal=38] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=39, myglobal=39] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=40, myglobal=40] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, j=40, myglobal=40] [L1352] COND FALSE 0 !(i<20) VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=20, j=40, myglobal=40, mythread=-1] [L1325] COND FALSE 1 !(i<20) [L1336] 1 return ((void *)0); [L1358] FCALL, JOIN 1 pthread_join ( mythread, ((void *)0) ) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, i=20, i=20, j=40, myglobal=40, mythread=-1] [L1358] COND FALSE 0 !(pthread_join ( mythread, ((void *)0) )) [L1362] CALL 0 __VERIFIER_assert(myglobal != 40) [L13] COND TRUE 0 !(cond) [L13] CALL 0 reach_error() [L12] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, i=20, j=40, myglobal=40] [L12] 0 __assert_fail ("0", "pthread-demo-datarace-2.c", 25, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, i=20, j=40, myglobal=40] - UnprovableResult [Line: 1338]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1342]: 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 3 procedures, 32 locations, 3 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: 10.1s, OverallIterations: 9, TraceHistogramMax: 20, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 560 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 547 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 838 IncrementalHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 1 mSDtfsCounter, 838 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 881 GetRequests, 778 SyntacticMatches, 12 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1534occurred in iteration=8, InterpolantAutomatonStates: 102, 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.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1012 NumberOfCodeBlocks, 973 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 1229 ConstructedInterpolants, 0 QuantifiedInterpolants, 3229 SizeOfPredicates, 0 NumberOfNonLiveVariables, 918 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 3439/5278 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-10-13 12:28:09,482 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-C-DAC/pthread-demo-datarace-3.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 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:28:11,965 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:28:12,049 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 12:28:12,056 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:28:12,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:28:12,091 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:28:12,093 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:28:12,094 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:28:12,094 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:28:12,095 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:28:12,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:28:12,098 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:28:12,099 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:28:12,099 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:28:12,100 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:28:12,100 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:28:12,101 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:28:12,101 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:28:12,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:28:12,102 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:28:12,102 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:28:12,106 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:28:12,107 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:28:12,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:28:12,109 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:28:12,109 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 12:28:12,112 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:28:12,113 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 12:28:12,113 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:28:12,113 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:28:12,114 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:28:12,114 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:28:12,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:28:12,115 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:28:12,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:28:12,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:28:12,116 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:28:12,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:28:12,116 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 12:28:12,116 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 12:28:12,116 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:28:12,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:28:12,119 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:28:12,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:28:12,120 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 12:28:12,120 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 -> 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 [2024-10-13 12:28:12,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:28:12,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:28:12,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:28:12,553 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:28:12,554 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:28:12,556 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i [2024-10-13 12:28:14,248 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:28:14,600 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:28:14,602 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i [2024-10-13 12:28:14,631 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26558166d/8149a09658884c6e9d9c8e1f3b0bcc0e/FLAG096cb463b [2024-10-13 12:28:14,647 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26558166d/8149a09658884c6e9d9c8e1f3b0bcc0e [2024-10-13 12:28:14,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:28:14,651 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:28:14,653 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:28:14,653 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:28:14,660 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:28:14,661 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:28:14" (1/1) ... [2024-10-13 12:28:14,662 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e937cb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:14, skipping insertion in model container [2024-10-13 12:28:14,662 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:28:14" (1/1) ... [2024-10-13 12:28:14,719 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:28:15,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:28:15,398 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:28:15,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:28:15,573 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:28:15,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:15 WrapperNode [2024-10-13 12:28:15,574 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:28:15,576 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:28:15,576 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:28:15,576 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:28:15,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:15" (1/1) ... [2024-10-13 12:28:15,614 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:15" (1/1) ... [2024-10-13 12:28:15,646 INFO L138 Inliner]: procedures = 365, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2024-10-13 12:28:15,647 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:28:15,650 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:28:15,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:28:15,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:28:15,661 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:15" (1/1) ... [2024-10-13 12:28:15,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:15" (1/1) ... [2024-10-13 12:28:15,665 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:15" (1/1) ... [2024-10-13 12:28:15,689 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-10-13 12:28:15,690 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:15" (1/1) ... [2024-10-13 12:28:15,691 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:15" (1/1) ... [2024-10-13 12:28:15,701 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:15" (1/1) ... [2024-10-13 12:28:15,706 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:15" (1/1) ... [2024-10-13 12:28:15,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:15" (1/1) ... [2024-10-13 12:28:15,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:15" (1/1) ... [2024-10-13 12:28:15,716 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:28:15,721 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:28:15,725 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:28:15,725 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:28:15,726 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:15" (1/1) ... [2024-10-13 12:28:15,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:28:15,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:28:15,763 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-10-13 12:28:15,767 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-10-13 12:28:15,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 12:28:15,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 12:28:15,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 12:28:15,821 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2024-10-13 12:28:15,821 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2024-10-13 12:28:15,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:28:15,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:28:15,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:28:15,823 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:28:15,975 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:28:15,977 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:28:16,174 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:28:16,175 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:28:16,327 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:28:16,327 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 12:28:16,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:28:16 BoogieIcfgContainer [2024-10-13 12:28:16,328 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:28:16,330 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:28:16,330 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:28:16,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:28:16,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:28:14" (1/3) ... [2024-10-13 12:28:16,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2682e59f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:28:16, skipping insertion in model container [2024-10-13 12:28:16,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:15" (2/3) ... [2024-10-13 12:28:16,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2682e59f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:28:16, skipping insertion in model container [2024-10-13 12:28:16,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:28:16" (3/3) ... [2024-10-13 12:28:16,338 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2024-10-13 12:28:16,356 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:28:16,357 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 12:28:16,357 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:28:16,419 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-13 12:28:16,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 27 transitions, 61 flow [2024-10-13 12:28:16,477 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2024-10-13 12:28:16,477 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-13 12:28:16,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 26 events. 4/26 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 35 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 12. Up to 2 conditions per place. [2024-10-13 12:28:16,481 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 27 transitions, 61 flow [2024-10-13 12:28:16,485 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 25 transitions, 56 flow [2024-10-13 12:28:16,498 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:28:16,506 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;@3a481ed8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:28:16,507 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-13 12:28:16,514 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:28:16,515 INFO L124 PetriNetUnfolderBase]: 4/23 cut-off events. [2024-10-13 12:28:16,515 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-13 12:28:16,515 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:28:16,516 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:28:16,517 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:28:16,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:28:16,522 INFO L85 PathProgramCache]: Analyzing trace with hash -378641850, now seen corresponding path program 1 times [2024-10-13 12:28:16,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:28:16,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434974716] [2024-10-13 12:28:16,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:28:16,544 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-10-13 12:28:16,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:28:16,564 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-10-13 12:28:16,566 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-10-13 12:28:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:28:16,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 12:28:16,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:28:16,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:28:16,711 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:28:16,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:28:16,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434974716] [2024-10-13 12:28:16,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434974716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:28:16,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:28:16,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:28:16,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80660713] [2024-10-13 12:28:16,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:28:16,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 12:28:16,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:28:16,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 12:28:16,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 12:28:16,774 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2024-10-13 12:28:16,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 25 transitions, 56 flow. Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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-10-13 12:28:16,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:28:16,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2024-10-13 12:28:16,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:28:16,836 INFO L124 PetriNetUnfolderBase]: 13/40 cut-off events. [2024-10-13 12:28:16,837 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-13 12:28:16,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 40 events. 13/40 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 83 event pairs, 6 based on Foata normal form. 3/39 useless extension candidates. Maximal degree in co-relation 56. Up to 30 conditions per place. [2024-10-13 12:28:16,840 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 12 selfloop transitions, 0 changer transitions 1/20 dead transitions. [2024-10-13 12:28:16,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 20 transitions, 70 flow [2024-10-13 12:28:16,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 12:28:16,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-13 12:28:16,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2024-10-13 12:28:16,856 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2024-10-13 12:28:16,858 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 56 flow. Second operand 2 states and 35 transitions. [2024-10-13 12:28:16,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 20 transitions, 70 flow [2024-10-13 12:28:16,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 20 transitions, 66 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:28:16,865 INFO L231 Difference]: Finished difference. Result has 21 places, 19 transitions, 40 flow [2024-10-13 12:28:16,869 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=40, PETRI_PLACES=21, PETRI_TRANSITIONS=19} [2024-10-13 12:28:16,874 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, -4 predicate places. [2024-10-13 12:28:16,876 INFO L471 AbstractCegarLoop]: Abstraction has has 21 places, 19 transitions, 40 flow [2024-10-13 12:28:16,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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-10-13 12:28:16,876 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:28:16,877 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:28:16,882 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-10-13 12:28:17,081 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-10-13 12:28:17,083 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:28:17,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:28:17,084 INFO L85 PathProgramCache]: Analyzing trace with hash -470810539, now seen corresponding path program 1 times [2024-10-13 12:28:17,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:28:17,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1302460242] [2024-10-13 12:28:17,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:28:17,086 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-10-13 12:28:17,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:28:17,093 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-10-13 12:28:17,095 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-10-13 12:28:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:28:17,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:28:17,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:28:17,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:28:17,171 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:28:17,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:28:17,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1302460242] [2024-10-13 12:28:17,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1302460242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:28:17,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:28:17,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:28:17,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558126434] [2024-10-13 12:28:17,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:28:17,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:28:17,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:28:17,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:28:17,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:28:17,180 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2024-10-13 12:28:17,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 19 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-10-13 12:28:17,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:28:17,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2024-10-13 12:28:17,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:28:17,246 INFO L124 PetriNetUnfolderBase]: 17/55 cut-off events. [2024-10-13 12:28:17,249 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:28:17,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 55 events. 17/55 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 4 based on Foata normal form. 4/56 useless extension candidates. Maximal degree in co-relation 93. Up to 30 conditions per place. [2024-10-13 12:28:17,251 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 15 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2024-10-13 12:28:17,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 24 transitions, 84 flow [2024-10-13 12:28:17,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:28:17,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:28:17,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2024-10-13 12:28:17,254 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-10-13 12:28:17,254 INFO L175 Difference]: Start difference. First operand has 21 places, 19 transitions, 40 flow. Second operand 3 states and 48 transitions. [2024-10-13 12:28:17,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 24 transitions, 84 flow [2024-10-13 12:28:17,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 24 transitions, 84 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:28:17,257 INFO L231 Difference]: Finished difference. Result has 23 places, 20 transitions, 52 flow [2024-10-13 12:28:17,258 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=23, PETRI_TRANSITIONS=20} [2024-10-13 12:28:17,261 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, -2 predicate places. [2024-10-13 12:28:17,262 INFO L471 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 52 flow [2024-10-13 12:28:17,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-10-13 12:28:17,269 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:28:17,269 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:28:17,276 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-10-13 12:28:17,472 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-10-13 12:28:17,473 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:28:17,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:28:17,474 INFO L85 PathProgramCache]: Analyzing trace with hash -382590475, now seen corresponding path program 1 times [2024-10-13 12:28:17,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:28:17,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946818775] [2024-10-13 12:28:17,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:28:17,475 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-10-13 12:28:17,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:28:17,479 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-10-13 12:28:17,481 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-10-13 12:28:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:28:17,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:28:17,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:28:17,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:28:17,550 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:28:17,550 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:28:17,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946818775] [2024-10-13 12:28:17,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1946818775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:28:17,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:28:17,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:28:17,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532723704] [2024-10-13 12:28:17,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:28:17,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:28:17,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:28:17,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:28:17,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:28:17,555 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2024-10-13 12:28:17,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 20 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:28:17,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:28:17,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2024-10-13 12:28:17,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:28:17,634 INFO L124 PetriNetUnfolderBase]: 25/82 cut-off events. [2024-10-13 12:28:17,635 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-10-13 12:28:17,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 82 events. 25/82 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 224 event pairs, 9 based on Foata normal form. 4/82 useless extension candidates. Maximal degree in co-relation 166. Up to 38 conditions per place. [2024-10-13 12:28:17,638 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 17 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2024-10-13 12:28:17,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 26 transitions, 112 flow [2024-10-13 12:28:17,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:28:17,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:28:17,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2024-10-13 12:28:17,640 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-10-13 12:28:17,640 INFO L175 Difference]: Start difference. First operand has 23 places, 20 transitions, 52 flow. Second operand 3 states and 48 transitions. [2024-10-13 12:28:17,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 26 transitions, 112 flow [2024-10-13 12:28:17,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 26 transitions, 108 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:28:17,642 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 62 flow [2024-10-13 12:28:17,642 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2024-10-13 12:28:17,643 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2024-10-13 12:28:17,643 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 62 flow [2024-10-13 12:28:17,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:28:17,644 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:28:17,645 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:28:17,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-13 12:28:17,847 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-10-13 12:28:17,848 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:28:17,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:28:17,849 INFO L85 PathProgramCache]: Analyzing trace with hash -85413656, now seen corresponding path program 1 times [2024-10-13 12:28:17,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:28:17,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245583669] [2024-10-13 12:28:17,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:28:17,850 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-10-13 12:28:17,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:28:17,854 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-10-13 12:28:17,855 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-10-13 12:28:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:28:17,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:28:17,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:28:17,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:28:17,955 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:28:17,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:28:17,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:28:17,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245583669] [2024-10-13 12:28:17,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1245583669] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:28:17,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:28:17,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-13 12:28:17,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199403988] [2024-10-13 12:28:17,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:28:17,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:28:17,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:28:17,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:28:17,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:28:18,001 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-10-13 12:28:18,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 62 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:28:18,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:28:18,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-10-13 12:28:18,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:28:18,182 INFO L124 PetriNetUnfolderBase]: 67/175 cut-off events. [2024-10-13 12:28:18,183 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2024-10-13 12:28:18,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 175 events. 67/175 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 609 event pairs, 10 based on Foata normal form. 18/189 useless extension candidates. Maximal degree in co-relation 404. Up to 36 conditions per place. [2024-10-13 12:28:18,186 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 35 selfloop transitions, 6 changer transitions 0/47 dead transitions. [2024-10-13 12:28:18,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 47 transitions, 240 flow [2024-10-13 12:28:18,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:28:18,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:28:18,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2024-10-13 12:28:18,192 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2024-10-13 12:28:18,192 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 62 flow. Second operand 6 states and 93 transitions. [2024-10-13 12:28:18,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 47 transitions, 240 flow [2024-10-13 12:28:18,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 47 transitions, 230 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:28:18,197 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 100 flow [2024-10-13 12:28:18,197 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=100, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2024-10-13 12:28:18,198 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 8 predicate places. [2024-10-13 12:28:18,198 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 100 flow [2024-10-13 12:28:18,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:28:18,200 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:28:18,200 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:28:18,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-13 12:28:18,403 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-10-13 12:28:18,404 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:28:18,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:28:18,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1664429240, now seen corresponding path program 2 times [2024-10-13 12:28:18,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:28:18,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175011725] [2024-10-13 12:28:18,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:28:18,406 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-10-13 12:28:18,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:28:18,409 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-10-13 12:28:18,411 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-10-13 12:28:18,469 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 12:28:18,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:28:18,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:28:18,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:28:18,547 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 12:28:18,547 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:28:18,671 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 12:28:18,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:28:18,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175011725] [2024-10-13 12:28:18,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175011725] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:28:18,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:28:18,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-13 12:28:18,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633629301] [2024-10-13 12:28:18,672 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:28:18,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 12:28:18,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:28:18,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 12:28:18,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-13 12:28:18,681 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-10-13 12:28:18,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 100 flow. Second operand has 12 states, 12 states have (on average 11.75) internal successors, (141), 12 states have internal predecessors, (141), 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-10-13 12:28:18,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:28:18,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-10-13 12:28:18,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:28:19,142 INFO L124 PetriNetUnfolderBase]: 139/355 cut-off events. [2024-10-13 12:28:19,142 INFO L125 PetriNetUnfolderBase]: For 567/567 co-relation queries the response was YES. [2024-10-13 12:28:19,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1062 conditions, 355 events. 139/355 cut-off events. For 567/567 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1370 event pairs, 10 based on Foata normal form. 36/387 useless extension candidates. Maximal degree in co-relation 1053. Up to 72 conditions per place. [2024-10-13 12:28:19,147 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 71 selfloop transitions, 12 changer transitions 0/89 dead transitions. [2024-10-13 12:28:19,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 89 transitions, 542 flow [2024-10-13 12:28:19,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 12:28:19,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-13 12:28:19,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 186 transitions. [2024-10-13 12:28:19,149 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2024-10-13 12:28:19,150 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 100 flow. Second operand 12 states and 186 transitions. [2024-10-13 12:28:19,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 89 transitions, 542 flow [2024-10-13 12:28:19,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 89 transitions, 522 flow, removed 9 selfloop flow, removed 1 redundant places. [2024-10-13 12:28:19,155 INFO L231 Difference]: Finished difference. Result has 50 places, 31 transitions, 188 flow [2024-10-13 12:28:19,155 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=92, 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=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=188, PETRI_PLACES=50, PETRI_TRANSITIONS=31} [2024-10-13 12:28:19,156 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 25 predicate places. [2024-10-13 12:28:19,156 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 31 transitions, 188 flow [2024-10-13 12:28:19,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.75) internal successors, (141), 12 states have internal predecessors, (141), 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-10-13 12:28:19,157 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:28:19,157 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:28:19,163 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-10-13 12:28:19,360 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-10-13 12:28:19,361 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:28:19,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:28:19,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1044101128, now seen corresponding path program 3 times [2024-10-13 12:28:19,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:28:19,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830993897] [2024-10-13 12:28:19,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 12:28:19,363 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-10-13 12:28:19,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:28:19,364 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-10-13 12:28:19,366 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-10-13 12:28:19,425 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-13 12:28:19,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:28:19,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:28:19,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:28:19,458 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-10-13 12:28:19,459 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:28:19,485 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-10-13 12:28:19,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:28:19,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830993897] [2024-10-13 12:28:19,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830993897] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:28:19,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:28:19,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-13 12:28:19,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097751883] [2024-10-13 12:28:19,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:28:19,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:28:19,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:28:19,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:28:19,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:28:19,496 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-10-13 12:28:19,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 31 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-10-13 12:28:19,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:28:19,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-10-13 12:28:19,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:28:19,683 INFO L124 PetriNetUnfolderBase]: 184/543 cut-off events. [2024-10-13 12:28:19,683 INFO L125 PetriNetUnfolderBase]: For 2246/2266 co-relation queries the response was YES. [2024-10-13 12:28:19,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1844 conditions, 543 events. 184/543 cut-off events. For 2246/2266 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2728 event pairs, 34 based on Foata normal form. 39/563 useless extension candidates. Maximal degree in co-relation 1828. Up to 165 conditions per place. [2024-10-13 12:28:19,691 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 74 selfloop transitions, 6 changer transitions 0/88 dead transitions. [2024-10-13 12:28:19,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 88 transitions, 866 flow [2024-10-13 12:28:19,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:28:19,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:28:19,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2024-10-13 12:28:19,693 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5679012345679012 [2024-10-13 12:28:19,693 INFO L175 Difference]: Start difference. First operand has 50 places, 31 transitions, 188 flow. Second operand 6 states and 92 transitions. [2024-10-13 12:28:19,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 88 transitions, 866 flow [2024-10-13 12:28:19,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 88 transitions, 836 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:28:19,702 INFO L231 Difference]: Finished difference. Result has 56 places, 34 transitions, 222 flow [2024-10-13 12:28:19,703 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=222, PETRI_PLACES=56, PETRI_TRANSITIONS=34} [2024-10-13 12:28:19,703 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 31 predicate places. [2024-10-13 12:28:19,703 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 34 transitions, 222 flow [2024-10-13 12:28:19,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-10-13 12:28:19,704 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:28:19,704 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:28:19,710 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-10-13 12:28:19,908 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-10-13 12:28:19,909 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:28:19,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:28:19,910 INFO L85 PathProgramCache]: Analyzing trace with hash 810261457, now seen corresponding path program 4 times [2024-10-13 12:28:19,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:28:19,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259488172] [2024-10-13 12:28:19,910 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 12:28:19,910 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-10-13 12:28:19,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:28:19,913 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-10-13 12:28:19,914 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-10-13 12:28:19,999 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 12:28:20,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:28:20,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:28:20,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:28:20,167 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 28 proven. 59 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-10-13 12:28:20,168 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:28:20,316 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 28 proven. 59 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-10-13 12:28:20,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:28:20,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259488172] [2024-10-13 12:28:20,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [259488172] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:28:20,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:28:20,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-13 12:28:20,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547901871] [2024-10-13 12:28:20,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:28:20,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 12:28:20,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:28:20,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 12:28:20,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-13 12:28:20,324 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-10-13 12:28:20,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 34 transitions, 222 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:28:20,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:28:20,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-10-13 12:28:20,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:28:20,837 INFO L124 PetriNetUnfolderBase]: 398/1113 cut-off events. [2024-10-13 12:28:20,837 INFO L125 PetriNetUnfolderBase]: For 5570/5630 co-relation queries the response was YES. [2024-10-13 12:28:20,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4243 conditions, 1113 events. 398/1113 cut-off events. For 5570/5630 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6577 event pairs, 24 based on Foata normal form. 78/1181 useless extension candidates. Maximal degree in co-relation 4223. Up to 363 conditions per place. [2024-10-13 12:28:20,852 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 158 selfloop transitions, 12 changer transitions 0/178 dead transitions. [2024-10-13 12:28:20,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 178 transitions, 1856 flow [2024-10-13 12:28:20,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 12:28:20,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-13 12:28:20,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 185 transitions. [2024-10-13 12:28:20,855 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5709876543209876 [2024-10-13 12:28:20,855 INFO L175 Difference]: Start difference. First operand has 56 places, 34 transitions, 222 flow. Second operand 12 states and 185 transitions. [2024-10-13 12:28:20,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 178 transitions, 1856 flow [2024-10-13 12:28:20,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 178 transitions, 1836 flow, removed 9 selfloop flow, removed 1 redundant places. [2024-10-13 12:28:20,867 INFO L231 Difference]: Finished difference. Result has 73 places, 41 transitions, 310 flow [2024-10-13 12:28:20,867 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=310, PETRI_PLACES=73, PETRI_TRANSITIONS=41} [2024-10-13 12:28:20,868 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 48 predicate places. [2024-10-13 12:28:20,868 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 41 transitions, 310 flow [2024-10-13 12:28:20,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:28:20,868 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:28:20,869 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:28:20,876 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-10-13 12:28:21,072 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-10-13 12:28:21,073 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:28:21,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:28:21,074 INFO L85 PathProgramCache]: Analyzing trace with hash 401434037, now seen corresponding path program 5 times [2024-10-13 12:28:21,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:28:21,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251217823] [2024-10-13 12:28:21,074 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 12:28:21,074 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-10-13 12:28:21,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:28:21,076 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-10-13 12:28:21,077 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-10-13 12:28:21,209 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2024-10-13 12:28:21,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:28:21,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 12:28:21,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:28:21,434 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 10 proven. 145 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-10-13 12:28:21,434 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:28:21,860 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 10 proven. 145 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-10-13 12:28:21,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:28:21,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251217823] [2024-10-13 12:28:21,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [251217823] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:28:21,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:28:21,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2024-10-13 12:28:21,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210834230] [2024-10-13 12:28:21,861 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:28:21,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-13 12:28:21,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:28:21,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-13 12:28:21,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2024-10-13 12:28:21,880 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-10-13 12:28:21,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 41 transitions, 310 flow. Second operand has 24 states, 24 states have (on average 11.333333333333334) internal successors, (272), 24 states have internal predecessors, (272), 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-10-13 12:28:21,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:28:21,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-10-13 12:28:21,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:28:23,436 INFO L124 PetriNetUnfolderBase]: 950/2480 cut-off events. [2024-10-13 12:28:23,436 INFO L125 PetriNetUnfolderBase]: For 18087/18087 co-relation queries the response was YES. [2024-10-13 12:28:23,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10193 conditions, 2480 events. 950/2480 cut-off events. For 18087/18087 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 16439 event pairs, 34 based on Foata normal form. 230/2681 useless extension candidates. Maximal degree in co-relation 10166. Up to 506 conditions per place. [2024-10-13 12:28:23,467 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 299 selfloop transitions, 22 changer transitions 0/329 dead transitions. [2024-10-13 12:28:23,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 329 transitions, 3724 flow [2024-10-13 12:28:23,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-13 12:28:23,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-10-13 12:28:23,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 340 transitions. [2024-10-13 12:28:23,469 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5723905723905723 [2024-10-13 12:28:23,470 INFO L175 Difference]: Start difference. First operand has 73 places, 41 transitions, 310 flow. Second operand 22 states and 340 transitions. [2024-10-13 12:28:23,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 329 transitions, 3724 flow [2024-10-13 12:28:23,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 329 transitions, 3598 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:28:23,493 INFO L231 Difference]: Finished difference. Result has 102 places, 52 transitions, 504 flow [2024-10-13 12:28:23,494 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=504, PETRI_PLACES=102, PETRI_TRANSITIONS=52} [2024-10-13 12:28:23,494 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 77 predicate places. [2024-10-13 12:28:23,495 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 52 transitions, 504 flow [2024-10-13 12:28:23,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 11.333333333333334) internal successors, (272), 24 states have internal predecessors, (272), 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-10-13 12:28:23,495 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:28:23,495 INFO L204 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:28:23,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-13 12:28:23,696 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-10-13 12:28:23,697 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:28:23,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:28:23,698 INFO L85 PathProgramCache]: Analyzing trace with hash -368439557, now seen corresponding path program 6 times [2024-10-13 12:28:23,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:28:23,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [383419982] [2024-10-13 12:28:23,700 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-13 12:28:23,700 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-10-13 12:28:23,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:28:23,710 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:28:23,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 12:28:23,930 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2024-10-13 12:28:23,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:28:23,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 12:28:23,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:28:24,218 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 20 proven. 235 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2024-10-13 12:28:24,218 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:28:24,703 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 20 proven. 235 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2024-10-13 12:28:24,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:28:24,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [383419982] [2024-10-13 12:28:24,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [383419982] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:28:24,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:28:24,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2024-10-13 12:28:24,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016353130] [2024-10-13 12:28:24,704 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:28:24,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-13 12:28:24,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:28:24,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-13 12:28:24,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2024-10-13 12:28:24,714 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-10-13 12:28:24,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 52 transitions, 504 flow. Second operand has 24 states, 24 states have (on average 12.083333333333334) internal successors, (290), 24 states have internal predecessors, (290), 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-10-13 12:28:24,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:28:24,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-10-13 12:28:24,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:28:26,700 INFO L124 PetriNetUnfolderBase]: 1390/3879 cut-off events. [2024-10-13 12:28:26,701 INFO L125 PetriNetUnfolderBase]: For 47299/47473 co-relation queries the response was YES. [2024-10-13 12:28:26,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18636 conditions, 3879 events. 1390/3879 cut-off events. For 47299/47473 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 27888 event pairs, 64 based on Foata normal form. 230/4070 useless extension candidates. Maximal degree in co-relation 18598. Up to 1323 conditions per place. [2024-10-13 12:28:26,768 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 508 selfloop transitions, 22 changer transitions 0/539 dead transitions. [2024-10-13 12:28:26,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 539 transitions, 7894 flow [2024-10-13 12:28:26,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-13 12:28:26,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-10-13 12:28:26,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 339 transitions. [2024-10-13 12:28:26,771 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5707070707070707 [2024-10-13 12:28:26,771 INFO L175 Difference]: Start difference. First operand has 102 places, 52 transitions, 504 flow. Second operand 22 states and 339 transitions. [2024-10-13 12:28:26,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 539 transitions, 7894 flow [2024-10-13 12:28:26,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 539 transitions, 7516 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-10-13 12:28:26,840 INFO L231 Difference]: Finished difference. Result has 125 places, 63 transitions, 686 flow [2024-10-13 12:28:26,840 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=686, PETRI_PLACES=125, PETRI_TRANSITIONS=63} [2024-10-13 12:28:26,841 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 100 predicate places. [2024-10-13 12:28:26,841 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 63 transitions, 686 flow [2024-10-13 12:28:26,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 12.083333333333334) internal successors, (290), 24 states have internal predecessors, (290), 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-10-13 12:28:26,842 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:28:26,842 INFO L204 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:28:26,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-13 12:28:27,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:28:27,043 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-13 12:28:27,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:28:27,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1980696427, now seen corresponding path program 7 times [2024-10-13 12:28:27,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:28:27,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823836519] [2024-10-13 12:28:27,045 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-13 12:28:27,045 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-10-13 12:28:27,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:28:27,049 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:28:27,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-13 12:28:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:28:27,320 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:28:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:28:27,661 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-13 12:28:27,662 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:28:27,663 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 3 remaining) [2024-10-13 12:28:27,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (1 of 3 remaining) [2024-10-13 12:28:27,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-10-13 12:28:27,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-13 12:28:27,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:28:27,867 INFO L407 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2024-10-13 12:28:28,021 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 12:28:28,021 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:28:28,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:28:28 BasicIcfg [2024-10-13 12:28:28,027 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:28:28,028 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:28:28,028 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:28:28,028 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:28:28,029 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:28:16" (3/4) ... [2024-10-13 12:28:28,030 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 12:28:28,031 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:28:28,032 INFO L158 Benchmark]: Toolchain (without parser) took 13381.27ms. Allocated memory was 54.5MB in the beginning and 289.4MB in the end (delta: 234.9MB). Free memory was 29.9MB in the beginning and 132.3MB in the end (delta: -102.4MB). Peak memory consumption was 133.3MB. Max. memory is 16.1GB. [2024-10-13 12:28:28,032 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 41.9MB. Free memory is still 18.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:28:28,033 INFO L158 Benchmark]: CACSL2BoogieTranslator took 921.27ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 29.8MB in the beginning and 40.8MB in the end (delta: -11.0MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2024-10-13 12:28:28,033 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.91ms. Allocated memory is still 67.1MB. Free memory was 40.8MB in the beginning and 38.3MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 12:28:28,033 INFO L158 Benchmark]: Boogie Preprocessor took 70.54ms. Allocated memory is still 67.1MB. Free memory was 38.3MB in the beginning and 36.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:28:28,033 INFO L158 Benchmark]: RCFGBuilder took 607.26ms. Allocated memory is still 67.1MB. Free memory was 35.7MB in the beginning and 38.8MB in the end (delta: -3.1MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2024-10-13 12:28:28,034 INFO L158 Benchmark]: TraceAbstraction took 11697.01ms. Allocated memory was 67.1MB in the beginning and 289.4MB in the end (delta: 222.3MB). Free memory was 37.9MB in the beginning and 132.3MB in the end (delta: -94.3MB). Peak memory consumption was 127.5MB. Max. memory is 16.1GB. [2024-10-13 12:28:28,034 INFO L158 Benchmark]: Witness Printer took 4.02ms. Allocated memory is still 289.4MB. Free memory is still 132.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:28:28,035 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.25ms. Allocated memory is still 41.9MB. Free memory is still 18.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 921.27ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 29.8MB in the beginning and 40.8MB in the end (delta: -11.0MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.91ms. Allocated memory is still 67.1MB. Free memory was 40.8MB in the beginning and 38.3MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.54ms. Allocated memory is still 67.1MB. Free memory was 38.3MB in the beginning and 36.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 607.26ms. Allocated memory is still 67.1MB. Free memory was 35.7MB in the beginning and 38.8MB in the end (delta: -3.1MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11697.01ms. Allocated memory was 67.1MB in the beginning and 289.4MB in the end (delta: 222.3MB). Free memory was 37.9MB in the beginning and 132.3MB in the end (delta: -94.3MB). Peak memory consumption was 127.5MB. Max. memory is 16.1GB. * Witness Printer took 4.02ms. Allocated memory is still 289.4MB. Free memory is still 132.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 12]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 12. Possible FailurePath: [L1320] 0 int myglobal; [L1321] 0 pthread_mutex_t mymutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1340] 0 pthread_t mythread; [L1341] 0 int i; [L1342] FCALL, FORK 0 pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0)) VAL [\old(arg)={0:0}, myglobal=0, mythread=0] [L1342] COND FALSE 0 !(pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0))) [L1352] 0 i=0 VAL [\old(arg)={0:0}, i=0, myglobal=0, mythread=0] [L1324] 1 int i,j; [L1325] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, i=0, myglobal=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=0, myglobal=0, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=0, myglobal=1, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=1, myglobal=1, mythread=0] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, myglobal=1] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=0, j=1, myglobal=1] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=0, j=2, myglobal=2] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=2, myglobal=2] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=2, myglobal=2] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=2, myglobal=2] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=3, myglobal=3] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=3, myglobal=3] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=3, myglobal=3] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=3, myglobal=3] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=4, myglobal=4] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=4, myglobal=4] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=4, myglobal=4] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=4, myglobal=4] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=5, myglobal=5] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=5, myglobal=5] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=5, myglobal=5] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=5, myglobal=5] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=6, myglobal=6] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=6, myglobal=6] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=6, myglobal=6] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=6, myglobal=6] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=7, myglobal=7] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=7, myglobal=7] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=7, myglobal=7] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=7, myglobal=7] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=8, myglobal=8] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=8, myglobal=8] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=8, myglobal=8] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=8, myglobal=8] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=9, myglobal=9] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=9, myglobal=9] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=9, myglobal=9] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=9, myglobal=9] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=10, myglobal=10] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=10, myglobal=10] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=10, myglobal=10] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=10, myglobal=10] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=11, myglobal=11] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=11, myglobal=11] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=11, myglobal=11] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=11, myglobal=11] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=12, myglobal=12] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=12, myglobal=12] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=12, myglobal=12] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=12, myglobal=12] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=13, myglobal=13] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=13, myglobal=13] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=13, myglobal=13] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=13, myglobal=13] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=14, myglobal=14] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=14, myglobal=14] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=14, myglobal=14] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=14, myglobal=14] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=15, myglobal=15] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=15, myglobal=15] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=15, myglobal=15] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=15, myglobal=15] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=16, myglobal=16] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=16, myglobal=16] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=16, myglobal=16] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=16, myglobal=16] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=17, myglobal=17] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=17, myglobal=17] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=17, myglobal=17] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=17, myglobal=17] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=18, myglobal=18] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=18, myglobal=18] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=18, myglobal=18] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=18, myglobal=18] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=19, myglobal=19] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=19, myglobal=19] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=19, myglobal=19] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=19, myglobal=19] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=20, myglobal=20] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=20, myglobal=20] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=20, myglobal=20] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=20, myglobal=20] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=21, myglobal=21] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, j=21, myglobal=21] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=1, i=20, j=21, myglobal=21, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=1, i=20, j=21, myglobal=22, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=2, i=20, j=21, myglobal=22, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=2, i=20, j=21, myglobal=22, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=2, i=20, j=21, myglobal=23, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=3, j=21, myglobal=23, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=3, j=21, myglobal=23, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=3, j=21, myglobal=24, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=4, j=21, myglobal=24, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=4, j=21, myglobal=24, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=4, j=21, myglobal=25, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=5, j=21, myglobal=25, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=5, j=21, myglobal=25, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=5, j=21, myglobal=26, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=6, j=21, myglobal=26, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=6, j=21, myglobal=26, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=6, j=21, myglobal=27, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=7, j=21, myglobal=27, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=7, j=21, myglobal=27, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=7, j=21, myglobal=28, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=8, j=21, myglobal=28, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=8, j=21, myglobal=28, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=8, j=21, myglobal=29, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=9, j=21, myglobal=29, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=9, j=21, myglobal=29, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=9, j=21, myglobal=30, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=20, j=21, myglobal=30, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=20, j=21, myglobal=30, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=20, j=21, myglobal=31, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=11, i=20, j=21, myglobal=31, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=11, i=20, j=21, myglobal=31, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=11, i=20, j=21, myglobal=32, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=12, i=20, j=21, myglobal=32, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=12, i=20, j=21, myglobal=32, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=12, i=20, j=21, myglobal=33, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=13, i=20, j=21, myglobal=33, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=13, i=20, j=21, myglobal=33, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=13, i=20, j=21, myglobal=34, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=14, i=20, j=21, myglobal=34, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=14, i=20, j=21, myglobal=34, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=14, i=20, j=21, myglobal=35, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=15, i=20, j=21, myglobal=35, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=15, i=20, j=21, myglobal=35, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=15, i=20, j=21, myglobal=36, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=16, i=20, j=21, myglobal=36, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=16, i=20, j=21, myglobal=36, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=16, i=20, j=21, myglobal=37, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=17, i=20, j=21, myglobal=37, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=17, i=20, j=21, myglobal=37, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=17, i=20, j=21, myglobal=38, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=18, i=20, j=21, myglobal=38, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=18, i=20, j=21, myglobal=38, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=18, i=20, j=21, myglobal=39, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=19, i=20, j=21, myglobal=39, mythread=0] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=19, i=20, j=21, myglobal=39, mythread=0] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=19, i=20, j=21, myglobal=40, mythread=0] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=20, j=21, myglobal=40, mythread=0] [L1352] COND FALSE 0 !(i<20) VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=20, j=21, myglobal=40, mythread=0] [L1325] COND FALSE 1 !(i<20) [L1336] 1 return ((void *)0); [L1358] FCALL, JOIN 1 pthread_join ( mythread, ((void *)0) ) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, i=20, i=20, j=21, myglobal=40, mythread=0] [L1358] COND FALSE 0 !(pthread_join ( mythread, ((void *)0) )) [L1362] CALL 0 __VERIFIER_assert(myglobal != 40) [L13] COND TRUE 0 !(cond) [L13] CALL 0 reach_error() [L12] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, i=20, j=21, myglobal=40] [L12] 0 __assert_fail ("0", "pthread-demo-datarace-2.c", 25, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, i=20, j=21, myglobal=40] - UnprovableResult [Line: 1338]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1342]: 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 3 procedures, 32 locations, 3 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: 11.4s, OverallIterations: 10, TraceHistogramMax: 20, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 887 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 879 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2544 IncrementalHoareTripleChecker+Invalid, 2557 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 2 mSDtfsCounter, 2544 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 785 GetRequests, 685 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=686occurred in iteration=9, InterpolantAutomatonStates: 88, 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.6s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 573 NumberOfCodeBlocks, 549 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 753 ConstructedInterpolants, 0 QuantifiedInterpolants, 2219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 657 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 2185/3111 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-10-13 12:28:28,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample