./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-05-07_14-17-48.files/protection/arithmetic_prog_bad.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 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-05-07_14-17-48.files/protection/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-wip.fs.witness-ghost-b44c828-m [2024-05-12 13:45:12,494 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 13:45:12,562 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 13:45:12,588 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 13:45:12,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 13:45:12,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 13:45:12,648 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 13:45:12,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 13:45:12,649 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 13:45:12,653 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 13:45:12,654 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 13:45:12,654 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 13:45:12,654 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 13:45:12,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 13:45:12,656 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 13:45:12,656 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 13:45:12,656 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 13:45:12,656 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 13:45:12,656 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 13:45:12,657 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 13:45:12,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 13:45:12,657 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 13:45:12,657 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 13:45:12,657 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 13:45:12,658 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 13:45:12,658 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 13:45:12,658 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 13:45:12,658 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 13:45:12,658 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 13:45:12,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 13:45:12,658 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 13:45:12,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 13:45:12,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 13:45:12,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 13:45:12,659 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 13:45:12,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 13:45:12,659 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 13:45:12,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 13:45:12,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 13:45:12,660 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 13:45:12,660 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 13:45:12,661 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 13:45:12,661 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 13:45:12,662 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-05-12 13:45:12,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 13:45:12,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 13:45:12,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 13:45:12,907 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 13:45:12,907 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 13:45:12,908 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/protection/arithmetic_prog_bad.yml/witness.yml [2024-05-12 13:45:13,045 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 13:45:13,045 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 13:45:13,046 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-05-12 13:45:14,125 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 13:45:14,359 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 13:45:14,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2024-05-12 13:45:14,377 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de1a0c585/f20cfd399f744e2b88b18d254a42c648/FLAG17d6abb62 [2024-05-12 13:45:14,389 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de1a0c585/f20cfd399f744e2b88b18d254a42c648 [2024-05-12 13:45:14,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 13:45:14,391 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 13:45:14,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 13:45:14,392 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 13:45:14,396 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 13:45:14,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 01:45:13" (1/2) ... [2024-05-12 13:45:14,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5755010d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:45:14, skipping insertion in model container [2024-05-12 13:45:14,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 01:45:13" (1/2) ... [2024-05-12 13:45:14,400 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@14f52066 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 01:45:14, skipping insertion in model container [2024-05-12 13:45:14,401 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 01:45:14" (2/2) ... [2024-05-12 13:45:14,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5755010d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:45:14, skipping insertion in model container [2024-05-12 13:45:14,402 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 01:45:14" (2/2) ... [2024-05-12 13:45:14,402 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 13:45:14,439 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 13:45:14,440 INFO L97 edCorrectnessWitness]: Location invariant before [L915-L915] (! multithreaded || ((0 <= flag && flag <= 1) && (flag == 0 || flag == 1))) && (! multithreaded || (0 <= num && num <= 1)) [2024-05-12 13:45:14,441 INFO L97 edCorrectnessWitness]: Location invariant before [L914-L914] (! multithreaded || ((0 <= flag && flag <= 1) && (flag == 0 || flag == 1))) && (! multithreaded || (0 <= num && num <= 1)) [2024-05-12 13:45:14,441 INFO L103 edCorrectnessWitness]: ghost_variable m_locked = 0 [2024-05-12 13:45:14,441 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 13:45:14,441 INFO L106 edCorrectnessWitness]: ghost_update [L913-L913] multithreaded = 1; [2024-05-12 13:45:14,441 INFO L106 edCorrectnessWitness]: ghost_update [L879-L879] m_locked = 1; [2024-05-12 13:45:14,441 INFO L106 edCorrectnessWitness]: ghost_update [L895-L895] m_locked = 0; [2024-05-12 13:45:14,441 INFO L106 edCorrectnessWitness]: ghost_update [L895-L895] m_locked = 1; [2024-05-12 13:45:14,441 INFO L106 edCorrectnessWitness]: ghost_update [L881-L881] m_locked = 0; [2024-05-12 13:45:14,442 INFO L106 edCorrectnessWitness]: ghost_update [L881-L881] m_locked = 1; [2024-05-12 13:45:14,442 INFO L106 edCorrectnessWitness]: ghost_update [L883-L883] m_locked = 0; [2024-05-12 13:45:14,442 INFO L106 edCorrectnessWitness]: ghost_update [L893-L893] m_locked = 1; [2024-05-12 13:45:14,442 INFO L106 edCorrectnessWitness]: ghost_update [L898-L898] m_locked = 0; [2024-05-12 13:45:14,464 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 13:45:14,792 WARN L246 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-05-12 13:45:14,803 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 13:45:14,815 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-05-12 13:45:14,886 WARN L246 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-05-12 13:45:14,886 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 13:45:14,940 INFO L206 MainTranslator]: Completed translation [2024-05-12 13:45:14,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:45:14 WrapperNode [2024-05-12 13:45:14,941 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 13:45:14,941 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 13:45:14,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 13:45:14,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 13:45:14,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:45:14" (1/1) ... [2024-05-12 13:45:14,957 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:45:14" (1/1) ... [2024-05-12 13:45:14,972 INFO L138 Inliner]: procedures = 244, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 88 [2024-05-12 13:45:14,973 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 13:45:14,973 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 13:45:14,973 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 13:45:14,974 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 13:45:14,981 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:45:14" (1/1) ... [2024-05-12 13:45:14,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:45:14" (1/1) ... [2024-05-12 13:45:14,985 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:45:14" (1/1) ... [2024-05-12 13:45:14,995 INFO L175 MemorySlicer]: Split 15 memory accesses to 5 slices as follows [2, 1, 2, 8, 2]. 53 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 0, 8, 0]. The 2 writes are split as follows [0, 0, 1, 0, 1]. [2024-05-12 13:45:14,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:45:14" (1/1) ... [2024-05-12 13:45:14,995 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:45:14" (1/1) ... [2024-05-12 13:45:15,001 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:45:14" (1/1) ... [2024-05-12 13:45:15,003 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:45:14" (1/1) ... [2024-05-12 13:45:15,005 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:45:14" (1/1) ... [2024-05-12 13:45:15,006 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:45:14" (1/1) ... [2024-05-12 13:45:15,008 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 13:45:15,009 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 13:45:15,009 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 13:45:15,009 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 13:45:15,010 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:45:14" (1/1) ... [2024-05-12 13:45:15,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 13:45:15,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 13:45:15,050 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-05-12 13:45:15,055 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-05-12 13:45:15,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 13:45:15,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 13:45:15,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-05-12 13:45:15,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-05-12 13:45:15,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-05-12 13:45:15,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-05-12 13:45:15,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-05-12 13:45:15,093 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-05-12 13:45:15,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-05-12 13:45:15,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-05-12 13:45:15,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-05-12 13:45:15,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-05-12 13:45:15,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-05-12 13:45:15,094 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-12 13:45:15,094 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-12 13:45:15,095 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-12 13:45:15,095 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-12 13:45:15,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 13:45:15,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 13:45:15,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 13:45:15,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-05-12 13:45:15,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-05-12 13:45:15,096 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-05-12 13:45:15,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 13:45:15,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 13:45:15,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 13:45:15,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 13:45:15,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-05-12 13:45:15,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-05-12 13:45:15,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 13:45:15,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 13:45:15,100 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 13:45:15,219 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 13:45:15,221 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 13:45:15,457 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 13:45:15,457 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 13:45:15,653 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 13:45:15,653 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-05-12 13:45:15,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 01:45:15 BoogieIcfgContainer [2024-05-12 13:45:15,654 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 13:45:15,655 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 13:45:15,655 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 13:45:15,658 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 13:45:15,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 01:45:13" (1/4) ... [2024-05-12 13:45:15,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f31b70 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 01:45:15, skipping insertion in model container [2024-05-12 13:45:15,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 01:45:14" (2/4) ... [2024-05-12 13:45:15,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f31b70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 01:45:15, skipping insertion in model container [2024-05-12 13:45:15,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 01:45:14" (3/4) ... [2024-05-12 13:45:15,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f31b70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 01:45:15, skipping insertion in model container [2024-05-12 13:45:15,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 01:45:15" (4/4) ... [2024-05-12 13:45:15,660 INFO L112 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2024-05-12 13:45:15,673 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 13:45:15,673 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-05-12 13:45:15,673 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 13:45:15,700 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-12 13:45:15,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 46 transitions, 106 flow [2024-05-12 13:45:15,753 INFO L124 PetriNetUnfolderBase]: 6/44 cut-off events. [2024-05-12 13:45:15,754 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-05-12 13:45:15,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 44 events. 6/44 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 73 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 31. Up to 3 conditions per place. [2024-05-12 13:45:15,760 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 46 transitions, 106 flow [2024-05-12 13:45:15,763 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 40 transitions, 92 flow [2024-05-12 13:45:15,769 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 13:45:15,776 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;@363423a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 13:45:15,776 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-05-12 13:45:15,783 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 13:45:15,784 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-05-12 13:45:15,784 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 13:45:15,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:45:15,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 13:45:15,785 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-05-12 13:45:15,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:45:15,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1334846596, now seen corresponding path program 1 times [2024-05-12 13:45:15,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:45:15,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785695169] [2024-05-12 13:45:15,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:45:15,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:45:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:45:16,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:45:16,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:45:16,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785695169] [2024-05-12 13:45:16,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785695169] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:45:16,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:45:16,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 13:45:16,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749747456] [2024-05-12 13:45:16,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:45:16,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 13:45:16,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:45:16,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 13:45:16,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 13:45:16,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-05-12 13:45:16,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-05-12 13:45:16,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:45:16,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-05-12 13:45:16,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:45:16,504 INFO L124 PetriNetUnfolderBase]: 707/1168 cut-off events. [2024-05-12 13:45:16,504 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-05-12 13:45:16,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2287 conditions, 1168 events. 707/1168 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5132 event pairs, 216 based on Foata normal form. 16/1050 useless extension candidates. Maximal degree in co-relation 2134. Up to 910 conditions per place. [2024-05-12 13:45:16,511 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 45 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2024-05-12 13:45:16,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 226 flow [2024-05-12 13:45:16,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 13:45:16,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 13:45:16,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-05-12 13:45:16,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6376811594202898 [2024-05-12 13:45:16,522 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 92 flow. Second operand 3 states and 88 transitions. [2024-05-12 13:45:16,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 226 flow [2024-05-12 13:45:16,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 56 transitions, 214 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-05-12 13:45:16,526 INFO L231 Difference]: Finished difference. Result has 42 places, 42 transitions, 109 flow [2024-05-12 13:45:16,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=42, PETRI_TRANSITIONS=42} [2024-05-12 13:45:16,530 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -1 predicate places. [2024-05-12 13:45:16,530 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 42 transitions, 109 flow [2024-05-12 13:45:16,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-05-12 13:45:16,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:45:16,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:45:16,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 13:45:16,531 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-05-12 13:45:16,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:45:16,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1119963223, now seen corresponding path program 1 times [2024-05-12 13:45:16,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:45:16,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403206147] [2024-05-12 13:45:16,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:45:16,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:45:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:45:16,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:45:16,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:45:16,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403206147] [2024-05-12 13:45:16,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403206147] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:45:16,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:45:16,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 13:45:16,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826891569] [2024-05-12 13:45:16,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:45:16,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 13:45:16,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:45:16,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 13:45:16,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 13:45:16,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-05-12 13:45:16,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 42 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-05-12 13:45:16,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:45:16,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-05-12 13:45:16,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:45:16,822 INFO L124 PetriNetUnfolderBase]: 801/1415 cut-off events. [2024-05-12 13:45:16,822 INFO L125 PetriNetUnfolderBase]: For 246/246 co-relation queries the response was YES. [2024-05-12 13:45:16,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2982 conditions, 1415 events. 801/1415 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 6532 event pairs, 260 based on Foata normal form. 189/1586 useless extension candidates. Maximal degree in co-relation 865. Up to 622 conditions per place. [2024-05-12 13:45:16,828 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 60 selfloop transitions, 7 changer transitions 0/74 dead transitions. [2024-05-12 13:45:16,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 74 transitions, 314 flow [2024-05-12 13:45:16,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 13:45:16,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 13:45:16,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2024-05-12 13:45:16,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6304347826086957 [2024-05-12 13:45:16,830 INFO L175 Difference]: Start difference. First operand has 42 places, 42 transitions, 109 flow. Second operand 4 states and 116 transitions. [2024-05-12 13:45:16,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 74 transitions, 314 flow [2024-05-12 13:45:16,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 74 transitions, 311 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 13:45:16,833 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 146 flow [2024-05-12 13:45:16,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2024-05-12 13:45:16,833 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2024-05-12 13:45:16,834 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 146 flow [2024-05-12 13:45:16,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-05-12 13:45:16,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:45:16,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:45:16,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 13:45:16,834 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-05-12 13:45:16,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:45:16,835 INFO L85 PathProgramCache]: Analyzing trace with hash -578682844, now seen corresponding path program 1 times [2024-05-12 13:45:16,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:45:16,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068754067] [2024-05-12 13:45:16,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:45:16,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:45:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:45:16,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:45:16,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:45:16,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068754067] [2024-05-12 13:45:16,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068754067] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:45:16,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 13:45:16,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 13:45:16,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266979075] [2024-05-12 13:45:16,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:45:16,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 13:45:16,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:45:16,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 13:45:16,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 13:45:16,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-05-12 13:45:16,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-05-12 13:45:16,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:45:16,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-05-12 13:45:16,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:45:17,028 INFO L124 PetriNetUnfolderBase]: 973/1837 cut-off events. [2024-05-12 13:45:17,028 INFO L125 PetriNetUnfolderBase]: For 944/962 co-relation queries the response was YES. [2024-05-12 13:45:17,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4139 conditions, 1837 events. 973/1837 cut-off events. For 944/962 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 9301 event pairs, 463 based on Foata normal form. 46/1857 useless extension candidates. Maximal degree in co-relation 841. Up to 987 conditions per place. [2024-05-12 13:45:17,037 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 48 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2024-05-12 13:45:17,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 61 transitions, 296 flow [2024-05-12 13:45:17,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 13:45:17,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 13:45:17,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2024-05-12 13:45:17,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6884057971014492 [2024-05-12 13:45:17,039 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 146 flow. Second operand 3 states and 95 transitions. [2024-05-12 13:45:17,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 61 transitions, 296 flow [2024-05-12 13:45:17,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 61 transitions, 293 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 13:45:17,041 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 148 flow [2024-05-12 13:45:17,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2024-05-12 13:45:17,041 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2024-05-12 13:45:17,042 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 148 flow [2024-05-12 13:45:17,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-05-12 13:45:17,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:45:17,042 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-05-12 13:45:17,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 13:45:17,042 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-05-12 13:45:17,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:45:17,043 INFO L85 PathProgramCache]: Analyzing trace with hash 148777803, now seen corresponding path program 1 times [2024-05-12 13:45:17,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:45:17,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436251369] [2024-05-12 13:45:17,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:45:17,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:45:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:45:17,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:45:17,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:45:17,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436251369] [2024-05-12 13:45:17,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436251369] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 13:45:17,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52663489] [2024-05-12 13:45:17,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:45:17,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 13:45:17,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 13:45:17,106 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-05-12 13:45:17,132 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-05-12 13:45:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:45:17,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 3 conjunts are in the unsatisfiable core [2024-05-12 13:45:17,216 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 13:45:17,246 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 7 [2024-05-12 13:45:17,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:45:17,267 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-12 13:45:17,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52663489] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 13:45:17,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-12 13:45:17,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-05-12 13:45:17,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185736237] [2024-05-12 13:45:17,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 13:45:17,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 13:45:17,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:45:17,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 13:45:17,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 13:45:17,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-05-12 13:45:17,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-05-12 13:45:17,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:45:17,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-05-12 13:45:17,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:45:17,383 INFO L124 PetriNetUnfolderBase]: 544/1155 cut-off events. [2024-05-12 13:45:17,383 INFO L125 PetriNetUnfolderBase]: For 608/614 co-relation queries the response was YES. [2024-05-12 13:45:17,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2615 conditions, 1155 events. 544/1155 cut-off events. For 608/614 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5367 event pairs, 219 based on Foata normal form. 69/1217 useless extension candidates. Maximal degree in co-relation 475. Up to 489 conditions per place. [2024-05-12 13:45:17,388 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 39 selfloop transitions, 8 changer transitions 0/58 dead transitions. [2024-05-12 13:45:17,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 292 flow [2024-05-12 13:45:17,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 13:45:17,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 13:45:17,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-05-12 13:45:17,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6739130434782609 [2024-05-12 13:45:17,391 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 148 flow. Second operand 3 states and 93 transitions. [2024-05-12 13:45:17,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 292 flow [2024-05-12 13:45:17,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 13:45:17,396 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 162 flow [2024-05-12 13:45:17,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2024-05-12 13:45:17,398 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 5 predicate places. [2024-05-12 13:45:17,398 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 162 flow [2024-05-12 13:45:17,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-05-12 13:45:17,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:45:17,398 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, 1] [2024-05-12 13:45:17,412 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-05-12 13:45:17,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 13:45:17,613 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-05-12 13:45:17,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:45:17,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1542486534, now seen corresponding path program 1 times [2024-05-12 13:45:17,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:45:17,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706249980] [2024-05-12 13:45:17,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:45:17,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:45:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:45:17,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:45:17,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:45:17,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706249980] [2024-05-12 13:45:17,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706249980] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 13:45:17,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248004014] [2024-05-12 13:45:17,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:45:17,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 13:45:17,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 13:45:17,664 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-05-12 13:45:17,666 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-05-12 13:45:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:45:17,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 3 conjunts are in the unsatisfiable core [2024-05-12 13:45:17,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 13:45:17,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:45:17,802 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 13:45:17,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 13:45:17,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248004014] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 13:45:17,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 13:45:17,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-05-12 13:45:17,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447679914] [2024-05-12 13:45:17,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 13:45:17,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 13:45:17,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:45:17,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 13:45:17,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-05-12 13:45:17,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2024-05-12 13:45:17,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 162 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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-05-12 13:45:17,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:45:17,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2024-05-12 13:45:17,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:45:18,067 INFO L124 PetriNetUnfolderBase]: 1025/1999 cut-off events. [2024-05-12 13:45:18,067 INFO L125 PetriNetUnfolderBase]: For 1382/1406 co-relation queries the response was YES. [2024-05-12 13:45:18,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5016 conditions, 1999 events. 1025/1999 cut-off events. For 1382/1406 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9214 event pairs, 109 based on Foata normal form. 110/2105 useless extension candidates. Maximal degree in co-relation 1044. Up to 519 conditions per place. [2024-05-12 13:45:18,075 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 74 selfloop transitions, 5 changer transitions 3/92 dead transitions. [2024-05-12 13:45:18,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 92 transitions, 505 flow [2024-05-12 13:45:18,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 13:45:18,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 13:45:18,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions. [2024-05-12 13:45:18,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6739130434782609 [2024-05-12 13:45:18,077 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 162 flow. Second operand 5 states and 155 transitions. [2024-05-12 13:45:18,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 92 transitions, 505 flow [2024-05-12 13:45:18,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 92 transitions, 477 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 13:45:18,081 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 188 flow [2024-05-12 13:45:18,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2024-05-12 13:45:18,082 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2024-05-12 13:45:18,082 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 188 flow [2024-05-12 13:45:18,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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-05-12 13:45:18,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:45:18,083 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, 1] [2024-05-12 13:45:18,098 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-05-12 13:45:18,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 13:45:18,295 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-05-12 13:45:18,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:45:18,295 INFO L85 PathProgramCache]: Analyzing trace with hash 834080158, now seen corresponding path program 1 times [2024-05-12 13:45:18,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:45:18,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152594005] [2024-05-12 13:45:18,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:45:18,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:45:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:45:18,499 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-12 13:45:18,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 13:45:18,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152594005] [2024-05-12 13:45:18,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152594005] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 13:45:18,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577220643] [2024-05-12 13:45:18,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:45:18,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 13:45:18,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 13:45:18,529 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 13:45:18,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-12 13:45:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 13:45:18,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 17 conjunts are in the unsatisfiable core [2024-05-12 13:45:18,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 13:45:18,736 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-05-12 13:45:18,736 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 13:45:18,898 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-05-12 13:45:18,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577220643] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 13:45:18,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 13:45:18,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 12 [2024-05-12 13:45:18,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33517920] [2024-05-12 13:45:18,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 13:45:18,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-12 13:45:18,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 13:45:18,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-12 13:45:18,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-05-12 13:45:18,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-05-12 13:45:18,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 188 flow. Second operand has 13 states, 13 states have (on average 16.76923076923077) internal successors, (218), 13 states have internal predecessors, (218), 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-05-12 13:45:18,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 13:45:18,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-05-12 13:45:18,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 13:45:19,144 INFO L124 PetriNetUnfolderBase]: 900/1809 cut-off events. [2024-05-12 13:45:19,145 INFO L125 PetriNetUnfolderBase]: For 1965/1965 co-relation queries the response was YES. [2024-05-12 13:45:19,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4699 conditions, 1809 events. 900/1809 cut-off events. For 1965/1965 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 8291 event pairs, 340 based on Foata normal form. 26/1827 useless extension candidates. Maximal degree in co-relation 2589. Up to 793 conditions per place. [2024-05-12 13:45:19,152 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 54 selfloop transitions, 7 changer transitions 0/70 dead transitions. [2024-05-12 13:45:19,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 70 transitions, 386 flow [2024-05-12 13:45:19,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 13:45:19,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 13:45:19,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2024-05-12 13:45:19,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45652173913043476 [2024-05-12 13:45:19,153 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 188 flow. Second operand 6 states and 126 transitions. [2024-05-12 13:45:19,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 70 transitions, 386 flow [2024-05-12 13:45:19,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 70 transitions, 374 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-05-12 13:45:19,156 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 192 flow [2024-05-12 13:45:19,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2024-05-12 13:45:19,156 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 15 predicate places. [2024-05-12 13:45:19,156 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 192 flow [2024-05-12 13:45:19,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 16.76923076923077) internal successors, (218), 13 states have internal predecessors, (218), 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-05-12 13:45:19,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 13:45:19,157 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, 1, 1, 1] [2024-05-12 13:45:19,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-05-12 13:45:19,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 13:45:19,369 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-05-12 13:45:19,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 13:45:19,369 INFO L85 PathProgramCache]: Analyzing trace with hash 978494222, now seen corresponding path program 1 times [2024-05-12 13:45:19,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 13:45:19,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647406778] [2024-05-12 13:45:19,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 13:45:19,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 13:45:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-12 13:45:19,418 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-12 13:45:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-12 13:45:19,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-12 13:45:19,476 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-12 13:45:19,477 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-05-12 13:45:19,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining) [2024-05-12 13:45:19,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining) [2024-05-12 13:45:19,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-05-12 13:45:19,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-05-12 13:45:19,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 13:45:19,479 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-05-12 13:45:19,482 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-12 13:45:19,483 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-12 13:45:19,564 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-05-12 13:45:19,569 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-05-12 13:45:19,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.05 01:45:19 BasicIcfg [2024-05-12 13:45:19,570 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-12 13:45:19,571 INFO L158 Benchmark]: Toolchain (without parser) took 5179.28ms. Allocated memory was 224.4MB in the beginning and 331.4MB in the end (delta: 107.0MB). Free memory was 192.2MB in the beginning and 191.6MB in the end (delta: 650.7kB). Peak memory consumption was 107.8MB. Max. memory is 16.1GB. [2024-05-12 13:45:19,572 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 134.2MB. Free memory was 99.9MB in the beginning and 99.8MB in the end (delta: 46.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 13:45:19,573 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 134.2MB. Free memory is still 107.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 13:45:19,575 INFO L158 Benchmark]: CACSL2BoogieTranslator took 549.02ms. Allocated memory is still 224.4MB. Free memory was 192.0MB in the beginning and 162.2MB in the end (delta: 29.8MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2024-05-12 13:45:19,576 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.45ms. Allocated memory is still 224.4MB. Free memory was 162.2MB in the beginning and 160.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-05-12 13:45:19,576 INFO L158 Benchmark]: Boogie Preprocessor took 34.84ms. Allocated memory is still 224.4MB. Free memory was 160.1MB in the beginning and 157.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-05-12 13:45:19,576 INFO L158 Benchmark]: RCFGBuilder took 645.34ms. Allocated memory is still 224.4MB. Free memory was 157.0MB in the beginning and 183.0MB in the end (delta: -26.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-05-12 13:45:19,576 INFO L158 Benchmark]: TraceAbstraction took 3914.33ms. Allocated memory was 224.4MB in the beginning and 331.4MB in the end (delta: 107.0MB). Free memory was 183.0MB in the beginning and 191.6MB in the end (delta: -8.6MB). Peak memory consumption was 99.4MB. Max. memory is 16.1GB. [2024-05-12 13:45:19,577 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.16ms. Allocated memory is still 134.2MB. Free memory was 99.9MB in the beginning and 99.8MB in the end (delta: 46.5kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.13ms. Allocated memory is still 134.2MB. Free memory is still 107.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 549.02ms. Allocated memory is still 224.4MB. Free memory was 192.0MB in the beginning and 162.2MB in the end (delta: 29.8MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.45ms. Allocated memory is still 224.4MB. Free memory was 162.2MB in the beginning and 160.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.84ms. Allocated memory is still 224.4MB. Free memory was 160.1MB in the beginning and 157.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 645.34ms. Allocated memory is still 224.4MB. Free memory was 157.0MB in the beginning and 183.0MB in the end (delta: -26.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3914.33ms. Allocated memory was 224.4MB in the beginning and 331.4MB in the end (delta: 107.0MB). Free memory was 183.0MB in the beginning and 191.6MB in the end (delta: -8.6MB). Peak memory consumption was 99.4MB. 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 m_locked = 0; [L1] 0 //@ ghost int multithreaded = 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; [L913] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\old(arg)={0:0}, flag=0, m={3:0}, num=0, t1={6:0}, t2={5:0}, 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 <= flag) && (flag <= 1)) && ((flag == 0) || (flag == 1)))) && (!multithreaded || ((0 <= num) && (num <= 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={6:0}, t2={5:0}, 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] [L892] COND TRUE 2 j < 3 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] [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] [L915] 0 //@ assert ((!multithreaded || (((0 <= flag) && (flag <= 1)) && ((flag == 0) || (flag == 1)))) && (!multithreaded || ((0 <= num) && (num <= 1)))); [L915] 0 \read(t1) 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] [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=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] [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] [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=2, j=1, m={3:0}, num=0, total=1] [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] 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={6:0}, t2={5:0}, total=3] [L916] 0 \read(t2) 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, 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={6:0}, t2={5:0}, 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={6:0}, t2={5:0}, 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={6:0}, t2={5:0}, 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={6:0}, t2={5:0}, 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, 63 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.8s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 274 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 256 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 710 IncrementalHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 9 mSDtfsCounter, 710 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192occurred in iteration=6, InterpolantAutomatonStates: 24, 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, 0.9s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 271 ConstructedInterpolants, 0 QuantifiedInterpolants, 1149 SizeOfPredicates, 1 NumberOfNonLiveVariables, 843 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 98/116 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-05-12 13:45:19,616 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