./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../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 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-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-assert-order-craig-3061b6d-m [2024-11-19 09:37:24,202 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:37:24,264 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:37:24,268 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:37:24,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:37:24,288 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:37:24,289 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:37:24,289 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:37:24,290 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:37:24,290 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:37:24,290 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:37:24,291 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:37:24,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:37:24,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:37:24,292 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:37:24,292 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:37:24,293 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:37:24,293 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:37:24,293 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:37:24,294 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:37:24,294 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:37:24,298 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:37:24,299 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:37:24,299 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:37:24,299 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:37:24,299 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:37:24,299 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:37:24,300 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:37:24,300 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:37:24,300 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:37:24,300 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:37:24,300 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:37:24,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:37:24,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:37:24,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:37:24,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:37:24,302 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:37:24,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:37:24,303 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:37:24,304 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:37:24,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:37:24,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:37:24,305 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-11-19 09:37:24,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:37:24,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:37:24,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:37:24,606 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:37:24,609 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:37:24,610 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i [2024-11-19 09:37:26,110 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:37:26,418 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:37:26,418 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i [2024-11-19 09:37:26,439 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b44f30f6c/fab3c379ec1642538172c85a2a0d4f03/FLAG10a3e36ee [2024-11-19 09:37:26,459 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b44f30f6c/fab3c379ec1642538172c85a2a0d4f03 [2024-11-19 09:37:26,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:37:26,464 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:37:26,466 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:37:26,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:37:26,471 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:37:26,472 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:37:26" (1/1) ... [2024-11-19 09:37:26,475 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1544ddea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:26, skipping insertion in model container [2024-11-19 09:37:26,475 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:37:26" (1/1) ... [2024-11-19 09:37:26,553 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:37:27,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:37:27,105 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:37:27,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:37:27,242 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:37:27,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:27 WrapperNode [2024-11-19 09:37:27,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:37:27,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:37:27,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:37:27,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:37:27,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:27" (1/1) ... [2024-11-19 09:37:27,282 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:27" (1/1) ... [2024-11-19 09:37:27,318 INFO L138 Inliner]: procedures = 364, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 116 [2024-11-19 09:37:27,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:37:27,319 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:37:27,319 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:37:27,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:37:27,330 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:27" (1/1) ... [2024-11-19 09:37:27,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:27" (1/1) ... [2024-11-19 09:37:27,335 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:27" (1/1) ... [2024-11-19 09:37:27,360 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 09:37:27,364 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:27" (1/1) ... [2024-11-19 09:37:27,365 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:27" (1/1) ... [2024-11-19 09:37:27,372 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:27" (1/1) ... [2024-11-19 09:37:27,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:27" (1/1) ... [2024-11-19 09:37:27,380 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:27" (1/1) ... [2024-11-19 09:37:27,383 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:27" (1/1) ... [2024-11-19 09:37:27,386 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:37:27,391 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:37:27,391 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:37:27,391 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:37:27,393 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:27" (1/1) ... [2024-11-19 09:37:27,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:37:27,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:37:27,435 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:37:27,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:37:27,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 09:37:27,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 09:37:27,493 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2024-11-19 09:37:27,493 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2024-11-19 09:37:27,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:37:27,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:37:27,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:37:27,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:37:27,495 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:37:27,623 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:37:27,625 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:37:27,826 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:37:27,827 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:37:28,233 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:37:28,234 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 09:37:28,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:37:28 BoogieIcfgContainer [2024-11-19 09:37:28,234 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:37:28,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:37:28,238 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:37:28,241 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:37:28,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:37:26" (1/3) ... [2024-11-19 09:37:28,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c8b2cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:37:28, skipping insertion in model container [2024-11-19 09:37:28,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:27" (2/3) ... [2024-11-19 09:37:28,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c8b2cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:37:28, skipping insertion in model container [2024-11-19 09:37:28,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:37:28" (3/3) ... [2024-11-19 09:37:28,245 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2024-11-19 09:37:28,262 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:37:28,263 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 09:37:28,263 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:37:28,299 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-19 09:37:28,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 27 transitions, 61 flow [2024-11-19 09:37:28,367 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2024-11-19 09:37:28,368 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 09:37:28,373 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-11-19 09:37:28,373 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 27 transitions, 61 flow [2024-11-19 09:37:28,378 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 25 transitions, 56 flow [2024-11-19 09:37:28,395 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:37:28,406 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;@36c92c4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:37:28,407 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-19 09:37:28,423 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:37:28,423 INFO L124 PetriNetUnfolderBase]: 4/23 cut-off events. [2024-11-19 09:37:28,424 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 09:37:28,424 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:37:28,425 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:37:28,425 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 09:37:28,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:37:28,431 INFO L85 PathProgramCache]: Analyzing trace with hash 2021529890, now seen corresponding path program 1 times [2024-11-19 09:37:28,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:37:28,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469712895] [2024-11-19 09:37:28,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:37:28,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:37:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:37:28,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:37:28,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:37:28,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469712895] [2024-11-19 09:37:28,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469712895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:37:28,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:37:28,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:37:28,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821336779] [2024-11-19 09:37:28,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:37:28,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:37:28,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:37:28,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:37:28,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:37:28,836 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2024-11-19 09:37:28,839 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-11-19 09:37:28,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:37:28,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2024-11-19 09:37:28,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:37:28,905 INFO L124 PetriNetUnfolderBase]: 17/56 cut-off events. [2024-11-19 09:37:28,906 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 09:37:28,907 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-11-19 09:37:28,909 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 15 selfloop transitions, 2 changer transitions 1/25 dead transitions. [2024-11-19 09:37:28,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 25 transitions, 90 flow [2024-11-19 09:37:28,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:37:28,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:37:28,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2024-11-19 09:37:28,923 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2024-11-19 09:37:28,926 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 56 flow. Second operand 3 states and 51 transitions. [2024-11-19 09:37:28,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 25 transitions, 90 flow [2024-11-19 09:37:28,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 25 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:37:28,932 INFO L231 Difference]: Finished difference. Result has 23 places, 20 transitions, 52 flow [2024-11-19 09:37:28,935 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-11-19 09:37:28,939 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, -2 predicate places. [2024-11-19 09:37:28,939 INFO L471 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 52 flow [2024-11-19 09:37:28,939 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-11-19 09:37:28,939 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:37:28,940 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:37:28,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:37:28,942 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 09:37:28,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:37:28,943 INFO L85 PathProgramCache]: Analyzing trace with hash 518263413, now seen corresponding path program 1 times [2024-11-19 09:37:28,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:37:28,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150371473] [2024-11-19 09:37:28,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:37:28,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:37:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:37:29,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:37:29,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:37:29,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150371473] [2024-11-19 09:37:29,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150371473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:37:29,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:37:29,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:37:29,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996920623] [2024-11-19 09:37:29,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:37:29,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:37:29,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:37:29,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:37:29,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:37:29,162 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2024-11-19 09:37:29,163 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-11-19 09:37:29,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:37:29,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2024-11-19 09:37:29,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:37:29,230 INFO L124 PetriNetUnfolderBase]: 25/82 cut-off events. [2024-11-19 09:37:29,230 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-11-19 09:37:29,231 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-11-19 09:37:29,232 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 17 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2024-11-19 09:37:29,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 26 transitions, 112 flow [2024-11-19 09:37:29,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:37:29,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:37:29,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2024-11-19 09:37:29,235 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-11-19 09:37:29,235 INFO L175 Difference]: Start difference. First operand has 23 places, 20 transitions, 52 flow. Second operand 3 states and 48 transitions. [2024-11-19 09:37:29,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 26 transitions, 112 flow [2024-11-19 09:37:29,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 26 transitions, 108 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:37:29,238 INFO L231 Difference]: Finished difference. Result has 24 places, 21 transitions, 62 flow [2024-11-19 09:37:29,239 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-11-19 09:37:29,239 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2024-11-19 09:37:29,240 INFO L471 AbstractCegarLoop]: Abstraction has has 24 places, 21 transitions, 62 flow [2024-11-19 09:37:29,240 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-11-19 09:37:29,241 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:37:29,241 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-11-19 09:37:29,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 09:37:29,242 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 09:37:29,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:37:29,246 INFO L85 PathProgramCache]: Analyzing trace with hash 378845636, now seen corresponding path program 1 times [2024-11-19 09:37:29,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:37:29,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885040115] [2024-11-19 09:37:29,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:37:29,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:37:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:37:29,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:37:29,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:37:29,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885040115] [2024-11-19 09:37:29,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885040115] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:37:29,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469250529] [2024-11-19 09:37:29,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:37:29,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:37:29,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:37:29,371 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:37:29,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 09:37:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:37:29,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:37:29,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:37:29,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:37:29,606 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:37:29,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:37:29,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469250529] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:37:29,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:37:29,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-19 09:37:29,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911121051] [2024-11-19 09:37:29,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:37:29,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 09:37:29,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:37:29,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 09:37:29,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 09:37:29,655 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-11-19 09:37:29,656 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-11-19 09:37:29,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:37:29,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-11-19 09:37:29,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:37:29,905 INFO L124 PetriNetUnfolderBase]: 76/215 cut-off events. [2024-11-19 09:37:29,906 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2024-11-19 09:37:29,907 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-11-19 09:37:29,909 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 42 selfloop transitions, 33 changer transitions 0/81 dead transitions. [2024-11-19 09:37:29,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 81 transitions, 406 flow [2024-11-19 09:37:29,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 09:37:29,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-19 09:37:29,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 233 transitions. [2024-11-19 09:37:29,914 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5393518518518519 [2024-11-19 09:37:29,914 INFO L175 Difference]: Start difference. First operand has 24 places, 21 transitions, 62 flow. Second operand 16 states and 233 transitions. [2024-11-19 09:37:29,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 81 transitions, 406 flow [2024-11-19 09:37:29,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 81 transitions, 400 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:37:29,919 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 334 flow [2024-11-19 09:37:29,919 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-11-19 09:37:29,920 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 26 predicate places. [2024-11-19 09:37:29,921 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 334 flow [2024-11-19 09:37:29,921 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-11-19 09:37:29,921 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:37:29,922 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-11-19 09:37:29,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 09:37:30,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:37:30,123 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 09:37:30,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:37:30,124 INFO L85 PathProgramCache]: Analyzing trace with hash -455538255, now seen corresponding path program 2 times [2024-11-19 09:37:30,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:37:30,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540591113] [2024-11-19 09:37:30,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:37:30,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:37:30,197 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:37:30,197 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:37:30,332 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 09:37:30,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:37:30,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540591113] [2024-11-19 09:37:30,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540591113] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:37:30,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204968645] [2024-11-19 09:37:30,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:37:30,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:37:30,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:37:30,337 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:37:30,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 09:37:30,515 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:37:30,515 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:37:30,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:37:30,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:37:30,581 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 09:37:30,581 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:37:30,656 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 09:37:30,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204968645] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:37:30,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:37:30,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-19 09:37:30,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504303666] [2024-11-19 09:37:30,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:37:30,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 09:37:30,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:37:30,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 09:37:30,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-19 09:37:30,667 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-11-19 09:37:30,668 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-11-19 09:37:30,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:37:30,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-11-19 09:37:30,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:37:30,848 INFO L124 PetriNetUnfolderBase]: 175/501 cut-off events. [2024-11-19 09:37:30,848 INFO L125 PetriNetUnfolderBase]: For 3066/3066 co-relation queries the response was YES. [2024-11-19 09:37:30,852 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-11-19 09:37:30,855 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 61 selfloop transitions, 20 changer transitions 0/90 dead transitions. [2024-11-19 09:37:30,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 90 transitions, 846 flow [2024-11-19 09:37:30,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:37:30,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:37:30,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2024-11-19 09:37:30,857 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2024-11-19 09:37:30,857 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 334 flow. Second operand 8 states and 124 transitions. [2024-11-19 09:37:30,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 90 transitions, 846 flow [2024-11-19 09:37:30,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 90 transitions, 770 flow, removed 26 selfloop flow, removed 2 redundant places. [2024-11-19 09:37:30,870 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 404 flow [2024-11-19 09:37:30,870 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-11-19 09:37:30,871 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 36 predicate places. [2024-11-19 09:37:30,871 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 404 flow [2024-11-19 09:37:30,871 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-11-19 09:37:30,871 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:37:30,871 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-11-19 09:37:30,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 09:37:31,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-19 09:37:31,073 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 09:37:31,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:37:31,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1961131491, now seen corresponding path program 3 times [2024-11-19 09:37:31,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:37:31,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354851039] [2024-11-19 09:37:31,075 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:37:31,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:37:31,113 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-19 09:37:31,114 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:37:31,250 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-19 09:37:31,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:37:31,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354851039] [2024-11-19 09:37:31,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354851039] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:37:31,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486033401] [2024-11-19 09:37:31,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:37:31,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:37:31,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:37:31,253 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:37:31,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 09:37:31,421 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-19 09:37:31,422 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:37:31,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:37:31,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:37:31,490 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-19 09:37:31,490 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:37:31,602 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-19 09:37:31,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486033401] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:37:31,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:37:31,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-19 09:37:31,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104020229] [2024-11-19 09:37:31,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:37:31,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 09:37:31,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:37:31,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 09:37:31,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-19 09:37:31,617 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-11-19 09:37:31,617 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-11-19 09:37:31,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:37:31,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-11-19 09:37:31,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:37:31,852 INFO L124 PetriNetUnfolderBase]: 266/767 cut-off events. [2024-11-19 09:37:31,852 INFO L125 PetriNetUnfolderBase]: For 9650/9698 co-relation queries the response was YES. [2024-11-19 09:37:31,855 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-11-19 09:37:31,862 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 144 selfloop transitions, 36 changer transitions 0/187 dead transitions. [2024-11-19 09:37:31,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 187 transitions, 2298 flow [2024-11-19 09:37:31,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 09:37:31,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 09:37:31,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 185 transitions. [2024-11-19 09:37:31,864 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5709876543209876 [2024-11-19 09:37:31,864 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 404 flow. Second operand 12 states and 185 transitions. [2024-11-19 09:37:31,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 187 transitions, 2298 flow [2024-11-19 09:37:31,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 187 transitions, 2054 flow, removed 88 selfloop flow, removed 2 redundant places. [2024-11-19 09:37:31,880 INFO L231 Difference]: Finished difference. Result has 77 places, 74 transitions, 632 flow [2024-11-19 09:37:31,881 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-11-19 09:37:31,881 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 52 predicate places. [2024-11-19 09:37:31,882 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 74 transitions, 632 flow [2024-11-19 09:37:31,882 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-11-19 09:37:31,882 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:37:31,882 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-11-19 09:37:31,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 09:37:32,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:37:32,087 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 09:37:32,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:37:32,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1295691281, now seen corresponding path program 4 times [2024-11-19 09:37:32,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:37:32,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494906444] [2024-11-19 09:37:32,088 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:37:32,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:37:32,133 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:37:32,133 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:37:32,313 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 10 proven. 51 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-11-19 09:37:32,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:37:32,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494906444] [2024-11-19 09:37:32,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494906444] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:37:32,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937331263] [2024-11-19 09:37:32,315 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:37:32,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:37:32,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:37:32,335 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:37:32,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 09:37:32,488 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:37:32,489 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:37:32,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:37:32,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:37:32,591 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 10 proven. 51 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-11-19 09:37:32,591 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:37:32,776 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 10 proven. 51 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-11-19 09:37:32,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937331263] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:37:32,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:37:32,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-11-19 09:37:32,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373256830] [2024-11-19 09:37:32,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:37:32,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 09:37:32,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:37:32,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 09:37:32,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2024-11-19 09:37:32,784 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-11-19 09:37:32,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 74 transitions, 632 flow. Second operand has 16 states, 16 states have (on average 11.5) internal successors, (184), 16 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:37:32,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:37:32,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-11-19 09:37:32,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:37:33,252 INFO L124 PetriNetUnfolderBase]: 758/2054 cut-off events. [2024-11-19 09:37:33,252 INFO L125 PetriNetUnfolderBase]: For 18092/18167 co-relation queries the response was YES. [2024-11-19 09:37:33,264 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-11-19 09:37:33,275 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 215 selfloop transitions, 28 changer transitions 0/255 dead transitions. [2024-11-19 09:37:33,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 255 transitions, 3026 flow [2024-11-19 09:37:33,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 09:37:33,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-19 09:37:33,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 248 transitions. [2024-11-19 09:37:33,277 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2024-11-19 09:37:33,277 INFO L175 Difference]: Start difference. First operand has 77 places, 74 transitions, 632 flow. Second operand 16 states and 248 transitions. [2024-11-19 09:37:33,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 255 transitions, 3026 flow [2024-11-19 09:37:33,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 255 transitions, 2936 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:37:33,302 INFO L231 Difference]: Finished difference. Result has 98 places, 83 transitions, 830 flow [2024-11-19 09:37:33,303 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-11-19 09:37:33,303 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 73 predicate places. [2024-11-19 09:37:33,303 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 83 transitions, 830 flow [2024-11-19 09:37:33,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.5) internal successors, (184), 16 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:37:33,304 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:37:33,304 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-11-19 09:37:33,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 09:37:33,508 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-11-19 09:37:33,509 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 09:37:33,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:37:33,509 INFO L85 PathProgramCache]: Analyzing trace with hash -40959491, now seen corresponding path program 5 times [2024-11-19 09:37:33,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:37:33,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814916908] [2024-11-19 09:37:33,510 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 09:37:33,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:37:33,565 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2024-11-19 09:37:33,566 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:37:33,904 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 130 proven. 287 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-19 09:37:33,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:37:33,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814916908] [2024-11-19 09:37:33,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814916908] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:37:33,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655637812] [2024-11-19 09:37:33,905 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 09:37:33,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:37:33,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:37:33,907 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:37:33,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 09:37:34,071 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2024-11-19 09:37:34,071 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:37:34,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 09:37:34,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:37:34,184 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 130 proven. 287 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-19 09:37:34,185 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:37:34,479 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 130 proven. 287 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-19 09:37:34,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655637812] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:37:34,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:37:34,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 22 [2024-11-19 09:37:34,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175543897] [2024-11-19 09:37:34,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:37:34,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-19 09:37:34,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:37:34,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 09:37:34,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2024-11-19 09:37:34,498 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-11-19 09:37:34,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 83 transitions, 830 flow. Second operand has 22 states, 22 states have (on average 11.5) internal successors, (253), 22 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:37:34,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:37:34,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-11-19 09:37:34,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:37:35,164 INFO L124 PetriNetUnfolderBase]: 1045/2802 cut-off events. [2024-11-19 09:37:35,165 INFO L125 PetriNetUnfolderBase]: For 41181/41295 co-relation queries the response was YES. [2024-11-19 09:37:35,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13706 conditions, 2802 events. 1045/2802 cut-off events. For 41181/41295 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 18551 event pairs, 109 based on Foata normal form. 276/3012 useless extension candidates. Maximal degree in co-relation 11180. Up to 627 conditions per place. [2024-11-19 09:37:35,201 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 299 selfloop transitions, 34 changer transitions 0/345 dead transitions. [2024-11-19 09:37:35,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 345 transitions, 4188 flow [2024-11-19 09:37:35,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 09:37:35,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-11-19 09:37:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 336 transitions. [2024-11-19 09:37:35,203 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5656565656565656 [2024-11-19 09:37:35,203 INFO L175 Difference]: Start difference. First operand has 98 places, 83 transitions, 830 flow. Second operand 22 states and 336 transitions. [2024-11-19 09:37:35,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 345 transitions, 4188 flow [2024-11-19 09:37:35,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 345 transitions, 4158 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 09:37:35,252 INFO L231 Difference]: Finished difference. Result has 121 places, 90 transitions, 1020 flow [2024-11-19 09:37:35,252 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-11-19 09:37:35,253 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 96 predicate places. [2024-11-19 09:37:35,253 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 90 transitions, 1020 flow [2024-11-19 09:37:35,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 11.5) internal successors, (253), 22 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:37:35,253 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:37:35,254 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-11-19 09:37:35,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 09:37:35,454 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-11-19 09:37:35,455 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 09:37:35,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:37:35,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1006281555, now seen corresponding path program 6 times [2024-11-19 09:37:35,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:37:35,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241483189] [2024-11-19 09:37:35,456 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 09:37:35,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:37:35,535 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2024-11-19 09:37:35,535 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:37:35,795 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 20 proven. 235 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2024-11-19 09:37:35,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:37:35,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241483189] [2024-11-19 09:37:35,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241483189] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:37:35,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557828744] [2024-11-19 09:37:35,796 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 09:37:35,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:37:35,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:37:35,798 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:37:35,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 09:37:35,979 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2024-11-19 09:37:35,980 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:37:35,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 09:37:35,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:37:36,140 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 20 proven. 235 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2024-11-19 09:37:36,141 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:37:36,430 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 20 proven. 235 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2024-11-19 09:37:36,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557828744] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:37:36,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:37:36,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2024-11-19 09:37:36,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973253059] [2024-11-19 09:37:36,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:37:36,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-19 09:37:36,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:37:36,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-19 09:37:36,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2024-11-19 09:37:36,449 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-11-19 09:37:36,450 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-11-19 09:37:36,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:37:36,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-11-19 09:37:36,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:37:37,655 INFO L124 PetriNetUnfolderBase]: 1388/3809 cut-off events. [2024-11-19 09:37:37,655 INFO L125 PetriNetUnfolderBase]: For 99558/99798 co-relation queries the response was YES. [2024-11-19 09:37:37,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23200 conditions, 3809 events. 1388/3809 cut-off events. For 99558/99798 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 27300 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-11-19 09:37:37,716 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 588 selfloop transitions, 66 changer transitions 0/663 dead transitions. [2024-11-19 09:37:37,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 663 transitions, 12386 flow [2024-11-19 09:37:37,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 09:37:37,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-11-19 09:37:37,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 339 transitions. [2024-11-19 09:37:37,718 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5707070707070707 [2024-11-19 09:37:37,718 INFO L175 Difference]: Start difference. First operand has 121 places, 90 transitions, 1020 flow. Second operand 22 states and 339 transitions. [2024-11-19 09:37:37,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 663 transitions, 12386 flow [2024-11-19 09:37:37,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 663 transitions, 11760 flow, removed 0 selfloop flow, removed 13 redundant places. [2024-11-19 09:37:37,895 INFO L231 Difference]: Finished difference. Result has 140 places, 123 transitions, 1534 flow [2024-11-19 09:37:37,899 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-11-19 09:37:37,901 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 115 predicate places. [2024-11-19 09:37:37,901 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 123 transitions, 1534 flow [2024-11-19 09:37:37,901 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-11-19 09:37:37,902 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:37:37,902 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-11-19 09:37:37,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 09:37:38,106 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-11-19 09:37:38,107 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 09:37:38,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:37:38,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1241951759, now seen corresponding path program 7 times [2024-11-19 09:37:38,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:37:38,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070054768] [2024-11-19 09:37:38,108 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 09:37:38,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:37:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:37:38,193 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:37:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:37:38,292 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 09:37:38,292 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:37:38,293 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 3 remaining) [2024-11-19 09:37:38,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (1 of 3 remaining) [2024-11-19 09:37:38,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-19 09:37:38,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 09:37:38,296 INFO L407 BasicCegarLoop]: Path program histogram: [7, 1, 1] [2024-11-19 09:37:38,426 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:37:38,426 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:37:38,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:37:38 BasicIcfg [2024-11-19 09:37:38,431 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:37:38,432 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:37:38,432 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:37:38,432 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:37:38,433 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:37:28" (3/4) ... [2024-11-19 09:37:38,436 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 09:37:38,437 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:37:38,438 INFO L158 Benchmark]: Toolchain (without parser) took 11974.12ms. Allocated memory was 155.2MB in the beginning and 325.1MB in the end (delta: 169.9MB). Free memory was 80.2MB in the beginning and 177.2MB in the end (delta: -97.0MB). Peak memory consumption was 74.7MB. Max. memory is 16.1GB. [2024-11-19 09:37:38,439 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:37:38,439 INFO L158 Benchmark]: CACSL2BoogieTranslator took 777.50ms. Allocated memory is still 155.2MB. Free memory was 80.0MB in the beginning and 90.2MB in the end (delta: -10.2MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2024-11-19 09:37:38,442 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.52ms. Allocated memory is still 155.2MB. Free memory was 90.2MB in the beginning and 87.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 09:37:38,442 INFO L158 Benchmark]: Boogie Preprocessor took 70.80ms. Allocated memory is still 155.2MB. Free memory was 87.3MB in the beginning and 84.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:37:38,443 INFO L158 Benchmark]: RCFGBuilder took 843.59ms. Allocated memory is still 155.2MB. Free memory was 84.5MB in the beginning and 101.4MB in the end (delta: -16.9MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. [2024-11-19 09:37:38,443 INFO L158 Benchmark]: TraceAbstraction took 10194.14ms. Allocated memory was 155.2MB in the beginning and 325.1MB in the end (delta: 169.9MB). Free memory was 101.4MB in the beginning and 177.2MB in the end (delta: -75.8MB). Peak memory consumption was 93.9MB. Max. memory is 16.1GB. [2024-11-19 09:37:38,445 INFO L158 Benchmark]: Witness Printer took 5.52ms. Allocated memory is still 325.1MB. Free memory is still 177.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:37:38,446 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.19ms. Allocated memory is still 155.2MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 777.50ms. Allocated memory is still 155.2MB. Free memory was 80.0MB in the beginning and 90.2MB in the end (delta: -10.2MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.52ms. Allocated memory is still 155.2MB. Free memory was 90.2MB in the beginning and 87.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.80ms. Allocated memory is still 155.2MB. Free memory was 87.3MB in the beginning and 84.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 843.59ms. Allocated memory is still 155.2MB. Free memory was 84.5MB in the beginning and 101.4MB in the end (delta: -16.9MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10194.14ms. Allocated memory was 155.2MB in the beginning and 325.1MB in the end (delta: 169.9MB). Free memory was 101.4MB in the beginning and 177.2MB in the end (delta: -75.8MB). Peak memory consumption was 93.9MB. Max. memory is 16.1GB. * Witness Printer took 5.52ms. Allocated memory is still 325.1MB. Free memory is still 177.2MB. 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.0s, OverallIterations: 9, TraceHistogramMax: 20, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 534 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 520 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 856 IncrementalHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 1 mSDtfsCounter, 856 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 881 GetRequests, 780 SyntacticMatches, 12 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 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.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1012 NumberOfCodeBlocks, 976 NumberOfCodeBlocksAsserted, 107 NumberOfCheckSat, 1229 ConstructedInterpolants, 0 QuantifiedInterpolants, 3229 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1193 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-11-19 09:37:38,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-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-assert-order-craig-3061b6d-m [2024-11-19 09:37:40,756 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:37:40,837 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 09:37:40,843 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:37:40,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:37:40,881 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:37:40,881 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:37:40,882 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:37:40,882 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:37:40,883 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:37:40,883 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:37:40,884 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:37:40,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:37:40,885 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:37:40,887 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:37:40,887 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:37:40,888 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:37:40,888 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:37:40,888 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:37:40,888 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:37:40,889 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:37:40,891 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:37:40,892 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:37:40,892 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:37:40,892 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:37:40,892 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 09:37:40,892 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:37:40,893 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 09:37:40,893 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:37:40,893 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:37:40,893 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:37:40,894 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:37:40,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:37:40,894 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:37:40,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:37:40,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:37:40,895 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:37:40,895 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:37:40,898 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 09:37:40,898 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 09:37:40,898 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:37:40,898 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:37:40,899 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:37:40,899 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:37:40,900 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-11-19 09:37:41,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:37:41,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:37:41,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:37:41,267 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:37:41,267 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:37:41,269 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i [2024-11-19 09:37:42,881 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:37:43,194 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:37:43,195 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i [2024-11-19 09:37:43,224 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc8e4a977/73db94b5245f4ff19f85a1960c49e5b2/FLAGade6854a0 [2024-11-19 09:37:43,244 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc8e4a977/73db94b5245f4ff19f85a1960c49e5b2 [2024-11-19 09:37:43,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:37:43,249 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:37:43,250 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:37:43,252 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:37:43,259 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:37:43,260 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:37:43" (1/1) ... [2024-11-19 09:37:43,262 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a34ea31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:43, skipping insertion in model container [2024-11-19 09:37:43,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:37:43" (1/1) ... [2024-11-19 09:37:43,320 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:37:43,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:37:44,007 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:37:44,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:37:44,162 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:37:44,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:44 WrapperNode [2024-11-19 09:37:44,163 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:37:44,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:37:44,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:37:44,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:37:44,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:44" (1/1) ... [2024-11-19 09:37:44,201 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:44" (1/1) ... [2024-11-19 09:37:44,230 INFO L138 Inliner]: procedures = 365, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 117 [2024-11-19 09:37:44,231 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:37:44,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:37:44,235 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:37:44,235 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:37:44,245 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:44" (1/1) ... [2024-11-19 09:37:44,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:44" (1/1) ... [2024-11-19 09:37:44,255 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:44" (1/1) ... [2024-11-19 09:37:44,271 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 09:37:44,272 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:44" (1/1) ... [2024-11-19 09:37:44,272 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:44" (1/1) ... [2024-11-19 09:37:44,279 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:44" (1/1) ... [2024-11-19 09:37:44,286 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:44" (1/1) ... [2024-11-19 09:37:44,292 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:44" (1/1) ... [2024-11-19 09:37:44,293 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:44" (1/1) ... [2024-11-19 09:37:44,299 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:37:44,303 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:37:44,303 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:37:44,303 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:37:44,304 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:44" (1/1) ... [2024-11-19 09:37:44,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:37:44,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:37:44,342 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:37:44,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:37:44,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 09:37:44,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 09:37:44,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 09:37:44,391 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2024-11-19 09:37:44,391 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2024-11-19 09:37:44,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:37:44,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:37:44,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:37:44,393 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:37:44,572 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:37:44,574 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:37:44,831 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:37:44,832 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:37:45,320 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:37:45,322 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 09:37:45,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:37:45 BoogieIcfgContainer [2024-11-19 09:37:45,323 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:37:45,325 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:37:45,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:37:45,330 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:37:45,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:37:43" (1/3) ... [2024-11-19 09:37:45,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@319f0a43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:37:45, skipping insertion in model container [2024-11-19 09:37:45,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:44" (2/3) ... [2024-11-19 09:37:45,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@319f0a43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:37:45, skipping insertion in model container [2024-11-19 09:37:45,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:37:45" (3/3) ... [2024-11-19 09:37:45,334 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2024-11-19 09:37:45,352 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:37:45,352 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 09:37:45,352 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:37:45,398 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-19 09:37:45,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 27 transitions, 61 flow [2024-11-19 09:37:45,465 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2024-11-19 09:37:45,466 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 09:37:45,469 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-11-19 09:37:45,469 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 27 transitions, 61 flow [2024-11-19 09:37:45,472 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 25 transitions, 56 flow [2024-11-19 09:37:45,483 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:37:45,491 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;@2a65ec21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:37:45,492 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-19 09:37:45,503 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:37:45,504 INFO L124 PetriNetUnfolderBase]: 4/23 cut-off events. [2024-11-19 09:37:45,504 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 09:37:45,504 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:37:45,506 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:37:45,507 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 09:37:45,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:37:45,512 INFO L85 PathProgramCache]: Analyzing trace with hash -260513820, now seen corresponding path program 1 times [2024-11-19 09:37:45,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:37:45,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744633062] [2024-11-19 09:37:45,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:37:45,531 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:37:45,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:37:45,535 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:37:45,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 09:37:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:37:45,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 09:37:45,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:37:45,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:37:45,797 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:37:45,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:37:45,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744633062] [2024-11-19 09:37:45,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1744633062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:37:45,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:37:45,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:37:45,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358592446] [2024-11-19 09:37:45,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:37:45,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 09:37:45,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:37:45,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 09:37:45,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 09:37:45,846 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2024-11-19 09:37:45,848 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-11-19 09:37:45,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:37:45,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2024-11-19 09:37:45,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:37:45,894 INFO L124 PetriNetUnfolderBase]: 13/40 cut-off events. [2024-11-19 09:37:45,895 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 09:37:45,896 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-11-19 09:37:45,898 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 12 selfloop transitions, 0 changer transitions 1/20 dead transitions. [2024-11-19 09:37:45,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 20 transitions, 70 flow [2024-11-19 09:37:45,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 09:37:45,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-19 09:37:45,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2024-11-19 09:37:45,909 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2024-11-19 09:37:45,910 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 56 flow. Second operand 2 states and 35 transitions. [2024-11-19 09:37:45,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 20 transitions, 70 flow [2024-11-19 09:37:45,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 20 transitions, 66 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:37:45,916 INFO L231 Difference]: Finished difference. Result has 21 places, 19 transitions, 40 flow [2024-11-19 09:37:45,918 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-11-19 09:37:45,922 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, -4 predicate places. [2024-11-19 09:37:45,922 INFO L471 AbstractCegarLoop]: Abstraction has has 21 places, 19 transitions, 40 flow [2024-11-19 09:37:45,923 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-11-19 09:37:45,923 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:37:45,923 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:37:45,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 09:37:46,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:37:46,125 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 09:37:46,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:37:46,127 INFO L85 PathProgramCache]: Analyzing trace with hash -352682509, now seen corresponding path program 1 times [2024-11-19 09:37:46,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:37:46,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011686225] [2024-11-19 09:37:46,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:37:46,128 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:37:46,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:37:46,132 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:37:46,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 09:37:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:37:46,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:37:46,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:37:46,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:37:46,303 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:37:46,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:37:46,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011686225] [2024-11-19 09:37:46,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1011686225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:37:46,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:37:46,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:37:46,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697780991] [2024-11-19 09:37:46,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:37:46,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:37:46,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:37:46,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:37:46,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:37:46,309 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2024-11-19 09:37:46,309 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-11-19 09:37:46,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:37:46,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2024-11-19 09:37:46,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:37:46,365 INFO L124 PetriNetUnfolderBase]: 17/55 cut-off events. [2024-11-19 09:37:46,365 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:37:46,366 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-11-19 09:37:46,368 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 15 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2024-11-19 09:37:46,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 24 transitions, 84 flow [2024-11-19 09:37:46,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:37:46,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:37:46,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2024-11-19 09:37:46,370 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-11-19 09:37:46,370 INFO L175 Difference]: Start difference. First operand has 21 places, 19 transitions, 40 flow. Second operand 3 states and 48 transitions. [2024-11-19 09:37:46,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 24 transitions, 84 flow [2024-11-19 09:37:46,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 24 transitions, 84 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 09:37:46,373 INFO L231 Difference]: Finished difference. Result has 23 places, 20 transitions, 52 flow [2024-11-19 09:37:46,374 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-11-19 09:37:46,375 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, -2 predicate places. [2024-11-19 09:37:46,375 INFO L471 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 52 flow [2024-11-19 09:37:46,375 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-11-19 09:37:46,375 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:37:46,375 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:37:46,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 09:37:46,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:37:46,580 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 09:37:46,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:37:46,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1191429173, now seen corresponding path program 1 times [2024-11-19 09:37:46,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:37:46,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574050877] [2024-11-19 09:37:46,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:37:46,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:37:46,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:37:46,583 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:37:46,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 09:37:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:37:46,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:37:46,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:37:46,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:37:46,750 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:37:46,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:37:46,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574050877] [2024-11-19 09:37:46,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574050877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:37:46,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:37:46,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:37:46,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242172677] [2024-11-19 09:37:46,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:37:46,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:37:46,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:37:46,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:37:46,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:37:46,758 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2024-11-19 09:37:46,758 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-11-19 09:37:46,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:37:46,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2024-11-19 09:37:46,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:37:46,829 INFO L124 PetriNetUnfolderBase]: 25/82 cut-off events. [2024-11-19 09:37:46,829 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-11-19 09:37:46,830 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-11-19 09:37:46,831 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 17 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2024-11-19 09:37:46,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 26 transitions, 112 flow [2024-11-19 09:37:46,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:37:46,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:37:46,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2024-11-19 09:37:46,833 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-11-19 09:37:46,833 INFO L175 Difference]: Start difference. First operand has 23 places, 20 transitions, 52 flow. Second operand 3 states and 48 transitions. [2024-11-19 09:37:46,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 26 transitions, 112 flow [2024-11-19 09:37:46,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 26 transitions, 108 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:37:46,835 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 62 flow [2024-11-19 09:37:46,835 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-11-19 09:37:46,836 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2024-11-19 09:37:46,836 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 62 flow [2024-11-19 09:37:46,836 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-11-19 09:37:46,837 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:37:46,837 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-11-19 09:37:46,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 09:37:47,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:37:47,038 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 09:37:47,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:37:47,039 INFO L85 PathProgramCache]: Analyzing trace with hash 2069577606, now seen corresponding path program 1 times [2024-11-19 09:37:47,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:37:47,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854835893] [2024-11-19 09:37:47,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:37:47,040 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:37:47,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:37:47,041 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:37:47,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 09:37:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:37:47,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:37:47,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:37:47,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:37:47,236 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:37:47,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:37:47,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:37:47,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854835893] [2024-11-19 09:37:47,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854835893] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:37:47,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:37:47,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-19 09:37:47,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697919454] [2024-11-19 09:37:47,270 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:37:47,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:37:47,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:37:47,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:37:47,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:37:47,274 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-11-19 09:37:47,274 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-11-19 09:37:47,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:37:47,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-11-19 09:37:47,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:37:47,422 INFO L124 PetriNetUnfolderBase]: 67/175 cut-off events. [2024-11-19 09:37:47,426 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2024-11-19 09:37:47,427 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-11-19 09:37:47,429 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 35 selfloop transitions, 6 changer transitions 0/47 dead transitions. [2024-11-19 09:37:47,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 47 transitions, 240 flow [2024-11-19 09:37:47,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:37:47,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:37:47,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2024-11-19 09:37:47,436 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2024-11-19 09:37:47,436 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 62 flow. Second operand 6 states and 93 transitions. [2024-11-19 09:37:47,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 47 transitions, 240 flow [2024-11-19 09:37:47,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 47 transitions, 230 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:37:47,438 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 100 flow [2024-11-19 09:37:47,439 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-11-19 09:37:47,439 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 8 predicate places. [2024-11-19 09:37:47,439 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 100 flow [2024-11-19 09:37:47,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:37:47,440 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:37:47,440 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-11-19 09:37:47,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 09:37:47,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:37:47,641 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 09:37:47,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:37:47,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1497028664, now seen corresponding path program 2 times [2024-11-19 09:37:47,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:37:47,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1727257390] [2024-11-19 09:37:47,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:37:47,643 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:37:47,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:37:47,644 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:37:47,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 09:37:47,799 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:37:47,799 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:37:47,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:37:47,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:37:47,878 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:37:47,878 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:37:47,996 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:37:47,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:37:47,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1727257390] [2024-11-19 09:37:47,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1727257390] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:37:47,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:37:47,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-19 09:37:47,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536789144] [2024-11-19 09:37:47,997 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:37:47,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 09:37:47,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:37:47,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 09:37:47,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-19 09:37:48,006 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-11-19 09:37:48,007 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-11-19 09:37:48,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:37:48,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-11-19 09:37:48,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:37:48,375 INFO L124 PetriNetUnfolderBase]: 139/355 cut-off events. [2024-11-19 09:37:48,376 INFO L125 PetriNetUnfolderBase]: For 567/567 co-relation queries the response was YES. [2024-11-19 09:37:48,378 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-11-19 09:37:48,382 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 71 selfloop transitions, 12 changer transitions 0/89 dead transitions. [2024-11-19 09:37:48,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 89 transitions, 542 flow [2024-11-19 09:37:48,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 09:37:48,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 09:37:48,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 186 transitions. [2024-11-19 09:37:48,385 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2024-11-19 09:37:48,386 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 100 flow. Second operand 12 states and 186 transitions. [2024-11-19 09:37:48,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 89 transitions, 542 flow [2024-11-19 09:37:48,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 89 transitions, 522 flow, removed 9 selfloop flow, removed 1 redundant places. [2024-11-19 09:37:48,392 INFO L231 Difference]: Finished difference. Result has 50 places, 31 transitions, 188 flow [2024-11-19 09:37:48,392 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-11-19 09:37:48,393 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 25 predicate places. [2024-11-19 09:37:48,393 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 31 transitions, 188 flow [2024-11-19 09:37:48,393 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-11-19 09:37:48,393 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:37:48,394 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-11-19 09:37:48,399 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 (6)] Forceful destruction successful, exit code 0 [2024-11-19 09:37:48,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:37:48,594 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 09:37:48,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:37:48,595 INFO L85 PathProgramCache]: Analyzing trace with hash 920426056, now seen corresponding path program 3 times [2024-11-19 09:37:48,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:37:48,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337933372] [2024-11-19 09:37:48,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:37:48,596 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:37:48,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:37:48,597 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:37:48,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 09:37:48,732 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-19 09:37:48,732 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:37:48,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:37:48,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:37:48,769 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-11-19 09:37:48,770 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:37:48,805 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-11-19 09:37:48,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:37:48,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [337933372] [2024-11-19 09:37:48,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [337933372] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:37:48,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:37:48,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-19 09:37:48,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297906975] [2024-11-19 09:37:48,806 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:37:48,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:37:48,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:37:48,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:37:48,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:37:48,815 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-11-19 09:37:48,815 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-11-19 09:37:48,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:37:48,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-11-19 09:37:48,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:37:48,976 INFO L124 PetriNetUnfolderBase]: 184/543 cut-off events. [2024-11-19 09:37:48,977 INFO L125 PetriNetUnfolderBase]: For 2246/2266 co-relation queries the response was YES. [2024-11-19 09:37:48,982 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-11-19 09:37:48,985 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 74 selfloop transitions, 6 changer transitions 0/88 dead transitions. [2024-11-19 09:37:48,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 88 transitions, 866 flow [2024-11-19 09:37:48,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:37:48,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:37:48,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2024-11-19 09:37:48,987 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5679012345679012 [2024-11-19 09:37:48,987 INFO L175 Difference]: Start difference. First operand has 50 places, 31 transitions, 188 flow. Second operand 6 states and 92 transitions. [2024-11-19 09:37:48,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 88 transitions, 866 flow [2024-11-19 09:37:48,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 88 transitions, 836 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:37:48,995 INFO L231 Difference]: Finished difference. Result has 56 places, 34 transitions, 222 flow [2024-11-19 09:37:48,996 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-11-19 09:37:48,996 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 31 predicate places. [2024-11-19 09:37:48,996 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 34 transitions, 222 flow [2024-11-19 09:37:48,997 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-11-19 09:37:48,997 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:37:48,997 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-11-19 09:37:49,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 09:37:49,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:37:49,198 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 09:37:49,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:37:49,199 INFO L85 PathProgramCache]: Analyzing trace with hash 585964463, now seen corresponding path program 4 times [2024-11-19 09:37:49,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:37:49,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1701464982] [2024-11-19 09:37:49,199 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:37:49,199 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:37:49,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:37:49,201 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:37:49,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 09:37:49,343 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:37:49,343 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:37:49,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:37:49,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:37:49,469 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 28 proven. 59 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-19 09:37:49,469 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:37:49,624 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 28 proven. 59 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-19 09:37:49,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:37:49,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1701464982] [2024-11-19 09:37:49,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1701464982] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:37:49,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:37:49,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-19 09:37:49,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754403891] [2024-11-19 09:37:49,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:37:49,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 09:37:49,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:37:49,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 09:37:49,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-19 09:37:49,634 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-11-19 09:37:49,635 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-11-19 09:37:49,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:37:49,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-11-19 09:37:49,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:37:50,165 INFO L124 PetriNetUnfolderBase]: 398/1113 cut-off events. [2024-11-19 09:37:50,169 INFO L125 PetriNetUnfolderBase]: For 5570/5630 co-relation queries the response was YES. [2024-11-19 09:37:50,176 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-11-19 09:37:50,183 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 158 selfloop transitions, 12 changer transitions 0/178 dead transitions. [2024-11-19 09:37:50,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 178 transitions, 1856 flow [2024-11-19 09:37:50,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 09:37:50,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 09:37:50,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 185 transitions. [2024-11-19 09:37:50,187 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5709876543209876 [2024-11-19 09:37:50,187 INFO L175 Difference]: Start difference. First operand has 56 places, 34 transitions, 222 flow. Second operand 12 states and 185 transitions. [2024-11-19 09:37:50,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 178 transitions, 1856 flow [2024-11-19 09:37:50,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 178 transitions, 1836 flow, removed 9 selfloop flow, removed 1 redundant places. [2024-11-19 09:37:50,203 INFO L231 Difference]: Finished difference. Result has 73 places, 41 transitions, 310 flow [2024-11-19 09:37:50,204 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-11-19 09:37:50,206 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 48 predicate places. [2024-11-19 09:37:50,207 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 41 transitions, 310 flow [2024-11-19 09:37:50,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:37:50,208 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:37:50,208 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-11-19 09:37:50,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-19 09:37:50,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:37:50,409 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 09:37:50,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:37:50,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1933865645, now seen corresponding path program 5 times [2024-11-19 09:37:50,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:37:50,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311617918] [2024-11-19 09:37:50,411 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 09:37:50,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:37:50,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:37:50,412 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:37:50,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 09:37:50,616 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2024-11-19 09:37:50,617 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:37:50,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 09:37:50,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:37:50,876 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 10 proven. 145 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-11-19 09:37:50,876 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:37:51,226 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 10 proven. 145 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-11-19 09:37:51,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:37:51,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311617918] [2024-11-19 09:37:51,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311617918] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:37:51,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:37:51,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2024-11-19 09:37:51,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547845479] [2024-11-19 09:37:51,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:37:51,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 09:37:51,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:37:51,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 09:37:51,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2024-11-19 09:37:51,244 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-11-19 09:37:51,245 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-11-19 09:37:51,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:37:51,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-11-19 09:37:51,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:37:52,704 INFO L124 PetriNetUnfolderBase]: 950/2480 cut-off events. [2024-11-19 09:37:52,704 INFO L125 PetriNetUnfolderBase]: For 18087/18087 co-relation queries the response was YES. [2024-11-19 09:37:52,717 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-11-19 09:37:52,732 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 299 selfloop transitions, 22 changer transitions 0/329 dead transitions. [2024-11-19 09:37:52,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 329 transitions, 3724 flow [2024-11-19 09:37:52,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 09:37:52,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-11-19 09:37:52,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 340 transitions. [2024-11-19 09:37:52,734 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5723905723905723 [2024-11-19 09:37:52,735 INFO L175 Difference]: Start difference. First operand has 73 places, 41 transitions, 310 flow. Second operand 22 states and 340 transitions. [2024-11-19 09:37:52,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 329 transitions, 3724 flow [2024-11-19 09:37:52,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 329 transitions, 3598 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:37:52,755 INFO L231 Difference]: Finished difference. Result has 102 places, 52 transitions, 504 flow [2024-11-19 09:37:52,756 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-11-19 09:37:52,757 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 77 predicate places. [2024-11-19 09:37:52,757 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 52 transitions, 504 flow [2024-11-19 09:37:52,757 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-11-19 09:37:52,757 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:37:52,758 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-11-19 09:37:52,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-19 09:37:52,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:37:52,958 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 09:37:52,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:37:52,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1430048345, now seen corresponding path program 6 times [2024-11-19 09:37:52,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:37:52,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468465394] [2024-11-19 09:37:52,960 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 09:37:52,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:37:52,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:37:52,968 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:37:52,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 09:37:53,270 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2024-11-19 09:37:53,270 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:37:53,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 09:37:53,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:37:53,559 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 20 proven. 235 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2024-11-19 09:37:53,559 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:37:54,029 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 20 proven. 235 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2024-11-19 09:37:54,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:37:54,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468465394] [2024-11-19 09:37:54,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1468465394] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:37:54,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:37:54,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2024-11-19 09:37:54,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159736898] [2024-11-19 09:37:54,030 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:37:54,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 09:37:54,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:37:54,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 09:37:54,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2024-11-19 09:37:54,039 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-11-19 09:37:54,040 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-11-19 09:37:54,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:37:54,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-11-19 09:37:54,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:37:55,931 INFO L124 PetriNetUnfolderBase]: 1390/3879 cut-off events. [2024-11-19 09:37:55,932 INFO L125 PetriNetUnfolderBase]: For 47299/47473 co-relation queries the response was YES. [2024-11-19 09:37:55,956 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-11-19 09:37:55,981 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 508 selfloop transitions, 22 changer transitions 0/539 dead transitions. [2024-11-19 09:37:55,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 539 transitions, 7894 flow [2024-11-19 09:37:55,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 09:37:55,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-11-19 09:37:55,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 339 transitions. [2024-11-19 09:37:55,983 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5707070707070707 [2024-11-19 09:37:55,983 INFO L175 Difference]: Start difference. First operand has 102 places, 52 transitions, 504 flow. Second operand 22 states and 339 transitions. [2024-11-19 09:37:55,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 539 transitions, 7894 flow [2024-11-19 09:37:56,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 539 transitions, 7516 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-11-19 09:37:56,035 INFO L231 Difference]: Finished difference. Result has 125 places, 63 transitions, 686 flow [2024-11-19 09:37:56,036 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-11-19 09:37:56,037 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, 100 predicate places. [2024-11-19 09:37:56,037 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 63 transitions, 686 flow [2024-11-19 09:37:56,038 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-11-19 09:37:56,038 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:37:56,038 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-11-19 09:37:56,046 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-11-19 09:37:56,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:37:56,239 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-19 09:37:56,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:37:56,240 INFO L85 PathProgramCache]: Analyzing trace with hash -2120299981, now seen corresponding path program 7 times [2024-11-19 09:37:56,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:37:56,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1597361202] [2024-11-19 09:37:56,241 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 09:37:56,241 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:37:56,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:37:56,242 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-11-19 09:37:56,244 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-11-19 09:37:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:37:56,534 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:37:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:37:56,795 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-19 09:37:56,795 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:37:56,796 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 3 remaining) [2024-11-19 09:37:56,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (1 of 3 remaining) [2024-11-19 09:37:56,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-19 09:37:56,808 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-11-19 09:37:56,999 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-11-19 09:37:56,999 INFO L407 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2024-11-19 09:37:57,149 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:37:57,149 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:37:57,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:37:57 BasicIcfg [2024-11-19 09:37:57,153 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:37:57,153 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:37:57,153 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:37:57,154 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:37:57,154 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:37:45" (3/4) ... [2024-11-19 09:37:57,157 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 09:37:57,158 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:37:57,158 INFO L158 Benchmark]: Toolchain (without parser) took 13909.91ms. Allocated memory was 62.9MB in the beginning and 237.0MB in the end (delta: 174.1MB). Free memory was 30.4MB in the beginning and 105.9MB in the end (delta: -75.5MB). Peak memory consumption was 97.0MB. Max. memory is 16.1GB. [2024-11-19 09:37:57,159 INFO L158 Benchmark]: CDTParser took 1.72ms. Allocated memory is still 50.3MB. Free memory is still 23.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:37:57,159 INFO L158 Benchmark]: CACSL2BoogieTranslator took 913.67ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 30.3MB in the beginning and 47.7MB in the end (delta: -17.5MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2024-11-19 09:37:57,161 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.48ms. Allocated memory is still 75.5MB. Free memory was 47.7MB in the beginning and 45.1MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 09:37:57,161 INFO L158 Benchmark]: Boogie Preprocessor took 68.08ms. Allocated memory is still 75.5MB. Free memory was 45.1MB in the beginning and 42.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:37:57,162 INFO L158 Benchmark]: RCFGBuilder took 1019.87ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 42.2MB in the beginning and 54.7MB in the end (delta: -12.5MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2024-11-19 09:37:57,162 INFO L158 Benchmark]: TraceAbstraction took 11827.50ms. Allocated memory was 92.3MB in the beginning and 237.0MB in the end (delta: 144.7MB). Free memory was 54.1MB in the beginning and 107.0MB in the end (delta: -52.9MB). Peak memory consumption was 92.1MB. Max. memory is 16.1GB. [2024-11-19 09:37:57,162 INFO L158 Benchmark]: Witness Printer took 4.38ms. Allocated memory is still 237.0MB. Free memory was 107.0MB in the beginning and 105.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:37:57,164 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.72ms. Allocated memory is still 50.3MB. Free memory is still 23.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 913.67ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 30.3MB in the beginning and 47.7MB in the end (delta: -17.5MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.48ms. Allocated memory is still 75.5MB. Free memory was 47.7MB in the beginning and 45.1MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.08ms. Allocated memory is still 75.5MB. Free memory was 45.1MB in the beginning and 42.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1019.87ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 42.2MB in the beginning and 54.7MB in the end (delta: -12.5MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11827.50ms. Allocated memory was 92.3MB in the beginning and 237.0MB in the end (delta: 144.7MB). Free memory was 54.1MB in the beginning and 107.0MB in the end (delta: -52.9MB). Peak memory consumption was 92.1MB. Max. memory is 16.1GB. * Witness Printer took 4.38ms. Allocated memory is still 237.0MB. Free memory was 107.0MB in the beginning and 105.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 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] [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=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=0, myglobal=1, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=1, myglobal=1, mythread=-1] [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=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=1, i=20, j=21, myglobal=22, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=2, i=20, j=21, myglobal=22, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=2, i=20, j=21, myglobal=22, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=2, i=20, j=21, myglobal=23, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=3, j=21, myglobal=23, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=3, j=21, myglobal=23, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=3, j=21, myglobal=24, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=4, j=21, myglobal=24, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=4, j=21, myglobal=24, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=4, j=21, myglobal=25, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=5, j=21, myglobal=25, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=5, j=21, myglobal=25, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=5, j=21, myglobal=26, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=6, j=21, myglobal=26, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=6, j=21, myglobal=26, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=6, j=21, myglobal=27, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=7, j=21, myglobal=27, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=7, j=21, myglobal=27, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=7, j=21, myglobal=28, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=8, j=21, myglobal=28, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=8, j=21, myglobal=28, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=8, j=21, myglobal=29, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=9, j=21, myglobal=29, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=9, j=21, myglobal=29, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=9, j=21, myglobal=30, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=20, j=21, myglobal=30, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=20, j=21, myglobal=30, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=20, j=21, myglobal=31, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=11, i=20, j=21, myglobal=31, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=11, i=20, j=21, myglobal=31, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=11, i=20, j=21, myglobal=32, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=12, i=20, j=21, myglobal=32, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=12, i=20, j=21, myglobal=32, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=12, i=20, j=21, myglobal=33, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=13, i=20, j=21, myglobal=33, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=13, i=20, j=21, myglobal=33, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=13, i=20, j=21, myglobal=34, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=14, i=20, j=21, myglobal=34, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=14, i=20, j=21, myglobal=34, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=14, i=20, j=21, myglobal=35, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=15, i=20, j=21, myglobal=35, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=15, i=20, j=21, myglobal=35, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=15, i=20, j=21, myglobal=36, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=16, i=20, j=21, myglobal=36, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=16, i=20, j=21, myglobal=36, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=16, i=20, j=21, myglobal=37, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=17, i=20, j=21, myglobal=37, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=17, i=20, j=21, myglobal=37, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=17, i=20, j=21, myglobal=38, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=18, i=20, j=21, myglobal=38, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=18, i=20, j=21, myglobal=38, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=18, i=20, j=21, myglobal=39, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=19, i=20, j=21, myglobal=39, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=19, i=20, j=21, myglobal=39, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=19, i=20, j=21, myglobal=40, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=20, j=21, myglobal=40, mythread=-1] [L1352] COND FALSE 0 !(i<20) VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=20, j=21, 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=21, 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=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.6s, OverallIterations: 10, TraceHistogramMax: 20, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 887 SdHoareTripleChecker+Valid, 2.0s 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, 1.9s 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.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 573 NumberOfCodeBlocks, 549 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 753 ConstructedInterpolants, 0 QuantifiedInterpolants, 2219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 873 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-11-19 09:37:57,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample