./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/lazy01.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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/lazy01.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 b5d87933b05ad3566f9bc28daac5c0aeceb8a45433a1cac3d51a8d34f7f284f0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:20:35,300 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:20:35,367 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:20:35,373 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:20:35,373 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:20:35,405 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:20:35,406 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:20:35,406 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:20:35,407 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:20:35,407 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:20:35,407 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:20:35,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:20:35,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:20:35,409 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:20:35,409 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:20:35,413 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:20:35,415 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:20:35,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:20:35,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:20:35,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:20:35,417 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:20:35,417 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:20:35,418 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:20:35,418 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:20:35,418 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:20:35,418 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:20:35,419 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:20:35,419 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:20:35,419 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:20:35,420 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:20:35,420 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:20:35,420 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:20:35,421 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:20:35,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:20:35,421 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:20:35,421 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:20:35,422 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:20:35,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:20:35,422 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:20:35,423 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:20:35,423 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:20:35,425 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:20:35,426 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 -> b5d87933b05ad3566f9bc28daac5c0aeceb8a45433a1cac3d51a8d34f7f284f0 [2024-11-09 10:20:35,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:20:35,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:20:35,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:20:35,736 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:20:35,737 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:20:35,738 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/lazy01.i [2024-11-09 10:20:37,148 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:20:37,395 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:20:37,396 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/lazy01.i [2024-11-09 10:20:37,413 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd750291e/125087334a4a41c7b8ddc1d26f5467b9/FLAG6c556deeb [2024-11-09 10:20:37,722 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd750291e/125087334a4a41c7b8ddc1d26f5467b9 [2024-11-09 10:20:37,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:20:37,726 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:20:37,726 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:20:37,726 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:20:37,731 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:20:37,731 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:20:37" (1/1) ... [2024-11-09 10:20:37,732 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65cb6719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:37, skipping insertion in model container [2024-11-09 10:20:37,732 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:20:37" (1/1) ... [2024-11-09 10:20:37,776 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:20:38,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:20:38,180 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:20:38,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:20:38,298 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:20:38,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:38 WrapperNode [2024-11-09 10:20:38,299 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:20:38,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:20:38,300 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:20:38,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:20:38,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:38" (1/1) ... [2024-11-09 10:20:38,321 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:38" (1/1) ... [2024-11-09 10:20:38,350 INFO L138 Inliner]: procedures = 169, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2024-11-09 10:20:38,351 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:20:38,353 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:20:38,353 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:20:38,353 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:20:38,364 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:38" (1/1) ... [2024-11-09 10:20:38,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:38" (1/1) ... [2024-11-09 10:20:38,366 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:38" (1/1) ... [2024-11-09 10:20:38,386 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2024-11-09 10:20:38,387 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:38" (1/1) ... [2024-11-09 10:20:38,387 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:38" (1/1) ... [2024-11-09 10:20:38,395 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:38" (1/1) ... [2024-11-09 10:20:38,400 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:38" (1/1) ... [2024-11-09 10:20:38,401 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:38" (1/1) ... [2024-11-09 10:20:38,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:38" (1/1) ... [2024-11-09 10:20:38,409 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:20:38,410 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:20:38,410 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:20:38,410 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:20:38,411 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:38" (1/1) ... [2024-11-09 10:20:38,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:20:38,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:20:38,451 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-09 10:20:38,454 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-09 10:20:38,501 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 10:20:38,501 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 10:20:38,502 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 10:20:38,502 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 10:20:38,502 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-09 10:20:38,502 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-09 10:20:38,503 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 10:20:38,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:20:38,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:20:38,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:20:38,503 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 10:20:38,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:20:38,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:20:38,507 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:20:38,697 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:20:38,699 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:20:38,866 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:20:38,866 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:20:38,968 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:20:38,969 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 10:20:38,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:20:38 BoogieIcfgContainer [2024-11-09 10:20:38,973 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:20:38,975 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:20:38,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:20:38,981 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:20:38,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:20:37" (1/3) ... [2024-11-09 10:20:38,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b7604fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:20:38, skipping insertion in model container [2024-11-09 10:20:38,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:38" (2/3) ... [2024-11-09 10:20:38,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b7604fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:20:38, skipping insertion in model container [2024-11-09 10:20:38,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:20:38" (3/3) ... [2024-11-09 10:20:38,984 INFO L112 eAbstractionObserver]: Analyzing ICFG lazy01.i [2024-11-09 10:20:39,002 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:20:39,003 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 10:20:39,003 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:20:39,063 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-09 10:20:39,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 38 transitions, 97 flow [2024-11-09 10:20:39,132 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2024-11-09 10:20:39,132 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 10:20:39,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 2/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2024-11-09 10:20:39,135 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 38 transitions, 97 flow [2024-11-09 10:20:39,141 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 34 transitions, 86 flow [2024-11-09 10:20:39,152 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:20:39,161 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;@264bc95e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:20:39,162 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-09 10:20:39,177 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:20:39,178 INFO L124 PetriNetUnfolderBase]: 2/28 cut-off events. [2024-11-09 10:20:39,178 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:20:39,178 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:20:39,179 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:20:39,180 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread3Err0ASSERT_VIOLATIONMEMORY_LEAK === [thread3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:20:39,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:20:39,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1771620510, now seen corresponding path program 1 times [2024-11-09 10:20:39,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:20:39,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253142774] [2024-11-09 10:20:39,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:20:39,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:20:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:20:39,498 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-09 10:20:39,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:20:39,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253142774] [2024-11-09 10:20:39,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253142774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:20:39,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:20:39,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:20:39,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900817958] [2024-11-09 10:20:39,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:20:39,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:20:39,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:20:39,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:20:39,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:20:39,553 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2024-11-09 10:20:39,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-09 10:20:39,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:20:39,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2024-11-09 10:20:39,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:20:39,849 INFO L124 PetriNetUnfolderBase]: 588/1023 cut-off events. [2024-11-09 10:20:39,849 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2024-11-09 10:20:39,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2043 conditions, 1023 events. 588/1023 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5388 event pairs, 178 based on Foata normal form. 95/1096 useless extension candidates. Maximal degree in co-relation 1849. Up to 827 conditions per place. [2024-11-09 10:20:39,888 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 31 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2024-11-09 10:20:39,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 178 flow [2024-11-09 10:20:39,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:20:39,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:20:39,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-11-09 10:20:39,904 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6403508771929824 [2024-11-09 10:20:39,906 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 86 flow. Second operand 3 states and 73 transitions. [2024-11-09 10:20:39,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 178 flow [2024-11-09 10:20:39,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 162 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-09 10:20:39,915 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 87 flow [2024-11-09 10:20:39,917 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2024-11-09 10:20:39,921 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2024-11-09 10:20:39,923 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 87 flow [2024-11-09 10:20:39,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-09 10:20:39,923 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:20:39,924 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:20:39,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:20:39,924 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread3Err0ASSERT_VIOLATIONMEMORY_LEAK === [thread3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:20:39,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:20:39,925 INFO L85 PathProgramCache]: Analyzing trace with hash -895038378, now seen corresponding path program 1 times [2024-11-09 10:20:39,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:20:39,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917997499] [2024-11-09 10:20:39,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:20:39,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:20:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:20:40,076 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-09 10:20:40,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:20:40,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917997499] [2024-11-09 10:20:40,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917997499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:20:40,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:20:40,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:20:40,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109318701] [2024-11-09 10:20:40,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:20:40,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:20:40,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:20:40,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:20:40,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:20:40,080 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2024-11-09 10:20:40,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:20:40,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:20:40,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2024-11-09 10:20:40,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:20:40,213 INFO L124 PetriNetUnfolderBase]: 303/636 cut-off events. [2024-11-09 10:20:40,214 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-09 10:20:40,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1302 conditions, 636 events. 303/636 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3032 event pairs, 108 based on Foata normal form. 80/709 useless extension candidates. Maximal degree in co-relation 734. Up to 327 conditions per place. [2024-11-09 10:20:40,220 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 28 selfloop transitions, 6 changer transitions 0/43 dead transitions. [2024-11-09 10:20:40,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 179 flow [2024-11-09 10:20:40,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:20:40,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:20:40,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-11-09 10:20:40,223 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6228070175438597 [2024-11-09 10:20:40,223 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 87 flow. Second operand 3 states and 71 transitions. [2024-11-09 10:20:40,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 179 flow [2024-11-09 10:20:40,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:20:40,226 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 96 flow [2024-11-09 10:20:40,227 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2024-11-09 10:20:40,228 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2024-11-09 10:20:40,228 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 96 flow [2024-11-09 10:20:40,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:20:40,229 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:20:40,229 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:20:40,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:20:40,229 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread3Err0ASSERT_VIOLATIONMEMORY_LEAK === [thread3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:20:40,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:20:40,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1678654816, now seen corresponding path program 1 times [2024-11-09 10:20:40,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:20:40,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831512974] [2024-11-09 10:20:40,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:20:40,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:20:40,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:20:40,311 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-09 10:20:40,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:20:40,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831512974] [2024-11-09 10:20:40,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831512974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:20:40,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:20:40,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:20:40,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612237672] [2024-11-09 10:20:40,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:20:40,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:20:40,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:20:40,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:20:40,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:20:40,319 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2024-11-09 10:20:40,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-09 10:20:40,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:20:40,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2024-11-09 10:20:40,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:20:40,493 INFO L124 PetriNetUnfolderBase]: 298/607 cut-off events. [2024-11-09 10:20:40,494 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2024-11-09 10:20:40,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1390 conditions, 607 events. 298/607 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2824 event pairs, 65 based on Foata normal form. 5/606 useless extension candidates. Maximal degree in co-relation 255. Up to 363 conditions per place. [2024-11-09 10:20:40,498 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 39 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2024-11-09 10:20:40,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 238 flow [2024-11-09 10:20:40,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:20:40,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:20:40,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2024-11-09 10:20:40,501 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6052631578947368 [2024-11-09 10:20:40,502 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 96 flow. Second operand 4 states and 92 transitions. [2024-11-09 10:20:40,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 238 flow [2024-11-09 10:20:40,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 52 transitions, 225 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:20:40,506 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 102 flow [2024-11-09 10:20:40,507 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2024-11-09 10:20:40,507 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2024-11-09 10:20:40,508 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 102 flow [2024-11-09 10:20:40,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-09 10:20:40,509 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:20:40,509 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:20:40,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:20:40,509 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread3Err0ASSERT_VIOLATIONMEMORY_LEAK === [thread3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:20:40,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:20:40,511 INFO L85 PathProgramCache]: Analyzing trace with hash 2003875104, now seen corresponding path program 1 times [2024-11-09 10:20:40,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:20:40,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23423694] [2024-11-09 10:20:40,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:20:40,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:20:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:20:40,605 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-09 10:20:40,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:20:40,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23423694] [2024-11-09 10:20:40,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23423694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:20:40,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:20:40,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:20:40,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806156363] [2024-11-09 10:20:40,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:20:40,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:20:40,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:20:40,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:20:40,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:20:40,613 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2024-11-09 10:20:40,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-09 10:20:40,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:20:40,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2024-11-09 10:20:40,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:20:40,760 INFO L124 PetriNetUnfolderBase]: 341/666 cut-off events. [2024-11-09 10:20:40,761 INFO L125 PetriNetUnfolderBase]: For 213/213 co-relation queries the response was YES. [2024-11-09 10:20:40,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1524 conditions, 666 events. 341/666 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3000 event pairs, 91 based on Foata normal form. 4/666 useless extension candidates. Maximal degree in co-relation 508. Up to 316 conditions per place. [2024-11-09 10:20:40,765 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 43 selfloop transitions, 6 changer transitions 0/57 dead transitions. [2024-11-09 10:20:40,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 57 transitions, 261 flow [2024-11-09 10:20:40,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:20:40,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:20:40,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2024-11-09 10:20:40,767 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.618421052631579 [2024-11-09 10:20:40,767 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 102 flow. Second operand 4 states and 94 transitions. [2024-11-09 10:20:40,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 57 transitions, 261 flow [2024-11-09 10:20:40,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 57 transitions, 253 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-09 10:20:40,772 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 121 flow [2024-11-09 10:20:40,772 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2024-11-09 10:20:40,774 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2024-11-09 10:20:40,774 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 121 flow [2024-11-09 10:20:40,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-09 10:20:40,775 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:20:40,775 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:20:40,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:20:40,775 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread3Err0ASSERT_VIOLATIONMEMORY_LEAK === [thread3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:20:40,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:20:40,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1657223266, now seen corresponding path program 1 times [2024-11-09 10:20:40,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:20:40,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080994134] [2024-11-09 10:20:40,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:20:40,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:20:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:20:40,804 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:20:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:20:40,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:20:40,847 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:20:40,848 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thread3Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-11-09 10:20:40,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-09 10:20:40,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-11-09 10:20:40,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-09 10:20:40,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-09 10:20:40,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-11-09 10:20:40,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:20:40,852 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-09 10:20:40,896 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:20:40,896 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:20:40,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:20:40 BasicIcfg [2024-11-09 10:20:40,905 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:20:40,906 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:20:40,906 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:20:40,907 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:20:40,907 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:20:38" (3/4) ... [2024-11-09 10:20:40,909 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:20:40,910 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:20:40,911 INFO L158 Benchmark]: Toolchain (without parser) took 3185.28ms. Allocated memory was 155.2MB in the beginning and 207.6MB in the end (delta: 52.4MB). Free memory was 79.0MB in the beginning and 109.2MB in the end (delta: -30.3MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2024-11-09 10:20:40,912 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:20:40,912 INFO L158 Benchmark]: CACSL2BoogieTranslator took 572.50ms. Allocated memory is still 155.2MB. Free memory was 78.7MB in the beginning and 120.7MB in the end (delta: -42.0MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. [2024-11-09 10:20:40,912 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.50ms. Allocated memory is still 155.2MB. Free memory was 120.7MB in the beginning and 119.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:20:40,912 INFO L158 Benchmark]: Boogie Preprocessor took 55.87ms. Allocated memory is still 155.2MB. Free memory was 119.3MB in the beginning and 117.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:20:40,913 INFO L158 Benchmark]: RCFGBuilder took 563.58ms. Allocated memory is still 155.2MB. Free memory was 117.2MB in the beginning and 109.2MB in the end (delta: 8.0MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2024-11-09 10:20:40,913 INFO L158 Benchmark]: TraceAbstraction took 1929.84ms. Allocated memory was 155.2MB in the beginning and 207.6MB in the end (delta: 52.4MB). Free memory was 108.5MB in the beginning and 109.2MB in the end (delta: -734.7kB). Peak memory consumption was 53.1MB. Max. memory is 16.1GB. [2024-11-09 10:20:40,915 INFO L158 Benchmark]: Witness Printer took 3.96ms. Allocated memory is still 207.6MB. Free memory is still 109.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:20:40,917 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 572.50ms. Allocated memory is still 155.2MB. Free memory was 78.7MB in the beginning and 120.7MB in the end (delta: -42.0MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.50ms. Allocated memory is still 155.2MB. Free memory was 120.7MB in the beginning and 119.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.87ms. Allocated memory is still 155.2MB. Free memory was 119.3MB in the beginning and 117.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 563.58ms. Allocated memory is still 155.2MB. Free memory was 117.2MB in the beginning and 109.2MB in the end (delta: 8.0MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1929.84ms. Allocated memory was 155.2MB in the beginning and 207.6MB in the end (delta: 52.4MB). Free memory was 108.5MB in the beginning and 109.2MB in the end (delta: -734.7kB). Peak memory consumption was 53.1MB. Max. memory is 16.1GB. * Witness Printer took 3.96ms. Allocated memory is still 207.6MB. Free memory is still 109.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 20. Possible FailurePath: [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L703] 0 int data = 0; [L731] 0 pthread_t t1, t2, t3; [L732] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\old(arg)={0:0}, data=0, mutex={3:0}, t1=-1] [L733] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, data=0, mutex={3:0}, t1=-1, t2=0] [L734] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, data=0, mutex={3:0}, t1=-1, t2=0, t3=1] [L707] 1 data++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, data=1, mutex={3:0}] [L714] 2 data+=2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, data=3, mutex={3:0}] [L721] COND TRUE 3 data >= 3 [L722] CALL 3 reach_error() [L20] COND FALSE 3 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, data=3, mutex={3:0}] [L20] 3 __assert_fail ("0", "lazy01.c", 3, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, data=3, mutex={3:0}] - UnprovableResult [Line: 728]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 732]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 734]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 733]: 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 7 procedures, 63 locations, 6 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: 1.8s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 62 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 212 IncrementalHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 0 mSDtfsCounter, 212 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=4, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 161 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 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-09 10:20:40,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/lazy01.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 b5d87933b05ad3566f9bc28daac5c0aeceb8a45433a1cac3d51a8d34f7f284f0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:20:43,101 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:20:43,184 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:20:43,188 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:20:43,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:20:43,219 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:20:43,222 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:20:43,222 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:20:43,223 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:20:43,223 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:20:43,223 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:20:43,223 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:20:43,224 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:20:43,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:20:43,226 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:20:43,226 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:20:43,226 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:20:43,226 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:20:43,227 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:20:43,227 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:20:43,228 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:20:43,228 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:20:43,228 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:20:43,229 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:20:43,229 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:20:43,229 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:20:43,230 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:20:43,230 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:20:43,230 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:20:43,230 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:20:43,231 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:20:43,231 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:20:43,231 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:20:43,232 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:20:43,232 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:20:43,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:20:43,232 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:20:43,232 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:20:43,232 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:20:43,233 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:20:43,233 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:20:43,233 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:20:43,233 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:20:43,233 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:20:43,234 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 -> b5d87933b05ad3566f9bc28daac5c0aeceb8a45433a1cac3d51a8d34f7f284f0 [2024-11-09 10:20:43,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:20:43,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:20:43,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:20:43,601 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:20:43,601 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:20:43,602 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/lazy01.i [2024-11-09 10:20:45,164 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:20:45,463 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:20:45,464 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/lazy01.i [2024-11-09 10:20:45,483 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e38e8e3c1/1fda36f252444e069b82098a2525f26e/FLAG03a631044 [2024-11-09 10:20:45,758 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e38e8e3c1/1fda36f252444e069b82098a2525f26e [2024-11-09 10:20:45,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:20:45,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:20:45,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:20:45,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:20:45,769 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:20:45,771 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:20:45" (1/1) ... [2024-11-09 10:20:45,774 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dc50eb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:45, skipping insertion in model container [2024-11-09 10:20:45,774 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:20:45" (1/1) ... [2024-11-09 10:20:45,815 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:20:46,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:20:46,234 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:20:46,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:20:46,321 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:20:46,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:46 WrapperNode [2024-11-09 10:20:46,322 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:20:46,323 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:20:46,323 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:20:46,323 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:20:46,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:46" (1/1) ... [2024-11-09 10:20:46,350 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:46" (1/1) ... [2024-11-09 10:20:46,374 INFO L138 Inliner]: procedures = 173, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2024-11-09 10:20:46,376 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:20:46,377 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:20:46,377 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:20:46,377 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:20:46,387 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:46" (1/1) ... [2024-11-09 10:20:46,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:46" (1/1) ... [2024-11-09 10:20:46,395 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:46" (1/1) ... [2024-11-09 10:20:46,423 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2024-11-09 10:20:46,424 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:46" (1/1) ... [2024-11-09 10:20:46,424 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:46" (1/1) ... [2024-11-09 10:20:46,436 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:46" (1/1) ... [2024-11-09 10:20:46,441 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:46" (1/1) ... [2024-11-09 10:20:46,447 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:46" (1/1) ... [2024-11-09 10:20:46,449 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:46" (1/1) ... [2024-11-09 10:20:46,451 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:20:46,452 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:20:46,452 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:20:46,453 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:20:46,454 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:46" (1/1) ... [2024-11-09 10:20:46,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:20:46,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:20:46,503 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-09 10:20:46,507 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-09 10:20:46,560 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 10:20:46,560 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 10:20:46,561 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 10:20:46,561 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 10:20:46,561 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-09 10:20:46,561 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-09 10:20:46,561 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 10:20:46,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:20:46,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:20:46,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 10:20:46,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 10:20:46,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-09 10:20:46,563 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 10:20:46,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:20:46,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:20:46,565 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:20:46,729 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:20:46,732 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:20:46,952 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:20:46,952 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:20:47,126 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:20:47,127 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 10:20:47,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:20:47 BoogieIcfgContainer [2024-11-09 10:20:47,127 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:20:47,129 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:20:47,129 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:20:47,134 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:20:47,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:20:45" (1/3) ... [2024-11-09 10:20:47,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a3cf46c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:20:47, skipping insertion in model container [2024-11-09 10:20:47,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:46" (2/3) ... [2024-11-09 10:20:47,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a3cf46c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:20:47, skipping insertion in model container [2024-11-09 10:20:47,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:20:47" (3/3) ... [2024-11-09 10:20:47,139 INFO L112 eAbstractionObserver]: Analyzing ICFG lazy01.i [2024-11-09 10:20:47,158 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:20:47,158 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 10:20:47,159 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:20:47,242 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-09 10:20:47,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 38 transitions, 97 flow [2024-11-09 10:20:47,315 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2024-11-09 10:20:47,316 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 10:20:47,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 2/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2024-11-09 10:20:47,320 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 38 transitions, 97 flow [2024-11-09 10:20:47,323 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 34 transitions, 86 flow [2024-11-09 10:20:47,336 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:20:47,342 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;@11fe933d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:20:47,343 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-09 10:20:47,353 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:20:47,353 INFO L124 PetriNetUnfolderBase]: 2/28 cut-off events. [2024-11-09 10:20:47,353 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:20:47,353 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:20:47,354 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:20:47,355 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread3Err0ASSERT_VIOLATIONMEMORY_LEAK === [thread3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:20:47,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:20:47,363 INFO L85 PathProgramCache]: Analyzing trace with hash -252257762, now seen corresponding path program 1 times [2024-11-09 10:20:47,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:20:47,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [3417876] [2024-11-09 10:20:47,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:20:47,379 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-09 10:20:47,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:20:47,384 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-09 10:20:47,385 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-09 10:20:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:20:47,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:20:47,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:20:47,592 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-09 10:20:47,592 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:20:47,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:20:47,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [3417876] [2024-11-09 10:20:47,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [3417876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:20:47,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:20:47,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:20:47,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773832464] [2024-11-09 10:20:47,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:20:47,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:20:47,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:20:47,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:20:47,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:20:47,652 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2024-11-09 10:20:47,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-09 10:20:47,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:20:47,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2024-11-09 10:20:47,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:20:47,947 INFO L124 PetriNetUnfolderBase]: 588/1023 cut-off events. [2024-11-09 10:20:47,947 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2024-11-09 10:20:47,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2043 conditions, 1023 events. 588/1023 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5390 event pairs, 178 based on Foata normal form. 95/1096 useless extension candidates. Maximal degree in co-relation 1849. Up to 827 conditions per place. [2024-11-09 10:20:47,960 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 31 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2024-11-09 10:20:47,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 178 flow [2024-11-09 10:20:47,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:20:47,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:20:47,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-11-09 10:20:47,973 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6403508771929824 [2024-11-09 10:20:47,975 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 86 flow. Second operand 3 states and 73 transitions. [2024-11-09 10:20:47,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 178 flow [2024-11-09 10:20:47,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 162 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-09 10:20:47,984 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 87 flow [2024-11-09 10:20:47,986 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2024-11-09 10:20:47,990 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2024-11-09 10:20:47,990 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 87 flow [2024-11-09 10:20:47,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-09 10:20:47,991 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:20:47,991 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:20:47,994 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-09 10:20:48,192 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-09 10:20:48,192 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread3Err0ASSERT_VIOLATIONMEMORY_LEAK === [thread3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:20:48,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:20:48,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1501736296, now seen corresponding path program 1 times [2024-11-09 10:20:48,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:20:48,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617367403] [2024-11-09 10:20:48,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:20:48,195 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-09 10:20:48,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:20:48,197 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-09 10:20:48,198 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-09 10:20:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:20:48,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:20:48,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:20:48,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-09 10:20:48,415 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-09 10:20:48,416 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:20:48,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:20:48,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617367403] [2024-11-09 10:20:48,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [617367403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:20:48,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:20:48,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:20:48,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184567979] [2024-11-09 10:20:48,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:20:48,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:20:48,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:20:48,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:20:48,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:20:48,420 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2024-11-09 10:20:48,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:20:48,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:20:48,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2024-11-09 10:20:48,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:20:48,584 INFO L124 PetriNetUnfolderBase]: 303/636 cut-off events. [2024-11-09 10:20:48,584 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-09 10:20:48,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1302 conditions, 636 events. 303/636 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3033 event pairs, 108 based on Foata normal form. 80/709 useless extension candidates. Maximal degree in co-relation 734. Up to 327 conditions per place. [2024-11-09 10:20:48,591 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 28 selfloop transitions, 6 changer transitions 0/43 dead transitions. [2024-11-09 10:20:48,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 179 flow [2024-11-09 10:20:48,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:20:48,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:20:48,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-11-09 10:20:48,596 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6228070175438597 [2024-11-09 10:20:48,596 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 87 flow. Second operand 3 states and 71 transitions. [2024-11-09 10:20:48,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 179 flow [2024-11-09 10:20:48,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:20:48,598 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 96 flow [2024-11-09 10:20:48,598 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2024-11-09 10:20:48,599 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2024-11-09 10:20:48,599 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 96 flow [2024-11-09 10:20:48,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:20:48,599 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:20:48,600 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:20:48,604 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-09 10:20:48,801 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-09 10:20:48,801 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread3Err0ASSERT_VIOLATIONMEMORY_LEAK === [thread3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:20:48,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:20:48,802 INFO L85 PathProgramCache]: Analyzing trace with hash 50888544, now seen corresponding path program 1 times [2024-11-09 10:20:48,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:20:48,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [308519914] [2024-11-09 10:20:48,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:20:48,803 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-09 10:20:48,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:20:48,806 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-09 10:20:48,808 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-09 10:20:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:20:48,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:20:48,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:20:48,940 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-09 10:20:48,941 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:20:48,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:20:48,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [308519914] [2024-11-09 10:20:48,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [308519914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:20:48,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:20:48,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:20:48,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111247294] [2024-11-09 10:20:48,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:20:48,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:20:48,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:20:48,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:20:48,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:20:48,949 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2024-11-09 10:20:48,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-09 10:20:48,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:20:48,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2024-11-09 10:20:48,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:20:49,096 INFO L124 PetriNetUnfolderBase]: 298/607 cut-off events. [2024-11-09 10:20:49,097 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2024-11-09 10:20:49,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1390 conditions, 607 events. 298/607 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2839 event pairs, 65 based on Foata normal form. 5/606 useless extension candidates. Maximal degree in co-relation 255. Up to 363 conditions per place. [2024-11-09 10:20:49,100 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 39 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2024-11-09 10:20:49,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 238 flow [2024-11-09 10:20:49,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:20:49,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:20:49,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2024-11-09 10:20:49,103 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6052631578947368 [2024-11-09 10:20:49,103 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 96 flow. Second operand 4 states and 92 transitions. [2024-11-09 10:20:49,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 238 flow [2024-11-09 10:20:49,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 52 transitions, 225 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:20:49,109 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 102 flow [2024-11-09 10:20:49,110 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2024-11-09 10:20:49,110 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2024-11-09 10:20:49,110 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 102 flow [2024-11-09 10:20:49,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-09 10:20:49,111 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:20:49,111 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:20:49,116 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-09 10:20:49,315 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-09 10:20:49,316 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread3Err0ASSERT_VIOLATIONMEMORY_LEAK === [thread3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:20:49,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:20:49,318 INFO L85 PathProgramCache]: Analyzing trace with hash 376108832, now seen corresponding path program 1 times [2024-11-09 10:20:49,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:20:49,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [254585205] [2024-11-09 10:20:49,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:20:49,319 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-09 10:20:49,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:20:49,324 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-09 10:20:49,325 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-09 10:20:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:20:49,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:20:49,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:20:49,441 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-09 10:20:49,441 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:20:49,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:20:49,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [254585205] [2024-11-09 10:20:49,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [254585205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:20:49,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:20:49,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:20:49,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641536742] [2024-11-09 10:20:49,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:20:49,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:20:49,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:20:49,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:20:49,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:20:49,448 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2024-11-09 10:20:49,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-09 10:20:49,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:20:49,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2024-11-09 10:20:49,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:20:49,587 INFO L124 PetriNetUnfolderBase]: 294/567 cut-off events. [2024-11-09 10:20:49,587 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2024-11-09 10:20:49,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1333 conditions, 567 events. 294/567 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2527 event pairs, 100 based on Foata normal form. 4/561 useless extension candidates. Maximal degree in co-relation 491. Up to 381 conditions per place. [2024-11-09 10:20:49,593 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 38 selfloop transitions, 4 changer transitions 0/51 dead transitions. [2024-11-09 10:20:49,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 51 transitions, 232 flow [2024-11-09 10:20:49,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:20:49,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:20:49,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2024-11-09 10:20:49,598 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5986842105263158 [2024-11-09 10:20:49,599 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 102 flow. Second operand 4 states and 91 transitions. [2024-11-09 10:20:49,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 51 transitions, 232 flow [2024-11-09 10:20:49,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 224 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-09 10:20:49,602 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 106 flow [2024-11-09 10:20:49,603 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2024-11-09 10:20:49,603 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2024-11-09 10:20:49,604 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 106 flow [2024-11-09 10:20:49,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-09 10:20:49,605 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:20:49,605 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:20:49,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-09 10:20:49,808 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-09 10:20:49,808 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread3Err0ASSERT_VIOLATIONMEMORY_LEAK === [thread3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 10:20:49,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:20:49,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1764660510, now seen corresponding path program 1 times [2024-11-09 10:20:49,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:20:49,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1104980079] [2024-11-09 10:20:49,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:20:49,810 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-09 10:20:49,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:20:49,811 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-09 10:20:49,812 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-09 10:20:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:20:49,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:20:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:20:49,935 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 10:20:49,936 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:20:49,937 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thread3Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2024-11-09 10:20:49,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2024-11-09 10:20:49,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2024-11-09 10:20:49,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-09 10:20:49,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-09 10:20:49,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-11-09 10:20:49,944 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-09 10:20:50,143 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-09 10:20:50,144 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-09 10:20:50,183 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:20:50,183 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:20:50,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:20:50 BasicIcfg [2024-11-09 10:20:50,190 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:20:50,191 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:20:50,192 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:20:50,192 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:20:50,192 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:20:47" (3/4) ... [2024-11-09 10:20:50,194 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:20:50,195 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:20:50,196 INFO L158 Benchmark]: Toolchain (without parser) took 4433.75ms. Allocated memory was 62.9MB in the beginning and 96.5MB in the end (delta: 33.6MB). Free memory was 37.2MB in the beginning and 39.1MB in the end (delta: -1.9MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2024-11-09 10:20:50,196 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 41.9MB. Free memory was 18.6MB in the beginning and 18.6MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:20:50,198 INFO L158 Benchmark]: CACSL2BoogieTranslator took 559.09ms. Allocated memory was 62.9MB in the beginning and 79.7MB in the end (delta: 16.8MB). Free memory was 37.0MB in the beginning and 48.1MB in the end (delta: -11.1MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2024-11-09 10:20:50,199 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.13ms. Allocated memory is still 79.7MB. Free memory was 48.1MB in the beginning and 46.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:20:50,199 INFO L158 Benchmark]: Boogie Preprocessor took 74.65ms. Allocated memory is still 79.7MB. Free memory was 46.0MB in the beginning and 43.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:20:50,199 INFO L158 Benchmark]: RCFGBuilder took 674.92ms. Allocated memory is still 79.7MB. Free memory was 43.6MB in the beginning and 34.1MB in the end (delta: 9.5MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2024-11-09 10:20:50,200 INFO L158 Benchmark]: TraceAbstraction took 3061.42ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 33.3MB in the beginning and 39.8MB in the end (delta: -6.5MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2024-11-09 10:20:50,201 INFO L158 Benchmark]: Witness Printer took 3.83ms. Allocated memory is still 96.5MB. Free memory was 39.8MB in the beginning and 39.1MB in the end (delta: 723.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:20:50,203 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 41.9MB. Free memory was 18.6MB in the beginning and 18.6MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 559.09ms. Allocated memory was 62.9MB in the beginning and 79.7MB in the end (delta: 16.8MB). Free memory was 37.0MB in the beginning and 48.1MB in the end (delta: -11.1MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.13ms. Allocated memory is still 79.7MB. Free memory was 48.1MB in the beginning and 46.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.65ms. Allocated memory is still 79.7MB. Free memory was 46.0MB in the beginning and 43.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 674.92ms. Allocated memory is still 79.7MB. Free memory was 43.6MB in the beginning and 34.1MB in the end (delta: 9.5MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3061.42ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 33.3MB in the beginning and 39.8MB in the end (delta: -6.5MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. * Witness Printer took 3.83ms. Allocated memory is still 96.5MB. Free memory was 39.8MB in the beginning and 39.1MB in the end (delta: 723.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 20. Possible FailurePath: [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L702] 0 pthread_mutex_t mutex; [L703] 0 int data = 0; [L731] 0 pthread_t t1, t2, t3; [L732] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\old(arg)={0:0}, data=0, mutex={3:0}, t1=-1] [L733] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, data=0, mutex={3:0}, t1=-1, t2=0] [L734] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, data=0, mutex={3:0}, t1=-1, t2=0, t3=1] [L707] 1 data++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, data=1, mutex={3:0}] [L714] 2 data+=2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, data=3, mutex={3:0}] [L721] COND TRUE 3 data >= 3 [L722] CALL 3 reach_error() [L20] COND FALSE 3 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, data=3, mutex={3:0}] [L20] 3 __assert_fail ("0", "lazy01.c", 3, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, data=3, mutex={3:0}] - UnprovableResult [Line: 728]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 732]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 734]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 733]: 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 7 procedures, 63 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.9s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 52 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 256 IncrementalHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 1 mSDtfsCounter, 256 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=4, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 173 SizeOfPredicates, 0 NumberOfNonLiveVariables, 272 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 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-09 10:20:50,230 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