./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/arithmetic_prog_bad.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/arithmetic_prog_bad.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 02:15:15,019 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 02:15:15,116 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 02:15:15,121 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 02:15:15,122 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 02:15:15,151 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 02:15:15,152 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 02:15:15,152 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 02:15:15,153 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 02:15:15,157 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 02:15:15,157 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 02:15:15,157 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 02:15:15,159 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 02:15:15,160 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 02:15:15,161 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 02:15:15,161 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 02:15:15,161 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 02:15:15,162 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 02:15:15,162 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 02:15:15,162 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 02:15:15,163 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 02:15:15,164 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 02:15:15,164 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 02:15:15,165 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 02:15:15,165 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 02:15:15,165 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 02:15:15,165 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 02:15:15,166 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 02:15:15,166 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 02:15:15,167 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 02:15:15,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 02:15:15,168 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 02:15:15,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:15:15,168 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 02:15:15,169 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 02:15:15,169 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 02:15:15,169 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 02:15:15,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 02:15:15,169 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 02:15:15,170 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 02:15:15,170 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 02:15:15,170 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 02:15:15,170 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 02:15:15,171 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.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-28 02:15:15,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 02:15:15,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 02:15:15,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 02:15:15,478 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 02:15:15,478 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 02:15:15,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/arithmetic_prog_bad.yml/witness.yml [2024-06-28 02:15:15,607 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 02:15:15,607 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 02:15:15,607 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2024-06-28 02:15:16,803 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 02:15:17,076 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 02:15:17,076 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2024-06-28 02:15:17,093 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/823f92384/5055ea9b2ce5422b86d62685f057b9c4/FLAG39b0407a9 [2024-06-28 02:15:17,111 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/823f92384/5055ea9b2ce5422b86d62685f057b9c4 [2024-06-28 02:15:17,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 02:15:17,112 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 02:15:17,114 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 02:15:17,114 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 02:15:17,118 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 02:15:17,119 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:15:15" (1/2) ... [2024-06-28 02:15:17,120 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b616991 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:15:17, skipping insertion in model container [2024-06-28 02:15:17,120 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:15:15" (1/2) ... [2024-06-28 02:15:17,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@f7ba3cc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:15:17, skipping insertion in model container [2024-06-28 02:15:17,122 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:15:17" (2/2) ... [2024-06-28 02:15:17,122 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b616991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:15:17, skipping insertion in model container [2024-06-28 02:15:17,122 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:15:17" (2/2) ... [2024-06-28 02:15:17,122 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 02:15:17,162 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 02:15:17,164 INFO L97 edCorrectnessWitness]: Location invariant before [L915-L915] ((! multithreaded || (0 <= num && num <= 1)) && (! multithreaded || (m_locked || (0 <= num && num <= 1)))) && (! multithreaded || (flag == 0 || flag == 1)) [2024-06-28 02:15:17,164 INFO L97 edCorrectnessWitness]: Location invariant before [L914-L914] ((! multithreaded || (0 <= num && num <= 1)) && (! multithreaded || (m_locked || (0 <= num && num <= 1)))) && (! multithreaded || (flag == 0 || flag == 1)) [2024-06-28 02:15:17,164 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 02:15:17,164 INFO L103 edCorrectnessWitness]: ghost_variable m_locked = 0 [2024-06-28 02:15:17,164 INFO L106 edCorrectnessWitness]: ghost_update [L913-L913] multithreaded = 1; [2024-06-28 02:15:17,165 INFO L106 edCorrectnessWitness]: ghost_update [L879-L879] m_locked = 1; [2024-06-28 02:15:17,165 INFO L106 edCorrectnessWitness]: ghost_update [L898-L898] m_locked = 0; [2024-06-28 02:15:17,165 INFO L106 edCorrectnessWitness]: ghost_update [L881-L881] m_locked = 1; [2024-06-28 02:15:17,165 INFO L106 edCorrectnessWitness]: ghost_update [L881-L881] m_locked = 0; [2024-06-28 02:15:17,165 INFO L106 edCorrectnessWitness]: ghost_update [L895-L895] m_locked = 1; [2024-06-28 02:15:17,165 INFO L106 edCorrectnessWitness]: ghost_update [L895-L895] m_locked = 0; [2024-06-28 02:15:17,166 INFO L106 edCorrectnessWitness]: ghost_update [L883-L883] m_locked = 0; [2024-06-28 02:15:17,166 INFO L106 edCorrectnessWitness]: ghost_update [L893-L893] m_locked = 1; [2024-06-28 02:15:17,212 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 02:15:17,601 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i[39758,39771] [2024-06-28 02:15:17,607 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:15:17,619 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 02:15:17,694 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i[39758,39771] [2024-06-28 02:15:17,695 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:15:17,749 INFO L206 MainTranslator]: Completed translation [2024-06-28 02:15:17,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:15:17 WrapperNode [2024-06-28 02:15:17,750 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 02:15:17,751 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 02:15:17,751 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 02:15:17,751 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 02:15:17,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:15:17" (1/1) ... [2024-06-28 02:15:17,769 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:15:17" (1/1) ... [2024-06-28 02:15:17,793 INFO L138 Inliner]: procedures = 243, calls = 26, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 76 [2024-06-28 02:15:17,794 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 02:15:17,794 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 02:15:17,795 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 02:15:17,795 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 02:15:17,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:15:17" (1/1) ... [2024-06-28 02:15:17,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:15:17" (1/1) ... [2024-06-28 02:15:17,807 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:15:17" (1/1) ... [2024-06-28 02:15:17,820 INFO L175 MemorySlicer]: Split 11 memory accesses to 3 slices as follows [2, 1, 8]. 73 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 8]. The 0 writes are split as follows [0, 0, 0]. [2024-06-28 02:15:17,820 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:15:17" (1/1) ... [2024-06-28 02:15:17,820 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:15:17" (1/1) ... [2024-06-28 02:15:17,827 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:15:17" (1/1) ... [2024-06-28 02:15:17,830 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:15:17" (1/1) ... [2024-06-28 02:15:17,832 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:15:17" (1/1) ... [2024-06-28 02:15:17,833 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:15:17" (1/1) ... [2024-06-28 02:15:17,836 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 02:15:17,836 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 02:15:17,837 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 02:15:17,877 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 02:15:17,878 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:15:17" (1/1) ... [2024-06-28 02:15:17,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:15:17,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 02:15:17,945 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-06-28 02:15:17,951 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-06-28 02:15:17,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-06-28 02:15:17,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-06-28 02:15:17,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-06-28 02:15:17,979 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-06-28 02:15:17,980 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-28 02:15:17,980 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-28 02:15:17,983 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-28 02:15:17,983 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-28 02:15:17,984 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-06-28 02:15:17,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 02:15:17,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 02:15:17,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-28 02:15:17,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-06-28 02:15:17,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 02:15:17,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 02:15:17,986 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 02:15:18,176 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 02:15:18,179 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 02:15:18,361 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 02:15:18,361 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 02:15:18,526 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 02:15:18,526 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-06-28 02:15:18,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:15:18 BoogieIcfgContainer [2024-06-28 02:15:18,527 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 02:15:18,529 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 02:15:18,529 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 02:15:18,532 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 02:15:18,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:15:15" (1/4) ... [2024-06-28 02:15:18,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70745604 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 02:15:18, skipping insertion in model container [2024-06-28 02:15:18,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 02:15:17" (2/4) ... [2024-06-28 02:15:18,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70745604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 02:15:18, skipping insertion in model container [2024-06-28 02:15:18,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:15:17" (3/4) ... [2024-06-28 02:15:18,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70745604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 02:15:18, skipping insertion in model container [2024-06-28 02:15:18,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:15:18" (4/4) ... [2024-06-28 02:15:18,536 INFO L112 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2024-06-28 02:15:18,552 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 02:15:18,552 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-28 02:15:18,552 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 02:15:18,595 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-28 02:15:18,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 43 transitions, 100 flow [2024-06-28 02:15:18,665 INFO L124 PetriNetUnfolderBase]: 6/41 cut-off events. [2024-06-28 02:15:18,665 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-28 02:15:18,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 41 events. 6/41 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 70 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 31. Up to 3 conditions per place. [2024-06-28 02:15:18,668 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 43 transitions, 100 flow [2024-06-28 02:15:18,672 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 37 transitions, 86 flow [2024-06-28 02:15:18,681 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 02:15:18,687 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@914306d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 02:15:18,688 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-06-28 02:15:18,696 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 02:15:18,697 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-28 02:15:18,697 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 02:15:18,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:15:18,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 02:15:18,698 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 02:15:18,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:15:18,703 INFO L85 PathProgramCache]: Analyzing trace with hash 356815930, now seen corresponding path program 1 times [2024-06-28 02:15:18,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:15:18,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441636267] [2024-06-28 02:15:18,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:15:18,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:15:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:15:19,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:15:19,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:15:19,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441636267] [2024-06-28 02:15:19,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441636267] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:15:19,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:15:19,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 02:15:19,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185741091] [2024-06-28 02:15:19,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:15:19,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 02:15:19,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:15:19,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 02:15:19,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 02:15:19,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-06-28 02:15:19,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-06-28 02:15:19,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:15:19,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-06-28 02:15:19,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:15:19,391 INFO L124 PetriNetUnfolderBase]: 507/856 cut-off events. [2024-06-28 02:15:19,392 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-06-28 02:15:19,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1683 conditions, 856 events. 507/856 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3636 event pairs, 157 based on Foata normal form. 30/826 useless extension candidates. Maximal degree in co-relation 1593. Up to 674 conditions per place. [2024-06-28 02:15:19,404 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 39 selfloop transitions, 3 changer transitions 0/51 dead transitions. [2024-06-28 02:15:19,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 204 flow [2024-06-28 02:15:19,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 02:15:19,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 02:15:19,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2024-06-28 02:15:19,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6589147286821705 [2024-06-28 02:15:19,418 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 86 flow. Second operand 3 states and 85 transitions. [2024-06-28 02:15:19,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 204 flow [2024-06-28 02:15:19,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 51 transitions, 192 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-28 02:15:19,426 INFO L231 Difference]: Finished difference. Result has 39 places, 39 transitions, 103 flow [2024-06-28 02:15:19,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=39, PETRI_TRANSITIONS=39} [2024-06-28 02:15:19,432 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2024-06-28 02:15:19,432 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 39 transitions, 103 flow [2024-06-28 02:15:19,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-06-28 02:15:19,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:15:19,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:15:19,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 02:15:19,434 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 02:15:19,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:15:19,437 INFO L85 PathProgramCache]: Analyzing trace with hash -4554325, now seen corresponding path program 1 times [2024-06-28 02:15:19,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:15:19,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653667317] [2024-06-28 02:15:19,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:15:19,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:15:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:15:19,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:15:19,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:15:19,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653667317] [2024-06-28 02:15:19,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653667317] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:15:19,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:15:19,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 02:15:19,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808618332] [2024-06-28 02:15:19,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:15:19,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 02:15:19,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:15:19,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 02:15:19,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 02:15:19,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-28 02:15:19,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 39 transitions, 103 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-06-28 02:15:19,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:15:19,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-28 02:15:19,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:15:19,820 INFO L124 PetriNetUnfolderBase]: 497/931 cut-off events. [2024-06-28 02:15:19,820 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2024-06-28 02:15:19,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1956 conditions, 931 events. 497/931 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4130 event pairs, 150 based on Foata normal form. 161/1076 useless extension candidates. Maximal degree in co-relation 587. Up to 391 conditions per place. [2024-06-28 02:15:19,826 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 52 selfloop transitions, 7 changer transitions 0/67 dead transitions. [2024-06-28 02:15:19,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 67 transitions, 284 flow [2024-06-28 02:15:19,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 02:15:19,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 02:15:19,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2024-06-28 02:15:19,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6511627906976745 [2024-06-28 02:15:19,832 INFO L175 Difference]: Start difference. First operand has 39 places, 39 transitions, 103 flow. Second operand 4 states and 112 transitions. [2024-06-28 02:15:19,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 67 transitions, 284 flow [2024-06-28 02:15:19,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 67 transitions, 281 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 02:15:19,842 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 140 flow [2024-06-28 02:15:19,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=42, PETRI_TRANSITIONS=40} [2024-06-28 02:15:19,843 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2024-06-28 02:15:19,844 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 140 flow [2024-06-28 02:15:19,844 INFO L496 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-06-28 02:15:19,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:15:19,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:15:19,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 02:15:19,845 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 02:15:19,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:15:19,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1673040369, now seen corresponding path program 1 times [2024-06-28 02:15:19,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:15:19,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388219306] [2024-06-28 02:15:19,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:15:19,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:15:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:15:19,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:15:19,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:15:19,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388219306] [2024-06-28 02:15:19,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388219306] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:15:19,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:15:19,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 02:15:19,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369106793] [2024-06-28 02:15:19,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:15:19,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 02:15:19,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:15:19,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 02:15:19,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 02:15:19,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2024-06-28 02:15:19,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 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-06-28 02:15:19,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:15:19,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2024-06-28 02:15:19,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:15:20,114 INFO L124 PetriNetUnfolderBase]: 596/1185 cut-off events. [2024-06-28 02:15:20,114 INFO L125 PetriNetUnfolderBase]: For 642/656 co-relation queries the response was YES. [2024-06-28 02:15:20,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2682 conditions, 1185 events. 596/1185 cut-off events. For 642/656 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5673 event pairs, 281 based on Foata normal form. 30/1196 useless extension candidates. Maximal degree in co-relation 841. Up to 635 conditions per place. [2024-06-28 02:15:20,121 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 42 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2024-06-28 02:15:20,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 56 transitions, 274 flow [2024-06-28 02:15:20,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 02:15:20,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 02:15:20,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2024-06-28 02:15:20,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7131782945736435 [2024-06-28 02:15:20,126 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 140 flow. Second operand 3 states and 92 transitions. [2024-06-28 02:15:20,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 56 transitions, 274 flow [2024-06-28 02:15:20,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 02:15:20,130 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 142 flow [2024-06-28 02:15:20,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2024-06-28 02:15:20,131 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2024-06-28 02:15:20,131 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 142 flow [2024-06-28 02:15:20,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 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-06-28 02:15:20,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:15:20,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:15:20,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 02:15:20,132 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 02:15:20,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:15:20,133 INFO L85 PathProgramCache]: Analyzing trace with hash 707966612, now seen corresponding path program 1 times [2024-06-28 02:15:20,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:15:20,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757718041] [2024-06-28 02:15:20,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:15:20,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:15:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:15:20,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:15:20,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:15:20,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757718041] [2024-06-28 02:15:20,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757718041] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:15:20,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:15:20,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 02:15:20,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684928987] [2024-06-28 02:15:20,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:15:20,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 02:15:20,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:15:20,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 02:15:20,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 02:15:20,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2024-06-28 02:15:20,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-06-28 02:15:20,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:15:20,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2024-06-28 02:15:20,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:15:20,381 INFO L124 PetriNetUnfolderBase]: 332/758 cut-off events. [2024-06-28 02:15:20,381 INFO L125 PetriNetUnfolderBase]: For 414/420 co-relation queries the response was YES. [2024-06-28 02:15:20,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1714 conditions, 758 events. 332/758 cut-off events. For 414/420 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3305 event pairs, 131 based on Foata normal form. 46/797 useless extension candidates. Maximal degree in co-relation 475. Up to 311 conditions per place. [2024-06-28 02:15:20,385 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 33 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2024-06-28 02:15:20,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 270 flow [2024-06-28 02:15:20,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 02:15:20,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 02:15:20,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-06-28 02:15:20,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6976744186046512 [2024-06-28 02:15:20,387 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 142 flow. Second operand 3 states and 90 transitions. [2024-06-28 02:15:20,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 270 flow [2024-06-28 02:15:20,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 02:15:20,393 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 156 flow [2024-06-28 02:15:20,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2024-06-28 02:15:20,394 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2024-06-28 02:15:20,394 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 156 flow [2024-06-28 02:15:20,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-06-28 02:15:20,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:15:20,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:15:20,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 02:15:20,396 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 02:15:20,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:15:20,396 INFO L85 PathProgramCache]: Analyzing trace with hash -391816611, now seen corresponding path program 1 times [2024-06-28 02:15:20,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:15:20,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513855716] [2024-06-28 02:15:20,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:15:20,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:15:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:15:20,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:15:20,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:15:20,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513855716] [2024-06-28 02:15:20,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513855716] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 02:15:20,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405964412] [2024-06-28 02:15:20,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:15:20,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 02:15:20,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 02:15:20,512 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-28 02:15:20,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-06-28 02:15:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:15:20,640 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 3 conjunts are in the unsatisfiable core [2024-06-28 02:15:20,645 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 02:15:20,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:15:20,689 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 02:15:20,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:15:20,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405964412] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 02:15:20,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 02:15:20,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-06-28 02:15:20,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254142305] [2024-06-28 02:15:20,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 02:15:20,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:15:20,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:15:20,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:15:20,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:15:20,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2024-06-28 02:15:20,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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-06-28 02:15:20,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:15:20,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2024-06-28 02:15:20,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:15:20,933 INFO L124 PetriNetUnfolderBase]: 615/1270 cut-off events. [2024-06-28 02:15:20,933 INFO L125 PetriNetUnfolderBase]: For 942/960 co-relation queries the response was YES. [2024-06-28 02:15:20,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3221 conditions, 1270 events. 615/1270 cut-off events. For 942/960 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5470 event pairs, 73 based on Foata normal form. 72/1338 useless extension candidates. Maximal degree in co-relation 1044. Up to 318 conditions per place. [2024-06-28 02:15:20,942 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 65 selfloop transitions, 5 changer transitions 2/83 dead transitions. [2024-06-28 02:15:20,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 83 transitions, 467 flow [2024-06-28 02:15:20,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:15:20,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:15:20,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2024-06-28 02:15:20,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6976744186046512 [2024-06-28 02:15:20,945 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 156 flow. Second operand 5 states and 150 transitions. [2024-06-28 02:15:20,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 83 transitions, 467 flow [2024-06-28 02:15:20,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 83 transitions, 439 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 02:15:20,949 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 182 flow [2024-06-28 02:15:20,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=182, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2024-06-28 02:15:20,951 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2024-06-28 02:15:20,951 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 182 flow [2024-06-28 02:15:20,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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-06-28 02:15:20,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:15:20,952 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:15:20,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-06-28 02:15:21,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 02:15:21,168 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 02:15:21,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:15:21,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1587034059, now seen corresponding path program 1 times [2024-06-28 02:15:21,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:15:21,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288445038] [2024-06-28 02:15:21,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:15:21,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:15:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:15:21,372 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-06-28 02:15:21,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:15:21,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288445038] [2024-06-28 02:15:21,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288445038] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 02:15:21,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059776481] [2024-06-28 02:15:21,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:15:21,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 02:15:21,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 02:15:21,375 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-28 02:15:21,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-06-28 02:15:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:15:21,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 17 conjunts are in the unsatisfiable core [2024-06-28 02:15:21,521 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 02:15:21,592 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-06-28 02:15:21,592 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 02:15:21,799 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-06-28 02:15:21,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059776481] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 02:15:21,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 02:15:21,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2024-06-28 02:15:21,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711286558] [2024-06-28 02:15:21,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 02:15:21,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:15:21,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:15:21,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:15:21,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:15:21,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-28 02:15:21,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 182 flow. Second operand has 10 states, 10 states have (on average 17.3) internal successors, (173), 10 states have internal predecessors, (173), 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-06-28 02:15:21,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:15:21,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-28 02:15:21,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:15:22,000 INFO L124 PetriNetUnfolderBase]: 531/1145 cut-off events. [2024-06-28 02:15:22,000 INFO L125 PetriNetUnfolderBase]: For 1304/1304 co-relation queries the response was YES. [2024-06-28 02:15:22,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2992 conditions, 1145 events. 531/1145 cut-off events. For 1304/1304 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4816 event pairs, 189 based on Foata normal form. 22/1164 useless extension candidates. Maximal degree in co-relation 1666. Up to 501 conditions per place. [2024-06-28 02:15:22,007 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 47 selfloop transitions, 6 changer transitions 0/63 dead transitions. [2024-06-28 02:15:22,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 63 transitions, 356 flow [2024-06-28 02:15:22,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:15:22,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:15:22,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2024-06-28 02:15:22,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5209302325581395 [2024-06-28 02:15:22,009 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 182 flow. Second operand 5 states and 112 transitions. [2024-06-28 02:15:22,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 63 transitions, 356 flow [2024-06-28 02:15:22,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 63 transitions, 344 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-06-28 02:15:22,013 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 184 flow [2024-06-28 02:15:22,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=184, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2024-06-28 02:15:22,014 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places. [2024-06-28 02:15:22,014 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 184 flow [2024-06-28 02:15:22,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.3) internal successors, (173), 10 states have internal predecessors, (173), 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-06-28 02:15:22,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:15:22,015 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:15:22,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-06-28 02:15:22,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-06-28 02:15:22,229 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 02:15:22,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:15:22,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1907934950, now seen corresponding path program 1 times [2024-06-28 02:15:22,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:15:22,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750751310] [2024-06-28 02:15:22,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:15:22,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:15:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-28 02:15:22,283 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-28 02:15:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-28 02:15:22,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-28 02:15:22,345 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-28 02:15:22,346 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-06-28 02:15:22,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining) [2024-06-28 02:15:22,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining) [2024-06-28 02:15:22,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-06-28 02:15:22,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-06-28 02:15:22,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 02:15:22,349 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:15:22,353 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-28 02:15:22,353 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-28 02:15:22,446 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-28 02:15:22,446 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-28 02:15:22,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.06 02:15:22 BasicIcfg [2024-06-28 02:15:22,447 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-28 02:15:22,448 INFO L158 Benchmark]: Toolchain (without parser) took 5335.19ms. Allocated memory was 186.6MB in the beginning and 262.1MB in the end (delta: 75.5MB). Free memory was 112.1MB in the beginning and 122.4MB in the end (delta: -10.3MB). Peak memory consumption was 67.8MB. Max. memory is 16.1GB. [2024-06-28 02:15:22,448 INFO L158 Benchmark]: Witness Parser took 0.09ms. Allocated memory is still 117.4MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 02:15:22,448 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 186.6MB. Free memory is still 160.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 02:15:22,448 INFO L158 Benchmark]: CACSL2BoogieTranslator took 636.70ms. Allocated memory is still 186.6MB. Free memory was 111.7MB in the beginning and 76.7MB in the end (delta: 35.0MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-06-28 02:15:22,449 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.06ms. Allocated memory is still 186.6MB. Free memory was 76.7MB in the beginning and 74.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-28 02:15:22,449 INFO L158 Benchmark]: Boogie Preprocessor took 41.48ms. Allocated memory is still 186.6MB. Free memory was 74.3MB in the beginning and 71.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-28 02:15:22,449 INFO L158 Benchmark]: RCFGBuilder took 690.68ms. Allocated memory is still 186.6MB. Free memory was 71.7MB in the beginning and 117.2MB in the end (delta: -45.5MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2024-06-28 02:15:22,450 INFO L158 Benchmark]: TraceAbstraction took 3918.35ms. Allocated memory was 186.6MB in the beginning and 262.1MB in the end (delta: 75.5MB). Free memory was 117.2MB in the beginning and 122.4MB in the end (delta: -5.2MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB. [2024-06-28 02:15:22,451 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.09ms. Allocated memory is still 117.4MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.08ms. Allocated memory is still 186.6MB. Free memory is still 160.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 636.70ms. Allocated memory is still 186.6MB. Free memory was 111.7MB in the beginning and 76.7MB in the end (delta: 35.0MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.06ms. Allocated memory is still 186.6MB. Free memory was 76.7MB in the beginning and 74.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.48ms. Allocated memory is still 186.6MB. Free memory was 74.3MB in the beginning and 71.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 690.68ms. Allocated memory is still 186.6MB. Free memory was 71.7MB in the beginning and 117.2MB in the end (delta: -45.5MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3918.35ms. Allocated memory was 186.6MB in the beginning and 262.1MB in the end (delta: 75.5MB). Free memory was 117.2MB in the beginning and 122.4MB in the end (delta: -5.2MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 919]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L1] 0 //@ ghost int m_locked = 0; [L870] 0 int num; [L871] 0 unsigned long total; [L872] 0 int flag; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L874] 0 pthread_cond_t empty, full; [L907] 0 pthread_t t1, t2; [L908] 0 num = 0 [L909] 0 total = 0 [L913] 0 //@ ghost multithreaded = 1; VAL [flag=0, m={3:0}, num=0, t1=2147483646, total=0] [L913] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\old(arg)={0:0}, flag=0, m={3:0}, num=0, t1=2147483646, total=0] [L876] 1 int i; [L877] 1 i = 0 VAL [\old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L879] 1 //@ ghost m_locked = 1; [L914] 0 //@ assert (((!multithreaded || ((0 <= num) && (num <= 1))) && (!multithreaded || (m_locked || ((0 <= num) && (num <= 1))))) && (!multithreaded || ((flag == 0) || (flag == 1)))); [L914] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, t1=2147483646, t2=2147483647, total=0] [L890] 2 int j; [L891] 2 j = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=1, total=0] [L883] 1 //@ ghost m_locked = 0; [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=1, total=0] [L893] 2 //@ ghost m_locked = 1; [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, total=0] [L898] 2 //@ ghost m_locked = 0; [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, total=0] [L879] 1 //@ ghost m_locked = 1; [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=1, total=0] [L883] 1 //@ ghost m_locked = 0; [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=1, total=0] [L893] 2 //@ ghost m_locked = 1; [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=0, total=1] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=0, total=1] [L898] 2 //@ ghost m_locked = 0; [L879] 1 //@ ghost m_locked = 1; [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=0, total=1] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=1, total=1] [L883] 1 //@ ghost m_locked = 0; [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, total=1] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, total=1] [L893] 2 //@ ghost m_locked = 1; [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=0, total=3] [L878] COND FALSE 1 !(i < 3) [L887] 1 return ((void *)0); [L915] 0 //@ assert (((!multithreaded || ((0 <= num) && (num <= 1))) && (!multithreaded || (m_locked || ((0 <= num) && (num <= 1))))) && (!multithreaded || ((flag == 0) || (flag == 1)))); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=0, t1=2147483646, t2=2147483647, total=3] [L915] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=0, t1=2147483646, t2=2147483647, total=3] [L898] 2 //@ ghost m_locked = 0; [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=3, m={3:0}, num=0, total=3] [L892] COND FALSE 2 !(j < 3) [L902] 2 total = total + j [L903] 2 flag = 1 [L904] 2 return ((void *)0); [L916] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=2147483646, t2=2147483647, total=6] [L917] COND TRUE 0 \read(flag) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=2147483646, t2=2147483647, total=6] [L918] COND FALSE 0 !(total != ((3 * (3 + 1)) / 2)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=2147483646, t2=2147483647, total=6] [L919] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=2147483646, t2=2147483647, total=6] - UnprovableResult [Line: 914]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 915]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 914]: 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: 913]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 60 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.7s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 262 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 237 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 544 IncrementalHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 4 mSDtfsCounter, 544 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184occurred in iteration=6, InterpolantAutomatonStates: 23, 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.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 235 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 883 SizeOfPredicates, 2 NumberOfNonLiveVariables, 520 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 89/115 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 proved your program to be incorrect! [2024-06-28 02:15:22,486 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE