./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 8be7027f 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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 16:15:25,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 16:15:25,435 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 16:15:25,440 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 16:15:25,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 16:15:25,475 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 16:15:25,475 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 16:15:25,476 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 16:15:25,476 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 16:15:25,477 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 16:15:25,478 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 16:15:25,478 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 16:15:25,479 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 16:15:25,481 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 16:15:25,482 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 16:15:25,482 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 16:15:25,483 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 16:15:25,483 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 16:15:25,483 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 16:15:25,484 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 16:15:25,484 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 16:15:25,488 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 16:15:25,489 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 16:15:25,489 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 16:15:25,489 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 16:15:25,490 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 16:15:25,490 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 16:15:25,490 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 16:15:25,490 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 16:15:25,491 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 16:15:25,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 16:15:25,491 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 16:15:25,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 16:15:25,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:15:25,492 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 16:15:25,492 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 16:15:25,492 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 16:15:25,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 16:15:25,493 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 16:15:25,493 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 16:15:25,493 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 16:15:25,494 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 16:15:25,494 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-12 16:15:25,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 16:15:25,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 16:15:25,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 16:15:25,812 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 16:15:25,813 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 16:15:25,814 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-12 16:15:27,264 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 16:15:27,536 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 16:15:27,536 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i [2024-11-12 16:15:27,559 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c54c3c97/875deb94f32e4494b2ded13ea1497579/FLAG03fcfe16e [2024-11-12 16:15:27,829 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c54c3c97/875deb94f32e4494b2ded13ea1497579 [2024-11-12 16:15:27,831 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 16:15:27,832 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 16:15:27,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 16:15:27,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 16:15:27,852 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 16:15:27,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:15:27" (1/1) ... [2024-11-12 16:15:27,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@156061ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:15:27, skipping insertion in model container [2024-11-12 16:15:27,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:15:27" (1/1) ... [2024-11-12 16:15:27,911 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 16:15:28,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:15:28,520 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 16:15:28,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:15:28,656 INFO L204 MainTranslator]: Completed translation [2024-11-12 16:15:28,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:15:28 WrapperNode [2024-11-12 16:15:28,656 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 16:15:28,657 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 16:15:28,658 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 16:15:28,658 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 16:15:28,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:15:28" (1/1) ... [2024-11-12 16:15:28,692 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:15:28" (1/1) ... [2024-11-12 16:15:28,719 INFO L138 Inliner]: procedures = 364, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 116 [2024-11-12 16:15:28,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 16:15:28,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 16:15:28,722 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 16:15:28,723 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 16:15:28,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:15:28" (1/1) ... [2024-11-12 16:15:28,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:15:28" (1/1) ... [2024-11-12 16:15:28,737 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:15:28" (1/1) ... [2024-11-12 16:15:28,767 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-12 16:15:28,767 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:15:28" (1/1) ... [2024-11-12 16:15:28,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:15:28" (1/1) ... [2024-11-12 16:15:28,772 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:15:28" (1/1) ... [2024-11-12 16:15:28,779 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:15:28" (1/1) ... [2024-11-12 16:15:28,783 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:15:28" (1/1) ... [2024-11-12 16:15:28,785 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:15:28" (1/1) ... [2024-11-12 16:15:28,789 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 16:15:28,790 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 16:15:28,792 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 16:15:28,792 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 16:15:28,793 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:15:28" (1/1) ... [2024-11-12 16:15:28,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:15:28,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:15:28,823 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-12 16:15:28,825 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-12 16:15:28,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-12 16:15:28,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-12 16:15:28,887 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2024-11-12 16:15:28,889 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2024-11-12 16:15:28,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 16:15:28,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 16:15:28,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 16:15:28,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 16:15:28,891 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 16:15:29,033 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 16:15:29,035 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 16:15:29,220 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 16:15:29,220 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 16:15:29,552 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 16:15:29,552 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 16:15:29,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:15:29 BoogieIcfgContainer [2024-11-12 16:15:29,553 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 16:15:29,555 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 16:15:29,556 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 16:15:29,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 16:15:29,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:15:27" (1/3) ... [2024-11-12 16:15:29,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd8a3be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:15:29, skipping insertion in model container [2024-11-12 16:15:29,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:15:28" (2/3) ... [2024-11-12 16:15:29,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd8a3be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:15:29, skipping insertion in model container [2024-11-12 16:15:29,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:15:29" (3/3) ... [2024-11-12 16:15:29,565 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2024-11-12 16:15:29,584 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 16:15:29,585 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 16:15:29,585 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 16:15:29,627 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-12 16:15:29,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 27 transitions, 61 flow [2024-11-12 16:15:29,718 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2024-11-12 16:15:29,720 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 16:15:29,724 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-12 16:15:29,724 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 27 transitions, 61 flow [2024-11-12 16:15:29,745 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 25 transitions, 56 flow [2024-11-12 16:15:29,759 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 16:15:29,767 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;@42c75bfd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 16:15:29,768 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-12 16:15:29,783 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 16:15:29,784 INFO L124 PetriNetUnfolderBase]: 4/23 cut-off events. [2024-11-12 16:15:29,784 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 16:15:29,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:15:29,785 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:15:29,786 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-12 16:15:29,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:15:29,794 INFO L85 PathProgramCache]: Analyzing trace with hash 2021529890, now seen corresponding path program 1 times [2024-11-12 16:15:29,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:15:29,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656839895] [2024-11-12 16:15:29,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:15:29,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:15:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:15:30,195 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-12 16:15:30,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:15:30,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656839895] [2024-11-12 16:15:30,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656839895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:15:30,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:15:30,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:15:30,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871486498] [2024-11-12 16:15:30,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:15:30,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:15:30,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:15:30,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:15:30,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:15:30,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2024-11-12 16:15:30,250 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-12 16:15:30,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:15:30,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2024-11-12 16:15:30,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:15:30,311 INFO L124 PetriNetUnfolderBase]: 17/56 cut-off events. [2024-11-12 16:15:30,313 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 16:15:30,314 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-12 16:15:30,316 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 15 selfloop transitions, 2 changer transitions 1/25 dead transitions. [2024-11-12 16:15:30,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 25 transitions, 90 flow [2024-11-12 16:15:30,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:15:30,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:15:30,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2024-11-12 16:15:30,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2024-11-12 16:15:30,329 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 56 flow. Second operand 3 states and 51 transitions. [2024-11-12 16:15:30,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 25 transitions, 90 flow [2024-11-12 16:15:30,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 25 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:15:30,334 INFO L231 Difference]: Finished difference. Result has 23 places, 20 transitions, 52 flow [2024-11-12 16:15:30,335 INFO L262 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-12 16:15:30,338 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, -2 predicate places. [2024-11-12 16:15:30,338 INFO L471 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 52 flow [2024-11-12 16:15:30,338 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-12 16:15:30,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:15:30,339 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:15:30,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 16:15:30,339 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-12 16:15:30,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:15:30,340 INFO L85 PathProgramCache]: Analyzing trace with hash 518263413, now seen corresponding path program 1 times [2024-11-12 16:15:30,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:15:30,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993603669] [2024-11-12 16:15:30,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:15:30,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:15:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:15:30,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:15:30,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:15:30,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993603669] [2024-11-12 16:15:30,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993603669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:15:30,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:15:30,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:15:30,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703559062] [2024-11-12 16:15:30,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:15:30,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:15:30,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:15:30,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:15:30,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:15:30,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2024-11-12 16:15:30,492 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-12 16:15:30,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:15:30,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2024-11-12 16:15:30,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:15:30,552 INFO L124 PetriNetUnfolderBase]: 25/82 cut-off events. [2024-11-12 16:15:30,553 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-11-12 16:15:30,555 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-12 16:15:30,556 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 17 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2024-11-12 16:15:30,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 26 transitions, 112 flow [2024-11-12 16:15:30,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:15:30,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:15:30,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2024-11-12 16:15:30,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-11-12 16:15:30,560 INFO L175 Difference]: Start difference. First operand has 23 places, 20 transitions, 52 flow. Second operand 3 states and 48 transitions. [2024-11-12 16:15:30,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 26 transitions, 112 flow [2024-11-12 16:15:30,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 26 transitions, 108 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 16:15:30,561 INFO L231 Difference]: Finished difference. Result has 24 places, 21 transitions, 62 flow [2024-11-12 16:15:30,562 INFO L262 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-12 16:15:30,563 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2024-11-12 16:15:30,563 INFO L471 AbstractCegarLoop]: Abstraction has has 24 places, 21 transitions, 62 flow [2024-11-12 16:15:30,563 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-12 16:15:30,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:15:30,564 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:15:30,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 16:15:30,565 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-12 16:15:30,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:15:30,567 INFO L85 PathProgramCache]: Analyzing trace with hash 378845636, now seen corresponding path program 1 times [2024-11-12 16:15:30,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:15:30,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591131705] [2024-11-12 16:15:30,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:15:30,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:15:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:15:30,761 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-12 16:15:30,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:15:30,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591131705] [2024-11-12 16:15:30,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591131705] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:15:30,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209458765] [2024-11-12 16:15:30,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:15:30,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:15:30,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:15:30,778 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-12 16:15:30,783 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-12 16:15:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:15:30,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 16:15:30,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:15:31,040 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-12 16:15:31,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:15:31,106 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-12 16:15:31,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209458765] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:15:31,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:15:31,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-12 16:15:31,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639870515] [2024-11-12 16:15:31,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:15:31,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 16:15:31,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:15:31,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 16:15:31,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 16:15:31,121 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-11-12 16:15:31,122 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-12 16:15:31,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:15:31,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-11-12 16:15:31,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:15:31,378 INFO L124 PetriNetUnfolderBase]: 76/215 cut-off events. [2024-11-12 16:15:31,378 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2024-11-12 16:15:31,380 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-12 16:15:31,381 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 42 selfloop transitions, 33 changer transitions 0/81 dead transitions. [2024-11-12 16:15:31,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 81 transitions, 406 flow [2024-11-12 16:15:31,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 16:15:31,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-12 16:15:31,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 233 transitions. [2024-11-12 16:15:31,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5393518518518519 [2024-11-12 16:15:31,385 INFO L175 Difference]: Start difference. First operand has 24 places, 21 transitions, 62 flow. Second operand 16 states and 233 transitions. [2024-11-12 16:15:31,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 81 transitions, 406 flow [2024-11-12 16:15:31,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 81 transitions, 400 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 16:15:31,389 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 334 flow [2024-11-12 16:15:31,389 INFO L262 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-12 16:15:31,390 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 26 predicate places. [2024-11-12 16:15:31,390 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 334 flow [2024-11-12 16:15:31,391 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-12 16:15:31,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:15:31,391 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:15:31,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 16:15:31,595 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-12 16:15:31,596 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-12 16:15:31,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:15:31,597 INFO L85 PathProgramCache]: Analyzing trace with hash -455538255, now seen corresponding path program 2 times [2024-11-12 16:15:31,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:15:31,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048190073] [2024-11-12 16:15:31,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:15:31,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:15:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:15:31,702 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-12 16:15:31,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:15:31,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048190073] [2024-11-12 16:15:31,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048190073] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:15:31,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106367683] [2024-11-12 16:15:31,703 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 16:15:31,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:15:31,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:15:31,705 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-12 16:15:31,707 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-12 16:15:31,866 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 16:15:31,867 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:15:31,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 16:15:31,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:15:31,946 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-12 16:15:31,946 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:15:32,014 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-12 16:15:32,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106367683] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:15:32,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:15:32,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-12 16:15:32,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367672015] [2024-11-12 16:15:32,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:15:32,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 16:15:32,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:15:32,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 16:15:32,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-12 16:15:32,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-11-12 16:15:32,029 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-12 16:15:32,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:15:32,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-11-12 16:15:32,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:15:32,185 INFO L124 PetriNetUnfolderBase]: 175/501 cut-off events. [2024-11-12 16:15:32,185 INFO L125 PetriNetUnfolderBase]: For 3066/3066 co-relation queries the response was YES. [2024-11-12 16:15:32,189 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-12 16:15:32,193 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 61 selfloop transitions, 20 changer transitions 0/90 dead transitions. [2024-11-12 16:15:32,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 90 transitions, 846 flow [2024-11-12 16:15:32,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 16:15:32,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-12 16:15:32,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2024-11-12 16:15:32,195 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2024-11-12 16:15:32,195 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 334 flow. Second operand 8 states and 124 transitions. [2024-11-12 16:15:32,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 90 transitions, 846 flow [2024-11-12 16:15:32,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 90 transitions, 770 flow, removed 26 selfloop flow, removed 2 redundant places. [2024-11-12 16:15:32,209 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 404 flow [2024-11-12 16:15:32,209 INFO L262 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-12 16:15:32,210 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 36 predicate places. [2024-11-12 16:15:32,210 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 404 flow [2024-11-12 16:15:32,210 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-12 16:15:32,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:15:32,211 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:15:32,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 16:15:32,415 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-12 16:15:32,416 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-12 16:15:32,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:15:32,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1961131491, now seen corresponding path program 3 times [2024-11-12 16:15:32,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:15:32,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075065354] [2024-11-12 16:15:32,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:15:32,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:15:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:15:32,548 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-12 16:15:32,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:15:32,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075065354] [2024-11-12 16:15:32,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075065354] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:15:32,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138857236] [2024-11-12 16:15:32,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 16:15:32,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:15:32,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:15:32,551 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-12 16:15:32,553 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-12 16:15:32,727 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-12 16:15:32,727 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:15:32,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 16:15:32,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:15:32,814 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-12 16:15:32,814 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:15:32,925 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-12 16:15:32,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138857236] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:15:32,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:15:32,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-12 16:15:32,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096173932] [2024-11-12 16:15:32,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:15:32,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 16:15:32,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:15:32,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 16:15:32,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-12 16:15:32,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-11-12 16:15:32,944 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-12 16:15:32,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:15:32,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-11-12 16:15:32,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:15:33,186 INFO L124 PetriNetUnfolderBase]: 266/767 cut-off events. [2024-11-12 16:15:33,186 INFO L125 PetriNetUnfolderBase]: For 9650/9698 co-relation queries the response was YES. [2024-11-12 16:15:33,189 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-12 16:15:33,195 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 144 selfloop transitions, 36 changer transitions 0/187 dead transitions. [2024-11-12 16:15:33,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 187 transitions, 2298 flow [2024-11-12 16:15:33,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 16:15:33,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-12 16:15:33,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 185 transitions. [2024-11-12 16:15:33,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5709876543209876 [2024-11-12 16:15:33,197 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 404 flow. Second operand 12 states and 185 transitions. [2024-11-12 16:15:33,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 187 transitions, 2298 flow [2024-11-12 16:15:33,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 187 transitions, 2054 flow, removed 88 selfloop flow, removed 2 redundant places. [2024-11-12 16:15:33,212 INFO L231 Difference]: Finished difference. Result has 77 places, 74 transitions, 632 flow [2024-11-12 16:15:33,213 INFO L262 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-12 16:15:33,213 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 52 predicate places. [2024-11-12 16:15:33,213 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 74 transitions, 632 flow [2024-11-12 16:15:33,214 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-12 16:15:33,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:15:33,214 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:15:33,233 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-12 16:15:33,414 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-12 16:15:33,415 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-12 16:15:33,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:15:33,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1295691281, now seen corresponding path program 4 times [2024-11-12 16:15:33,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:15:33,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361529016] [2024-11-12 16:15:33,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:15:33,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:15:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:15:33,642 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-12 16:15:33,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:15:33,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361529016] [2024-11-12 16:15:33,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361529016] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:15:33,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280582729] [2024-11-12 16:15:33,644 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-12 16:15:33,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:15:33,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:15:33,646 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-12 16:15:33,647 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-12 16:15:33,827 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-12 16:15:33,827 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:15:33,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 16:15:33,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:15:33,927 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-12 16:15:33,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:15:34,108 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-12 16:15:34,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280582729] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:15:34,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:15:34,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-11-12 16:15:34,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005598577] [2024-11-12 16:15:34,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:15:34,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-12 16:15:34,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:15:34,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 16:15:34,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2024-11-12 16:15:34,115 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-11-12 16:15:34,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 74 transitions, 632 flow. Second operand has 17 states, 17 states have (on average 11.529411764705882) internal successors, (196), 17 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:15:34,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:15:34,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-11-12 16:15:34,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:15:34,579 INFO L124 PetriNetUnfolderBase]: 758/2054 cut-off events. [2024-11-12 16:15:34,580 INFO L125 PetriNetUnfolderBase]: For 18092/18167 co-relation queries the response was YES. [2024-11-12 16:15:34,591 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-12 16:15:34,647 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 215 selfloop transitions, 28 changer transitions 0/255 dead transitions. [2024-11-12 16:15:34,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 255 transitions, 3026 flow [2024-11-12 16:15:34,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 16:15:34,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-12 16:15:34,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 248 transitions. [2024-11-12 16:15:34,653 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2024-11-12 16:15:34,653 INFO L175 Difference]: Start difference. First operand has 77 places, 74 transitions, 632 flow. Second operand 16 states and 248 transitions. [2024-11-12 16:15:34,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 255 transitions, 3026 flow [2024-11-12 16:15:34,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 255 transitions, 2936 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-12 16:15:34,698 INFO L231 Difference]: Finished difference. Result has 98 places, 83 transitions, 830 flow [2024-11-12 16:15:34,699 INFO L262 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-12 16:15:34,699 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 73 predicate places. [2024-11-12 16:15:34,700 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 83 transitions, 830 flow [2024-11-12 16:15:34,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.529411764705882) internal successors, (196), 17 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:15:34,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:15:34,700 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:15:34,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 16:15:34,901 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-12 16:15:34,902 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-12 16:15:34,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:15:34,904 INFO L85 PathProgramCache]: Analyzing trace with hash -40959491, now seen corresponding path program 5 times [2024-11-12 16:15:34,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:15:34,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593960757] [2024-11-12 16:15:34,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:15:34,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:15:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:15:35,332 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 371 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-12 16:15:35,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:15:35,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593960757] [2024-11-12 16:15:35,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593960757] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:15:35,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117151701] [2024-11-12 16:15:35,333 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-12 16:15:35,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:15:35,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:15:35,335 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-12 16:15:35,363 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-12 16:15:35,536 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2024-11-12 16:15:35,536 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:15:35,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 16:15:35,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:15:35,661 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 371 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-12 16:15:35,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:15:35,957 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 371 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-12 16:15:35,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117151701] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:15:35,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:15:35,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2024-11-12 16:15:35,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801607454] [2024-11-12 16:15:35,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:15:35,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-12 16:15:35,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:15:35,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-12 16:15:35,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2024-11-12 16:15:35,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-11-12 16:15:35,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 83 transitions, 830 flow. Second operand has 23 states, 23 states have (on average 11.521739130434783) internal successors, (265), 23 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:15:35,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:15:35,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-11-12 16:15:35,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:15:36,694 INFO L124 PetriNetUnfolderBase]: 1046/2822 cut-off events. [2024-11-12 16:15:36,694 INFO L125 PetriNetUnfolderBase]: For 42613/42724 co-relation queries the response was YES. [2024-11-12 16:15:36,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13754 conditions, 2822 events. 1046/2822 cut-off events. For 42613/42724 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 18742 event pairs, 120 based on Foata normal form. 273/3031 useless extension candidates. Maximal degree in co-relation 11228. Up to 630 conditions per place. [2024-11-12 16:15:36,726 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 299 selfloop transitions, 34 changer transitions 0/345 dead transitions. [2024-11-12 16:15:36,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 345 transitions, 4188 flow [2024-11-12 16:15:36,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-12 16:15:36,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-11-12 16:15:36,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 336 transitions. [2024-11-12 16:15:36,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5656565656565656 [2024-11-12 16:15:36,728 INFO L175 Difference]: Start difference. First operand has 98 places, 83 transitions, 830 flow. Second operand 22 states and 336 transitions. [2024-11-12 16:15:36,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 345 transitions, 4188 flow [2024-11-12 16:15:36,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 345 transitions, 4158 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 16:15:36,769 INFO L231 Difference]: Finished difference. Result has 121 places, 90 transitions, 1020 flow [2024-11-12 16:15:36,769 INFO L262 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-12 16:15:36,770 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 96 predicate places. [2024-11-12 16:15:36,770 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 90 transitions, 1020 flow [2024-11-12 16:15:36,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 11.521739130434783) internal successors, (265), 23 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:15:36,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:15:36,771 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:15:36,786 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-12 16:15:36,975 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-12 16:15:36,976 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-12 16:15:36,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:15:36,977 INFO L85 PathProgramCache]: Analyzing trace with hash 848696147, now seen corresponding path program 6 times [2024-11-12 16:15:36,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:15:36,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153165008] [2024-11-12 16:15:36,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:15:36,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:15:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:15:37,421 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2024-11-12 16:15:37,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:15:37,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153165008] [2024-11-12 16:15:37,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153165008] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:15:37,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528487793] [2024-11-12 16:15:37,424 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-12 16:15:37,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:15:37,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:15:37,427 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-12 16:15:37,429 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-12 16:15:37,617 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2024-11-12 16:15:37,618 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:15:37,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 16:15:37,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:15:37,781 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2024-11-12 16:15:37,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:15:38,072 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2024-11-12 16:15:38,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528487793] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:15:38,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:15:38,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2024-11-12 16:15:38,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665428050] [2024-11-12 16:15:38,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:15:38,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-12 16:15:38,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:15:38,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-12 16:15:38,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2024-11-12 16:15:38,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-11-12 16:15:38,093 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-12 16:15:38,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:15:38,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-11-12 16:15:38,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:15:39,218 INFO L124 PetriNetUnfolderBase]: 1388/3809 cut-off events. [2024-11-12 16:15:39,218 INFO L125 PetriNetUnfolderBase]: For 99502/99742 co-relation queries the response was YES. [2024-11-12 16:15:39,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23200 conditions, 3809 events. 1388/3809 cut-off events. For 99502/99742 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 27467 event pairs, 44 based on Foata normal form. 232/4019 useless extension candidates. Maximal degree in co-relation 21859. Up to 1327 conditions per place. [2024-11-12 16:15:39,288 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 588 selfloop transitions, 66 changer transitions 0/663 dead transitions. [2024-11-12 16:15:39,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 663 transitions, 12386 flow [2024-11-12 16:15:39,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-12 16:15:39,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-11-12 16:15:39,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 339 transitions. [2024-11-12 16:15:39,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5707070707070707 [2024-11-12 16:15:39,290 INFO L175 Difference]: Start difference. First operand has 121 places, 90 transitions, 1020 flow. Second operand 22 states and 339 transitions. [2024-11-12 16:15:39,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 663 transitions, 12386 flow [2024-11-12 16:15:39,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 663 transitions, 11760 flow, removed 0 selfloop flow, removed 13 redundant places. [2024-11-12 16:15:39,407 INFO L231 Difference]: Finished difference. Result has 140 places, 123 transitions, 1534 flow [2024-11-12 16:15:39,407 INFO L262 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-12 16:15:39,410 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 115 predicate places. [2024-11-12 16:15:39,411 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 123 transitions, 1534 flow [2024-11-12 16:15:39,411 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-12 16:15:39,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:15:39,412 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:15:39,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-12 16:15:39,615 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-12 16:15:39,616 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-12 16:15:39,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:15:39,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1241951759, now seen corresponding path program 7 times [2024-11-12 16:15:39,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:15:39,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756310096] [2024-11-12 16:15:39,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:15:39,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:15:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 16:15:39,724 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 16:15:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 16:15:39,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 16:15:39,837 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 16:15:39,839 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 3 remaining) [2024-11-12 16:15:39,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (1 of 3 remaining) [2024-11-12 16:15:39,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-12 16:15:39,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 16:15:39,842 INFO L421 BasicCegarLoop]: Path program histogram: [7, 1, 1] [2024-11-12 16:15:39,989 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-12 16:15:39,990 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 16:15:39,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:15:39 BasicIcfg [2024-11-12 16:15:39,995 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 16:15:40,000 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 16:15:40,000 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 16:15:40,000 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 16:15:40,001 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:15:29" (3/4) ... [2024-11-12 16:15:40,004 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 16:15:40,005 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 16:15:40,006 INFO L158 Benchmark]: Toolchain (without parser) took 12174.41ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 112.2MB in the beginning and 255.3MB in the end (delta: -143.0MB). Peak memory consumption was 183.6MB. Max. memory is 16.1GB. [2024-11-12 16:15:40,006 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 142.6MB. Free memory is still 111.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:15:40,007 INFO L158 Benchmark]: CACSL2BoogieTranslator took 823.94ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 72.6MB in the end (delta: 39.4MB). Peak memory consumption was 44.7MB. Max. memory is 16.1GB. [2024-11-12 16:15:40,009 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.40ms. Allocated memory is still 142.6MB. Free memory was 72.6MB in the beginning and 70.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 16:15:40,009 INFO L158 Benchmark]: Boogie Preprocessor took 67.35ms. Allocated memory is still 142.6MB. Free memory was 70.5MB in the beginning and 67.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 16:15:40,010 INFO L158 Benchmark]: RCFGBuilder took 762.48ms. Allocated memory is still 142.6MB. Free memory was 67.6MB in the beginning and 51.8MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 16:15:40,010 INFO L158 Benchmark]: TraceAbstraction took 10440.23ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 50.7MB in the beginning and 255.3MB in the end (delta: -204.6MB). Peak memory consumption was 123.6MB. Max. memory is 16.1GB. [2024-11-12 16:15:40,010 INFO L158 Benchmark]: Witness Printer took 5.97ms. Allocated memory is still 469.8MB. Free memory is still 255.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:15:40,012 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 142.6MB. Free memory is still 111.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 823.94ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 72.6MB in the end (delta: 39.4MB). Peak memory consumption was 44.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.40ms. Allocated memory is still 142.6MB. Free memory was 72.6MB in the beginning and 70.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.35ms. Allocated memory is still 142.6MB. Free memory was 70.5MB in the beginning and 67.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 762.48ms. Allocated memory is still 142.6MB. Free memory was 67.6MB in the beginning and 51.8MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10440.23ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 50.7MB in the beginning and 255.3MB in the end (delta: -204.6MB). Peak memory consumption was 123.6MB. Max. memory is 16.1GB. * Witness Printer took 5.97ms. Allocated memory is still 469.8MB. Free memory is still 255.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 12]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 12. Possible FailurePath: [L1320] 0 int myglobal; [L1321] 0 pthread_mutex_t mymutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1340] 0 pthread_t mythread; [L1341] 0 int i; [L1342] FCALL, FORK 0 pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0)) VAL [\old(arg)={0:0}, myglobal=0, mythread=-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.2s, OverallIterations: 9, TraceHistogramMax: 20, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 560 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 547 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 838 IncrementalHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 1 mSDtfsCounter, 838 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 881 GetRequests, 778 SyntacticMatches, 12 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1534occurred in iteration=8, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1012 NumberOfCodeBlocks, 982 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 1229 ConstructedInterpolants, 0 QuantifiedInterpolants, 3229 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1272 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 3079/5170 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-12 16:15:40,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 16:15:42,342 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 16:15:42,426 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-12 16:15:42,433 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 16:15:42,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 16:15:42,466 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 16:15:42,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 16:15:42,467 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 16:15:42,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 16:15:42,467 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 16:15:42,468 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 16:15:42,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 16:15:42,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 16:15:42,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 16:15:42,469 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 16:15:42,469 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 16:15:42,470 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 16:15:42,470 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 16:15:42,470 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 16:15:42,471 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 16:15:42,471 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 16:15:42,474 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 16:15:42,475 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 16:15:42,475 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 16:15:42,475 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 16:15:42,475 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 16:15:42,476 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 16:15:42,476 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 16:15:42,476 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 16:15:42,476 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 16:15:42,477 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 16:15:42,477 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 16:15:42,477 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 16:15:42,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 16:15:42,478 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 16:15:42,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:15:42,490 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 16:15:42,490 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 16:15:42,490 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 16:15:42,491 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 16:15:42,491 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 16:15:42,492 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 16:15:42,492 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 16:15:42,492 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 16:15:42,492 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-12 16:15:42,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 16:15:42,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 16:15:42,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 16:15:42,836 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 16:15:42,836 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 16:15:42,838 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-12 16:15:44,489 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 16:15:44,772 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 16:15:44,773 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i [2024-11-12 16:15:44,793 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52f3ec86a/0e02ae60c4e84b3b966732e2cbfb7234/FLAGa9df308b7 [2024-11-12 16:15:44,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52f3ec86a/0e02ae60c4e84b3b966732e2cbfb7234 [2024-11-12 16:15:44,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 16:15:44,810 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 16:15:44,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 16:15:44,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 16:15:44,816 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 16:15:44,817 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:15:44" (1/1) ... [2024-11-12 16:15:44,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23bb59f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:15:44, skipping insertion in model container [2024-11-12 16:15:44,818 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:15:44" (1/1) ... [2024-11-12 16:15:44,872 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 16:15:45,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:15:45,505 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 16:15:45,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:15:45,678 INFO L204 MainTranslator]: Completed translation [2024-11-12 16:15:45,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:15:45 WrapperNode [2024-11-12 16:15:45,679 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 16:15:45,680 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 16:15:45,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 16:15:45,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 16:15:45,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:15:45" (1/1) ... [2024-11-12 16:15:45,722 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:15:45" (1/1) ... [2024-11-12 16:15:45,759 INFO L138 Inliner]: procedures = 365, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 117 [2024-11-12 16:15:45,759 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 16:15:45,760 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 16:15:45,760 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 16:15:45,762 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 16:15:45,773 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:15:45" (1/1) ... [2024-11-12 16:15:45,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:15:45" (1/1) ... [2024-11-12 16:15:45,777 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:15:45" (1/1) ... [2024-11-12 16:15:45,800 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-12 16:15:45,801 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:15:45" (1/1) ... [2024-11-12 16:15:45,801 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:15:45" (1/1) ... [2024-11-12 16:15:45,810 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:15:45" (1/1) ... [2024-11-12 16:15:45,813 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:15:45" (1/1) ... [2024-11-12 16:15:45,819 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:15:45" (1/1) ... [2024-11-12 16:15:45,820 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:15:45" (1/1) ... [2024-11-12 16:15:45,825 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 16:15:45,826 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 16:15:45,826 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 16:15:45,826 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 16:15:45,828 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:15:45" (1/1) ... [2024-11-12 16:15:45,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:15:45,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:15:45,863 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-12 16:15:45,871 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-12 16:15:45,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-12 16:15:45,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 16:15:45,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-12 16:15:45,909 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2024-11-12 16:15:45,909 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2024-11-12 16:15:45,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 16:15:45,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 16:15:45,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 16:15:45,911 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 16:15:46,056 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 16:15:46,058 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 16:15:46,304 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 16:15:46,306 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 16:15:46,790 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 16:15:46,790 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 16:15:46,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:15:46 BoogieIcfgContainer [2024-11-12 16:15:46,791 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 16:15:46,794 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 16:15:46,795 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 16:15:46,798 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 16:15:46,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:15:44" (1/3) ... [2024-11-12 16:15:46,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75966770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:15:46, skipping insertion in model container [2024-11-12 16:15:46,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:15:45" (2/3) ... [2024-11-12 16:15:46,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75966770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:15:46, skipping insertion in model container [2024-11-12 16:15:46,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:15:46" (3/3) ... [2024-11-12 16:15:46,801 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2024-11-12 16:15:46,818 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 16:15:46,818 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 16:15:46,818 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 16:15:46,859 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-12 16:15:46,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 27 transitions, 61 flow [2024-11-12 16:15:46,925 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2024-11-12 16:15:46,925 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 16:15:46,928 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-12 16:15:46,928 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 27 transitions, 61 flow [2024-11-12 16:15:46,931 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 25 transitions, 56 flow [2024-11-12 16:15:46,943 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 16:15:46,952 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;@19f8223, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 16:15:46,952 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-12 16:15:46,960 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 16:15:46,960 INFO L124 PetriNetUnfolderBase]: 4/23 cut-off events. [2024-11-12 16:15:46,960 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 16:15:46,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:15:46,961 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:15:46,962 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-12 16:15:46,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:15:46,968 INFO L85 PathProgramCache]: Analyzing trace with hash -260513820, now seen corresponding path program 1 times [2024-11-12 16:15:46,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:15:46,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625311828] [2024-11-12 16:15:46,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:15:46,983 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-12 16:15:46,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:15:46,987 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-12 16:15:46,988 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-12 16:15:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:15:47,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 16:15:47,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:15:47,188 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-12 16:15:47,188 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:15:47,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:15:47,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1625311828] [2024-11-12 16:15:47,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1625311828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:15:47,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:15:47,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:15:47,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763973493] [2024-11-12 16:15:47,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:15:47,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 16:15:47,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:15:47,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 16:15:47,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 16:15:47,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2024-11-12 16:15:47,235 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-12 16:15:47,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:15:47,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2024-11-12 16:15:47,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:15:47,276 INFO L124 PetriNetUnfolderBase]: 13/40 cut-off events. [2024-11-12 16:15:47,276 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 16:15:47,277 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-12 16:15:47,278 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 12 selfloop transitions, 0 changer transitions 1/20 dead transitions. [2024-11-12 16:15:47,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 20 transitions, 70 flow [2024-11-12 16:15:47,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 16:15:47,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-12 16:15:47,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2024-11-12 16:15:47,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2024-11-12 16:15:47,291 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 56 flow. Second operand 2 states and 35 transitions. [2024-11-12 16:15:47,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 20 transitions, 70 flow [2024-11-12 16:15:47,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 20 transitions, 66 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 16:15:47,296 INFO L231 Difference]: Finished difference. Result has 21 places, 19 transitions, 40 flow [2024-11-12 16:15:47,298 INFO L262 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-12 16:15:47,301 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, -4 predicate places. [2024-11-12 16:15:47,302 INFO L471 AbstractCegarLoop]: Abstraction has has 21 places, 19 transitions, 40 flow [2024-11-12 16:15:47,302 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-12 16:15:47,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:15:47,302 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:15:47,307 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-12 16:15:47,508 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-12 16:15:47,509 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-12 16:15:47,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:15:47,510 INFO L85 PathProgramCache]: Analyzing trace with hash -352682509, now seen corresponding path program 1 times [2024-11-12 16:15:47,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:15:47,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137375656] [2024-11-12 16:15:47,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:15:47,511 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-12 16:15:47,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:15:47,514 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-12 16:15:47,515 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-12 16:15:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:15:47,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 16:15:47,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:15:47,697 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-12 16:15:47,697 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:15:47,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:15:47,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137375656] [2024-11-12 16:15:47,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137375656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:15:47,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:15:47,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:15:47,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319972858] [2024-11-12 16:15:47,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:15:47,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:15:47,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:15:47,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:15:47,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:15:47,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2024-11-12 16:15:47,704 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-12 16:15:47,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:15:47,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2024-11-12 16:15:47,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:15:47,754 INFO L124 PetriNetUnfolderBase]: 17/55 cut-off events. [2024-11-12 16:15:47,755 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 16:15:47,755 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-12 16:15:47,756 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 15 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2024-11-12 16:15:47,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 24 transitions, 84 flow [2024-11-12 16:15:47,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:15:47,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:15:47,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2024-11-12 16:15:47,757 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-11-12 16:15:47,757 INFO L175 Difference]: Start difference. First operand has 21 places, 19 transitions, 40 flow. Second operand 3 states and 48 transitions. [2024-11-12 16:15:47,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 24 transitions, 84 flow [2024-11-12 16:15:47,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 24 transitions, 84 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 16:15:47,760 INFO L231 Difference]: Finished difference. Result has 23 places, 20 transitions, 52 flow [2024-11-12 16:15:47,760 INFO L262 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-12 16:15:47,761 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, -2 predicate places. [2024-11-12 16:15:47,761 INFO L471 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 52 flow [2024-11-12 16:15:47,761 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-12 16:15:47,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:15:47,761 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:15:47,766 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-12 16:15:47,962 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-12 16:15:47,962 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-12 16:15:47,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:15:47,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1191429173, now seen corresponding path program 1 times [2024-11-12 16:15:47,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:15:47,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989165812] [2024-11-12 16:15:47,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:15:47,964 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-12 16:15:47,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:15:47,967 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-12 16:15:47,968 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-12 16:15:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:15:48,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 16:15:48,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:15:48,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 16:15:48,131 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:15:48,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:15:48,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989165812] [2024-11-12 16:15:48,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1989165812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:15:48,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:15:48,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 16:15:48,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437651765] [2024-11-12 16:15:48,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:15:48,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 16:15:48,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:15:48,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 16:15:48,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 16:15:48,139 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 27 [2024-11-12 16:15:48,139 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-12 16:15:48,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:15:48,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 27 [2024-11-12 16:15:48,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:15:48,223 INFO L124 PetriNetUnfolderBase]: 25/82 cut-off events. [2024-11-12 16:15:48,223 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-11-12 16:15:48,226 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-12 16:15:48,227 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 17 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2024-11-12 16:15:48,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 26 transitions, 112 flow [2024-11-12 16:15:48,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 16:15:48,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 16:15:48,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2024-11-12 16:15:48,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-11-12 16:15:48,230 INFO L175 Difference]: Start difference. First operand has 23 places, 20 transitions, 52 flow. Second operand 3 states and 48 transitions. [2024-11-12 16:15:48,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 26 transitions, 112 flow [2024-11-12 16:15:48,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 26 transitions, 108 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 16:15:48,235 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 62 flow [2024-11-12 16:15:48,235 INFO L262 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-12 16:15:48,236 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2024-11-12 16:15:48,237 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 62 flow [2024-11-12 16:15:48,237 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-12 16:15:48,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:15:48,237 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:15:48,242 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-12 16:15:48,437 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-12 16:15:48,438 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-12 16:15:48,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:15:48,439 INFO L85 PathProgramCache]: Analyzing trace with hash 2069577606, now seen corresponding path program 1 times [2024-11-12 16:15:48,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:15:48,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [20840902] [2024-11-12 16:15:48,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:15:48,440 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-12 16:15:48,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:15:48,442 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-12 16:15:48,443 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-12 16:15:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:15:48,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 16:15:48,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:15:48,616 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-12 16:15:48,616 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:15:48,641 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-12 16:15:48,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:15:48,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [20840902] [2024-11-12 16:15:48,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [20840902] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:15:48,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 16:15:48,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-12 16:15:48,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244628963] [2024-11-12 16:15:48,644 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 16:15:48,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 16:15:48,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:15:48,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 16:15:48,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:15:48,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-11-12 16:15:48,649 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-12 16:15:48,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:15:48,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-11-12 16:15:48,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:15:48,789 INFO L124 PetriNetUnfolderBase]: 67/175 cut-off events. [2024-11-12 16:15:48,790 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2024-11-12 16:15:48,792 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-12 16:15:48,793 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 35 selfloop transitions, 6 changer transitions 0/47 dead transitions. [2024-11-12 16:15:48,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 47 transitions, 240 flow [2024-11-12 16:15:48,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:15:48,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 16:15:48,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2024-11-12 16:15:48,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2024-11-12 16:15:48,796 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 62 flow. Second operand 6 states and 93 transitions. [2024-11-12 16:15:48,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 47 transitions, 240 flow [2024-11-12 16:15:48,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 47 transitions, 230 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 16:15:48,798 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 100 flow [2024-11-12 16:15:48,800 INFO L262 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-12 16:15:48,801 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 8 predicate places. [2024-11-12 16:15:48,801 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 100 flow [2024-11-12 16:15:48,802 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-12 16:15:48,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:15:48,802 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:15:48,808 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-12 16:15:49,003 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-12 16:15:49,004 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-12 16:15:49,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:15:49,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1497028664, now seen corresponding path program 2 times [2024-11-12 16:15:49,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:15:49,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [912959037] [2024-11-12 16:15:49,006 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 16:15:49,006 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-12 16:15:49,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:15:49,007 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-12 16:15:49,008 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-12 16:15:49,151 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 16:15:49,151 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:15:49,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 16:15:49,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:15:49,226 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-12 16:15:49,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:15:49,346 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-12 16:15:49,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:15:49,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [912959037] [2024-11-12 16:15:49,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [912959037] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:15:49,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 16:15:49,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-12 16:15:49,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261545894] [2024-11-12 16:15:49,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 16:15:49,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 16:15:49,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:15:49,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 16:15:49,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-12 16:15:49,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-11-12 16:15:49,362 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-12 16:15:49,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:15:49,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-11-12 16:15:49,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:15:49,775 INFO L124 PetriNetUnfolderBase]: 139/355 cut-off events. [2024-11-12 16:15:49,778 INFO L125 PetriNetUnfolderBase]: For 567/567 co-relation queries the response was YES. [2024-11-12 16:15:49,780 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-12 16:15:49,782 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 71 selfloop transitions, 12 changer transitions 0/89 dead transitions. [2024-11-12 16:15:49,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 89 transitions, 542 flow [2024-11-12 16:15:49,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 16:15:49,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-12 16:15:49,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 186 transitions. [2024-11-12 16:15:49,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2024-11-12 16:15:49,788 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 100 flow. Second operand 12 states and 186 transitions. [2024-11-12 16:15:49,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 89 transitions, 542 flow [2024-11-12 16:15:49,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 89 transitions, 522 flow, removed 9 selfloop flow, removed 1 redundant places. [2024-11-12 16:15:49,796 INFO L231 Difference]: Finished difference. Result has 50 places, 31 transitions, 188 flow [2024-11-12 16:15:49,796 INFO L262 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-12 16:15:49,797 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 25 predicate places. [2024-11-12 16:15:49,797 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 31 transitions, 188 flow [2024-11-12 16:15:49,797 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-12 16:15:49,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:15:49,797 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:15:49,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-12 16:15:49,998 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-12 16:15:49,999 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-12 16:15:49,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:15:49,999 INFO L85 PathProgramCache]: Analyzing trace with hash 920426056, now seen corresponding path program 3 times [2024-11-12 16:15:50,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:15:50,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122256288] [2024-11-12 16:15:50,000 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 16:15:50,000 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-12 16:15:50,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:15:50,004 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-12 16:15:50,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-12 16:15:50,162 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-12 16:15:50,163 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:15:50,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 16:15:50,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:15:50,206 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-12 16:15:50,210 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:15:50,246 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-12 16:15:50,248 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:15:50,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2122256288] [2024-11-12 16:15:50,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2122256288] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:15:50,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 16:15:50,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-12 16:15:50,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972023060] [2024-11-12 16:15:50,251 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 16:15:50,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 16:15:50,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:15:50,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 16:15:50,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 16:15:50,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-11-12 16:15:50,261 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-12 16:15:50,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:15:50,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-11-12 16:15:50,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:15:50,416 INFO L124 PetriNetUnfolderBase]: 184/543 cut-off events. [2024-11-12 16:15:50,416 INFO L125 PetriNetUnfolderBase]: For 2246/2266 co-relation queries the response was YES. [2024-11-12 16:15:50,419 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-12 16:15:50,422 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 74 selfloop transitions, 6 changer transitions 0/88 dead transitions. [2024-11-12 16:15:50,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 88 transitions, 866 flow [2024-11-12 16:15:50,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:15:50,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 16:15:50,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2024-11-12 16:15:50,424 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5679012345679012 [2024-11-12 16:15:50,424 INFO L175 Difference]: Start difference. First operand has 50 places, 31 transitions, 188 flow. Second operand 6 states and 92 transitions. [2024-11-12 16:15:50,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 88 transitions, 866 flow [2024-11-12 16:15:50,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 88 transitions, 836 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-12 16:15:50,435 INFO L231 Difference]: Finished difference. Result has 56 places, 34 transitions, 222 flow [2024-11-12 16:15:50,436 INFO L262 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-12 16:15:50,436 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 31 predicate places. [2024-11-12 16:15:50,437 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 34 transitions, 222 flow [2024-11-12 16:15:50,438 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-12 16:15:50,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:15:50,438 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:15:50,444 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 (7)] Forceful destruction successful, exit code 0 [2024-11-12 16:15:50,638 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-12 16:15:50,639 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-12 16:15:50,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:15:50,640 INFO L85 PathProgramCache]: Analyzing trace with hash 585964463, now seen corresponding path program 4 times [2024-11-12 16:15:50,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:15:50,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [753271934] [2024-11-12 16:15:50,640 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-12 16:15:50,641 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-12 16:15:50,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:15:50,644 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-12 16:15:50,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 (8)] Waiting until timeout for monitored process [2024-11-12 16:15:50,798 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-12 16:15:50,799 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:15:50,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 16:15:50,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:15:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-12 16:15:50,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:15:51,100 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-12 16:15:51,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:15:51,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [753271934] [2024-11-12 16:15:51,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [753271934] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:15:51,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 16:15:51,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-12 16:15:51,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637609111] [2024-11-12 16:15:51,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 16:15:51,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 16:15:51,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:15:51,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 16:15:51,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-12 16:15:51,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-11-12 16:15:51,108 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-12 16:15:51,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:15:51,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-11-12 16:15:51,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:15:51,583 INFO L124 PetriNetUnfolderBase]: 398/1113 cut-off events. [2024-11-12 16:15:51,584 INFO L125 PetriNetUnfolderBase]: For 5570/5630 co-relation queries the response was YES. [2024-11-12 16:15:51,588 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-12 16:15:51,595 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 158 selfloop transitions, 12 changer transitions 0/178 dead transitions. [2024-11-12 16:15:51,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 178 transitions, 1856 flow [2024-11-12 16:15:51,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 16:15:51,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-12 16:15:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 185 transitions. [2024-11-12 16:15:51,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5709876543209876 [2024-11-12 16:15:51,598 INFO L175 Difference]: Start difference. First operand has 56 places, 34 transitions, 222 flow. Second operand 12 states and 185 transitions. [2024-11-12 16:15:51,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 178 transitions, 1856 flow [2024-11-12 16:15:51,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 178 transitions, 1836 flow, removed 9 selfloop flow, removed 1 redundant places. [2024-11-12 16:15:51,609 INFO L231 Difference]: Finished difference. Result has 73 places, 41 transitions, 310 flow [2024-11-12 16:15:51,609 INFO L262 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-12 16:15:51,610 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 48 predicate places. [2024-11-12 16:15:51,610 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 41 transitions, 310 flow [2024-11-12 16:15:51,610 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-12 16:15:51,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:15:51,610 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:15:51,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-12 16:15:51,811 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-12 16:15:51,812 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-12 16:15:51,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:15:51,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1933865645, now seen corresponding path program 5 times [2024-11-12 16:15:51,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:15:51,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281131896] [2024-11-12 16:15:51,813 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-12 16:15:51,813 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-12 16:15:51,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:15:51,816 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-12 16:15:51,817 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-12 16:15:52,016 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2024-11-12 16:15:52,016 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:15:52,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 16:15:52,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:15:52,255 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-12 16:15:52,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:15:52,638 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-12 16:15:52,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:15:52,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281131896] [2024-11-12 16:15:52,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [281131896] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:15:52,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 16:15:52,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2024-11-12 16:15:52,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565602926] [2024-11-12 16:15:52,639 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 16:15:52,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-12 16:15:52,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:15:52,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-12 16:15:52,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2024-11-12 16:15:52,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-11-12 16:15:52,659 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-12 16:15:52,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:15:52,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-11-12 16:15:52,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:15:54,116 INFO L124 PetriNetUnfolderBase]: 950/2480 cut-off events. [2024-11-12 16:15:54,116 INFO L125 PetriNetUnfolderBase]: For 18087/18087 co-relation queries the response was YES. [2024-11-12 16:15:54,129 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-12 16:15:54,143 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 299 selfloop transitions, 22 changer transitions 0/329 dead transitions. [2024-11-12 16:15:54,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 329 transitions, 3724 flow [2024-11-12 16:15:54,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-12 16:15:54,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-11-12 16:15:54,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 340 transitions. [2024-11-12 16:15:54,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5723905723905723 [2024-11-12 16:15:54,146 INFO L175 Difference]: Start difference. First operand has 73 places, 41 transitions, 310 flow. Second operand 22 states and 340 transitions. [2024-11-12 16:15:54,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 329 transitions, 3724 flow [2024-11-12 16:15:54,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 329 transitions, 3598 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-12 16:15:54,168 INFO L231 Difference]: Finished difference. Result has 102 places, 52 transitions, 504 flow [2024-11-12 16:15:54,169 INFO L262 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-12 16:15:54,170 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 77 predicate places. [2024-11-12 16:15:54,171 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 52 transitions, 504 flow [2024-11-12 16:15:54,171 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-12 16:15:54,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:15:54,172 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:15:54,178 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-12 16:15:54,372 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-12 16:15:54,373 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-12 16:15:54,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:15:54,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1430048345, now seen corresponding path program 6 times [2024-11-12 16:15:54,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:15:54,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [860160063] [2024-11-12 16:15:54,375 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-12 16:15:54,375 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-12 16:15:54,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:15:54,378 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-12 16:15:54,380 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-12 16:15:54,650 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2024-11-12 16:15:54,650 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 16:15:54,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 16:15:54,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:15:54,930 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 0 proven. 396 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2024-11-12 16:15:54,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:15:55,624 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 0 proven. 396 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2024-11-12 16:15:55,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 16:15:55,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [860160063] [2024-11-12 16:15:55,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [860160063] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:15:55,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 16:15:55,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2024-11-12 16:15:55,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698117514] [2024-11-12 16:15:55,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 16:15:55,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-12 16:15:55,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 16:15:55,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-12 16:15:55,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2024-11-12 16:15:55,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-11-12 16:15:55,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 52 transitions, 504 flow. Second operand has 25 states, 25 states have (on average 11.96) internal successors, (299), 25 states have internal predecessors, (299), 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-12 16:15:55,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 16:15:55,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-11-12 16:15:55,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 16:15:57,860 INFO L124 PetriNetUnfolderBase]: 1545/4264 cut-off events. [2024-11-12 16:15:57,860 INFO L125 PetriNetUnfolderBase]: For 52422/52617 co-relation queries the response was YES. [2024-11-12 16:15:57,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20686 conditions, 4264 events. 1545/4264 cut-off events. For 52422/52617 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 30811 event pairs, 43 based on Foata normal form. 253/4497 useless extension candidates. Maximal degree in co-relation 20648. Up to 1449 conditions per place. [2024-11-12 16:15:57,966 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 598 selfloop transitions, 27 changer transitions 0/634 dead transitions. [2024-11-12 16:15:57,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 634 transitions, 9358 flow [2024-11-12 16:15:57,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-12 16:15:57,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-11-12 16:15:57,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 395 transitions. [2024-11-12 16:15:57,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5626780626780626 [2024-11-12 16:15:57,970 INFO L175 Difference]: Start difference. First operand has 102 places, 52 transitions, 504 flow. Second operand 26 states and 395 transitions. [2024-11-12 16:15:57,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 634 transitions, 9358 flow [2024-11-12 16:15:58,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 634 transitions, 8908 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-11-12 16:15:58,033 INFO L231 Difference]: Finished difference. Result has 120 places, 67 transitions, 713 flow [2024-11-12 16:15:58,034 INFO L262 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=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=713, PETRI_PLACES=120, PETRI_TRANSITIONS=67} [2024-11-12 16:15:58,035 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 95 predicate places. [2024-11-12 16:15:58,036 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 67 transitions, 713 flow [2024-11-12 16:15:58,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 11.96) internal successors, (299), 25 states have internal predecessors, (299), 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-12 16:15:58,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 16:15:58,037 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:15:58,044 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-12 16:15:58,237 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-12 16:15:58,238 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-12 16:15:58,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:15:58,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1574470831, now seen corresponding path program 7 times [2024-11-12 16:15:58,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 16:15:58,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1156222332] [2024-11-12 16:15:58,240 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-12 16:15:58,240 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-12 16:15:58,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 16:15:58,241 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-12 16:15:58,242 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-12 16:15:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 16:15:58,560 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 16:15:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 16:15:58,817 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-12 16:15:58,818 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 16:15:58,819 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 3 remaining) [2024-11-12 16:15:58,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (1 of 3 remaining) [2024-11-12 16:15:58,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-12 16:15:58,831 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 (11)] Ended with exit code 0 [2024-11-12 16:15:59,022 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-12 16:15:59,022 INFO L421 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2024-11-12 16:15:59,175 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-12 16:15:59,176 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 16:15:59,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:15:59 BasicIcfg [2024-11-12 16:15:59,182 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 16:15:59,183 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 16:15:59,183 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 16:15:59,184 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 16:15:59,184 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:15:46" (3/4) ... [2024-11-12 16:15:59,187 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 16:15:59,188 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 16:15:59,189 INFO L158 Benchmark]: Toolchain (without parser) took 14379.02ms. Allocated memory was 75.5MB in the beginning and 278.9MB in the end (delta: 203.4MB). Free memory was 40.7MB in the beginning and 109.1MB in the end (delta: -68.5MB). Peak memory consumption was 135.9MB. Max. memory is 16.1GB. [2024-11-12 16:15:59,189 INFO L158 Benchmark]: CDTParser took 1.71ms. Allocated memory is still 56.6MB. Free memory is still 31.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:15:59,189 INFO L158 Benchmark]: CACSL2BoogieTranslator took 868.58ms. Allocated memory is still 75.5MB. Free memory was 40.6MB in the beginning and 44.7MB in the end (delta: -4.1MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2024-11-12 16:15:59,191 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.80ms. Allocated memory is still 75.5MB. Free memory was 44.3MB in the beginning and 41.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 16:15:59,191 INFO L158 Benchmark]: Boogie Preprocessor took 65.07ms. Allocated memory is still 75.5MB. Free memory was 41.7MB in the beginning and 38.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 16:15:59,192 INFO L158 Benchmark]: RCFGBuilder took 965.27ms. Allocated memory was 75.5MB in the beginning and 96.5MB in the end (delta: 21.0MB). Free memory was 38.9MB in the beginning and 50.9MB in the end (delta: -12.0MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2024-11-12 16:15:59,192 INFO L158 Benchmark]: TraceAbstraction took 12388.27ms. Allocated memory was 96.5MB in the beginning and 278.9MB in the end (delta: 182.5MB). Free memory was 50.1MB in the beginning and 109.1MB in the end (delta: -59.0MB). Peak memory consumption was 123.0MB. Max. memory is 16.1GB. [2024-11-12 16:15:59,192 INFO L158 Benchmark]: Witness Printer took 5.25ms. Allocated memory is still 278.9MB. Free memory is still 109.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:15:59,194 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.71ms. Allocated memory is still 56.6MB. Free memory is still 31.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 868.58ms. Allocated memory is still 75.5MB. Free memory was 40.6MB in the beginning and 44.7MB in the end (delta: -4.1MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.80ms. Allocated memory is still 75.5MB. Free memory was 44.3MB in the beginning and 41.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.07ms. Allocated memory is still 75.5MB. Free memory was 41.7MB in the beginning and 38.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 965.27ms. Allocated memory was 75.5MB in the beginning and 96.5MB in the end (delta: 21.0MB). Free memory was 38.9MB in the beginning and 50.9MB in the end (delta: -12.0MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. * TraceAbstraction took 12388.27ms. Allocated memory was 96.5MB in the beginning and 278.9MB in the end (delta: 182.5MB). Free memory was 50.1MB in the beginning and 109.1MB in the end (delta: -59.0MB). Peak memory consumption was 123.0MB. Max. memory is 16.1GB. * Witness Printer took 5.25ms. Allocated memory is still 278.9MB. Free memory is still 109.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 12]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 12. Possible FailurePath: [L1320] 0 int myglobal; [L1321] 0 pthread_mutex_t mymutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1340] 0 pthread_t mythread; [L1341] 0 int i; [L1342] FCALL, FORK 0 pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0)) VAL [\old(arg)={0:0}, myglobal=0, mythread=-1] [L1342] COND FALSE 0 !(pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0))) [L1352] 0 i=0 VAL [\old(arg)={0:0}, i=0, myglobal=0, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, i=0, myglobal=0, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, i=0, myglobal=1, mythread=-1] [L1324] 1 int i,j; [L1325] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, i=0, myglobal=1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=1, myglobal=1, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=1, myglobal=1, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=1, myglobal=2, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=2, myglobal=2, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=2, myglobal=2, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=2, myglobal=3, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=3, myglobal=3, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=3, myglobal=3, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=3, myglobal=4, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=4, myglobal=4, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=4, myglobal=4, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=4, myglobal=5, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=5, myglobal=5, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=5, myglobal=5, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=5, myglobal=6, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=6, myglobal=6, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=6, myglobal=6, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=6, myglobal=7, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=7, myglobal=7, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=7, myglobal=7, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=7, myglobal=8, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=8, myglobal=8, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=8, myglobal=8, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=8, myglobal=9, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=9, myglobal=9, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=9, myglobal=9, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=9, myglobal=10, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=10, myglobal=10, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=10, myglobal=10, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=10, myglobal=11, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=11, myglobal=11, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=11, myglobal=11, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=11, myglobal=12, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=12, myglobal=12, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=12, myglobal=12, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=12, myglobal=13, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=13, myglobal=13, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=13, myglobal=13, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=13, myglobal=14, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=14, myglobal=14, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=14, myglobal=14, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=14, myglobal=15, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=15, myglobal=15, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=15, myglobal=15, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=15, myglobal=16, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=16, myglobal=16, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=16, myglobal=16, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=16, myglobal=17, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=17, myglobal=17, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=17, myglobal=17, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=17, myglobal=18, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=18, myglobal=18, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=18, myglobal=18, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=18, myglobal=19, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=19, myglobal=19, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=19, myglobal=19, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=19, myglobal=20, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=20, myglobal=20, mythread=-1] [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 [L1352] COND FALSE 0 !(i<20) VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=20, j=21, myglobal=20, mythread=-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] [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: 12.1s, OverallIterations: 10, TraceHistogramMax: 20, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 945 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 937 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2584 IncrementalHoareTripleChecker+Invalid, 2626 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 2 mSDtfsCounter, 2584 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 788 GetRequests, 684 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=713occurred in iteration=9, InterpolantAutomatonStates: 92, 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.3s InterpolantComputationTime, 573 NumberOfCodeBlocks, 540 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 753 ConstructedInterpolants, 0 QuantifiedInterpolants, 2546 SizeOfPredicates, 0 NumberOfNonLiveVariables, 864 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 2147/3467 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-12 16:15:59,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample