./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/bench-exp2x6.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f 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/weaver/bench-exp2x6.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/bench-exp2x6.wvr.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-dev-a340643-m [2024-01-27 14:50:05,744 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 14:50:05,806 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 14:50:05,811 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 14:50:05,811 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 14:50:05,834 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 14:50:05,835 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 14:50:05,835 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 14:50:05,836 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 14:50:05,839 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 14:50:05,839 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 14:50:05,840 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 14:50:05,840 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 14:50:05,841 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 14:50:05,842 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 14:50:05,842 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 14:50:05,842 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 14:50:05,842 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 14:50:05,843 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 14:50:05,843 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 14:50:05,843 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 14:50:05,843 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 14:50:05,844 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 14:50:05,844 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 14:50:05,844 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 14:50:05,844 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 14:50:05,844 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 14:50:05,845 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 14:50:05,845 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 14:50:05,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 14:50:05,846 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 14:50:05,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 14:50:05,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 14:50:05,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 14:50:05,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 14:50:05,847 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 14:50:05,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 14:50:05,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 14:50:05,848 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 14:50:05,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 14:50:05,848 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 14:50:05,848 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 14:50:05,848 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 14:50:05,849 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-01-27 14:50:06,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 14:50:06,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 14:50:06,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 14:50:06,086 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-27 14:50:06,087 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-27 14:50:06,087 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/bench-exp2x6.wvr.yml/witness.yml [2024-01-27 14:50:06,241 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 14:50:06,242 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 14:50:06,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c [2024-01-27 14:50:07,216 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 14:50:07,423 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 14:50:07,423 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c [2024-01-27 14:50:07,430 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/816c760d2/88d59153e86d4f229046a9f2b1659c10/FLAG2c35bdc75 [2024-01-27 14:50:07,446 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/816c760d2/88d59153e86d4f229046a9f2b1659c10 [2024-01-27 14:50:07,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 14:50:07,450 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-27 14:50:07,452 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 14:50:07,452 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 14:50:07,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 14:50:07,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 02:50:06" (1/2) ... [2024-01-27 14:50:07,461 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44a248b7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:50:07, skipping insertion in model container [2024-01-27 14:50:07,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 02:50:06" (1/2) ... [2024-01-27 14:50:07,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3954b689 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:50:07, skipping insertion in model container [2024-01-27 14:50:07,462 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 02:50:07" (2/2) ... [2024-01-27 14:50:07,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44a248b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:07, skipping insertion in model container [2024-01-27 14:50:07,464 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 02:50:07" (2/2) ... [2024-01-27 14:50:07,464 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-27 14:50:07,488 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-27 14:50:07,489 INFO L98 nessWitnessExtractor]: Location invariant before [L45-L45] (unsigned long )_argptr == 0UL [2024-01-27 14:50:07,489 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (unsigned long )_argptr == 0UL [2024-01-27 14:50:07,490 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] (unsigned long )_argptr == 0UL [2024-01-27 14:50:07,490 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] (unsigned long )_argptr == 0UL [2024-01-27 14:50:07,490 INFO L98 nessWitnessExtractor]: Location invariant after [L38-L43] n == 0U [2024-01-27 14:50:07,490 INFO L98 nessWitnessExtractor]: Loop invariant at [L38-L43] (unsigned long )_argptr == 0UL [2024-01-27 14:50:07,490 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] (unsigned long )_argptr == 0UL [2024-01-27 14:50:07,490 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-01-27 14:50:07,490 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] (unsigned long )_argptr == 0UL [2024-01-27 14:50:07,491 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] n == 0U [2024-01-27 14:50:07,491 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] x3 == 0U [2024-01-27 14:50:07,491 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] x4 == 0U [2024-01-27 14:50:07,491 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] (long long )x1 + (long long )x3 >= 0LL [2024-01-27 14:50:07,491 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] x1 == 0U [2024-01-27 14:50:07,491 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] n == 0U [2024-01-27 14:50:07,491 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] x3 == 0U [2024-01-27 14:50:07,492 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] (long long )x1 - (long long )x3 >= 0LL [2024-01-27 14:50:07,492 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] (0LL - (long long )x1) - (long long )x3 >= 0LL [2024-01-27 14:50:07,492 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] (0LL - (long long )x1) + (long long )x3 >= 0LL [2024-01-27 14:50:07,492 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] x2 == 0U [2024-01-27 14:50:07,492 INFO L98 nessWitnessExtractor]: Location invariant before [L85-L85] x4 == 0U [2024-01-27 14:50:07,493 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] x3 == 0U [2024-01-27 14:50:07,493 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] x2 == 0U [2024-01-27 14:50:07,493 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] n == 0U [2024-01-27 14:50:07,493 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] x4 == 0U [2024-01-27 14:50:07,493 INFO L98 nessWitnessExtractor]: Loop invariant at [L71-L76] (unsigned long )_argptr == 0UL [2024-01-27 14:50:07,493 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (unsigned long )_argptr == 0UL [2024-01-27 14:50:07,494 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (unsigned long )_argptr == 0UL [2024-01-27 14:50:07,494 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] (unsigned long )_argptr == 0UL [2024-01-27 14:50:07,494 INFO L98 nessWitnessExtractor]: Location invariant before [L39-L39] (unsigned long )_argptr == 0UL [2024-01-27 14:50:07,494 INFO L98 nessWitnessExtractor]: Location invariant before [L42-L42] (unsigned long )_argptr == 0UL [2024-01-27 14:50:07,494 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] n == 0U [2024-01-27 14:50:07,494 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] x4 == 0U [2024-01-27 14:50:07,494 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-27 14:50:07,494 INFO L98 nessWitnessExtractor]: Location invariant before [L89-L89] n == 0U [2024-01-27 14:50:07,495 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] (unsigned long )_argptr == 0UL [2024-01-27 14:50:07,495 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (unsigned long )_argptr == 0UL [2024-01-27 14:50:07,495 INFO L98 nessWitnessExtractor]: Loop invariant at [L49-L54] (unsigned long )_argptr == 0UL [2024-01-27 14:50:07,497 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] (unsigned long )_argptr == 0UL [2024-01-27 14:50:07,497 INFO L98 nessWitnessExtractor]: Loop invariant at [L60-L65] (unsigned long )_argptr == 0UL [2024-01-27 14:50:07,497 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (unsigned long )_argptr == 0UL [2024-01-27 14:50:07,497 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] (unsigned long )_argptr == 0UL [2024-01-27 14:50:07,497 INFO L98 nessWitnessExtractor]: Location invariant before [L40-L40] (unsigned long )_argptr == 0UL [2024-01-27 14:50:07,497 INFO L98 nessWitnessExtractor]: Location invariant before [L41-L41] (unsigned long )_argptr == 0UL [2024-01-27 14:50:07,514 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 14:50:07,707 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c[2505,2518] [2024-01-27 14:50:07,715 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 14:50:07,733 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 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 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 Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-27 14:50:07,803 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c[2505,2518] [2024-01-27 14:50:07,808 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 14:50:07,819 INFO L206 MainTranslator]: Completed translation [2024-01-27 14:50:07,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:07 WrapperNode [2024-01-27 14:50:07,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 14:50:07,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 14:50:07,827 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 14:50:07,828 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 14:50:07,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:07" (1/1) ... [2024-01-27 14:50:07,849 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:07" (1/1) ... [2024-01-27 14:50:07,875 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 114 [2024-01-27 14:50:07,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 14:50:07,876 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 14:50:07,876 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 14:50:07,877 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 14:50:07,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:07" (1/1) ... [2024-01-27 14:50:07,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:07" (1/1) ... [2024-01-27 14:50:07,898 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:07" (1/1) ... [2024-01-27 14:50:07,923 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-01-27 14:50:07,923 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:07" (1/1) ... [2024-01-27 14:50:07,924 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:07" (1/1) ... [2024-01-27 14:50:07,935 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:07" (1/1) ... [2024-01-27 14:50:07,941 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:07" (1/1) ... [2024-01-27 14:50:07,945 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:07" (1/1) ... [2024-01-27 14:50:07,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:07" (1/1) ... [2024-01-27 14:50:07,949 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 14:50:07,951 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 14:50:07,951 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 14:50:07,951 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 14:50:07,952 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:07" (1/1) ... [2024-01-27 14:50:07,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 14:50:07,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 14:50:07,980 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-01-27 14:50:07,997 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-01-27 14:50:08,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 14:50:08,023 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 14:50:08,024 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 14:50:08,024 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 14:50:08,024 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 14:50:08,024 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-27 14:50:08,024 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-27 14:50:08,024 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-01-27 14:50:08,024 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-01-27 14:50:08,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 14:50:08,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 14:50:08,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 14:50:08,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 14:50:08,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 14:50:08,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 14:50:08,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 14:50:08,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 14:50:08,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 14:50:08,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 14:50:08,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 14:50:08,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 14:50:08,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 14:50:08,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 14:50:08,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 14:50:08,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 14:50:08,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 14:50:08,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-27 14:50:08,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 14:50:08,030 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 14:50:08,133 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 14:50:08,134 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 14:50:08,431 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 14:50:08,442 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 14:50:08,529 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 14:50:08,530 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-27 14:50:08,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 02:50:08 BoogieIcfgContainer [2024-01-27 14:50:08,530 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 14:50:08,531 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 14:50:08,532 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 14:50:08,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 14:50:08,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 02:50:06" (1/4) ... [2024-01-27 14:50:08,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484e16a8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.01 02:50:08, skipping insertion in model container [2024-01-27 14:50:08,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 02:50:07" (2/4) ... [2024-01-27 14:50:08,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484e16a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 02:50:08, skipping insertion in model container [2024-01-27 14:50:08,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:50:07" (3/4) ... [2024-01-27 14:50:08,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484e16a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 02:50:08, skipping insertion in model container [2024-01-27 14:50:08,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 02:50:08" (4/4) ... [2024-01-27 14:50:08,538 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x6.wvr.c [2024-01-27 14:50:08,551 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 14:50:08,551 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 49 error locations. [2024-01-27 14:50:08,551 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 14:50:08,623 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-01-27 14:50:08,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 131 transitions, 290 flow [2024-01-27 14:50:08,701 INFO L124 PetriNetUnfolderBase]: 4/127 cut-off events. [2024-01-27 14:50:08,702 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-01-27 14:50:08,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 127 events. 4/127 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 352 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2024-01-27 14:50:08,707 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 131 transitions, 290 flow [2024-01-27 14:50:08,715 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 126 transitions, 276 flow [2024-01-27 14:50:08,725 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 14:50:08,731 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;@14e016b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 14:50:08,731 INFO L358 AbstractCegarLoop]: Starting to check reachability of 82 error locations. [2024-01-27 14:50:08,736 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 14:50:08,739 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-27 14:50:08,739 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 14:50:08,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:08,740 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-27 14:50:08,741 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (and 79 more)] === [2024-01-27 14:50:08,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:08,745 INFO L85 PathProgramCache]: Analyzing trace with hash 14457, now seen corresponding path program 1 times [2024-01-27 14:50:08,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:08,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141838170] [2024-01-27 14:50:08,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:08,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:09,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:50:09,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:09,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141838170] [2024-01-27 14:50:09,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141838170] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:09,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:09,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:50:09,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292706183] [2024-01-27 14:50:09,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:09,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:09,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:09,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:09,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:09,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 131 [2024-01-27 14:50:09,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 126 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-01-27 14:50:09,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:09,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 131 [2024-01-27 14:50:09,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:12,616 INFO L124 PetriNetUnfolderBase]: 24674/40945 cut-off events. [2024-01-27 14:50:12,616 INFO L125 PetriNetUnfolderBase]: For 1361/1361 co-relation queries the response was YES. [2024-01-27 14:50:12,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73169 conditions, 40945 events. 24674/40945 cut-off events. For 1361/1361 co-relation queries the response was YES. Maximal size of possible extension queue 2236. Compared 360602 event pairs, 17952 based on Foata normal form. 4/37458 useless extension candidates. Maximal degree in co-relation 65738. Up to 31015 conditions per place. [2024-01-27 14:50:13,005 INFO L140 encePairwiseOnDemand]: 124/131 looper letters, 44 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2024-01-27 14:50:13,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 121 transitions, 358 flow [2024-01-27 14:50:13,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:50:13,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:50:13,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2024-01-27 14:50:13,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.732824427480916 [2024-01-27 14:50:13,027 INFO L175 Difference]: Start difference. First operand has 135 places, 126 transitions, 276 flow. Second operand 3 states and 288 transitions. [2024-01-27 14:50:13,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 121 transitions, 358 flow [2024-01-27 14:50:13,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 121 transitions, 342 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-01-27 14:50:13,065 INFO L231 Difference]: Finished difference. Result has 124 places, 121 transitions, 254 flow [2024-01-27 14:50:13,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=254, PETRI_PLACES=124, PETRI_TRANSITIONS=121} [2024-01-27 14:50:13,073 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -11 predicate places. [2024-01-27 14:50:13,073 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 121 transitions, 254 flow [2024-01-27 14:50:13,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-01-27 14:50:13,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:13,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-27 14:50:13,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 14:50:13,074 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (and 79 more)] === [2024-01-27 14:50:13,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:13,075 INFO L85 PathProgramCache]: Analyzing trace with hash 448619, now seen corresponding path program 1 times [2024-01-27 14:50:13,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:13,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672157505] [2024-01-27 14:50:13,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:13,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:13,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:13,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:50:13,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:13,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672157505] [2024-01-27 14:50:13,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672157505] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:13,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:13,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:50:13,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956990233] [2024-01-27 14:50:13,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:13,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:13,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:13,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:13,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:13,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 131 [2024-01-27 14:50:13,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 121 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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-01-27 14:50:13,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:13,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 131 [2024-01-27 14:50:13,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:15,754 INFO L124 PetriNetUnfolderBase]: 24674/40943 cut-off events. [2024-01-27 14:50:15,754 INFO L125 PetriNetUnfolderBase]: For 308/308 co-relation queries the response was YES. [2024-01-27 14:50:15,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72366 conditions, 40943 events. 24674/40943 cut-off events. For 308/308 co-relation queries the response was YES. Maximal size of possible extension queue 2236. Compared 360541 event pairs, 17952 based on Foata normal form. 2/37456 useless extension candidates. Maximal degree in co-relation 72326. Up to 31017 conditions per place. [2024-01-27 14:50:16,051 INFO L140 encePairwiseOnDemand]: 127/131 looper letters, 44 selfloop transitions, 2 changer transitions 0/119 dead transitions. [2024-01-27 14:50:16,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 119 transitions, 342 flow [2024-01-27 14:50:16,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:50:16,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:50:16,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2024-01-27 14:50:16,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7404580152671756 [2024-01-27 14:50:16,053 INFO L175 Difference]: Start difference. First operand has 124 places, 121 transitions, 254 flow. Second operand 3 states and 291 transitions. [2024-01-27 14:50:16,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 119 transitions, 342 flow [2024-01-27 14:50:16,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 119 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:50:16,055 INFO L231 Difference]: Finished difference. Result has 122 places, 119 transitions, 250 flow [2024-01-27 14:50:16,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=122, PETRI_TRANSITIONS=119} [2024-01-27 14:50:16,056 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -13 predicate places. [2024-01-27 14:50:16,056 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 119 transitions, 250 flow [2024-01-27 14:50:16,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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-01-27 14:50:16,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:16,057 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-27 14:50:16,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 14:50:16,057 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (and 79 more)] === [2024-01-27 14:50:16,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:16,058 INFO L85 PathProgramCache]: Analyzing trace with hash 13907665, now seen corresponding path program 1 times [2024-01-27 14:50:16,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:16,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46449494] [2024-01-27 14:50:16,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:16,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:16,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:50:16,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:16,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46449494] [2024-01-27 14:50:16,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46449494] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:16,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:16,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:50:16,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482493082] [2024-01-27 14:50:16,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:16,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:16,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:16,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:16,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:16,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 131 [2024-01-27 14:50:16,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 119 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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-01-27 14:50:16,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:16,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 131 [2024-01-27 14:50:16,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:18,335 INFO L124 PetriNetUnfolderBase]: 24674/40938 cut-off events. [2024-01-27 14:50:18,336 INFO L125 PetriNetUnfolderBase]: For 308/308 co-relation queries the response was YES. [2024-01-27 14:50:18,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72363 conditions, 40938 events. 24674/40938 cut-off events. For 308/308 co-relation queries the response was YES. Maximal size of possible extension queue 2236. Compared 360757 event pairs, 17952 based on Foata normal form. 5/37460 useless extension candidates. Maximal degree in co-relation 72337. Up to 31020 conditions per place. [2024-01-27 14:50:18,700 INFO L140 encePairwiseOnDemand]: 124/131 looper letters, 46 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2024-01-27 14:50:18,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 114 transitions, 336 flow [2024-01-27 14:50:18,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:50:18,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:50:18,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2024-01-27 14:50:18,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7150127226463104 [2024-01-27 14:50:18,702 INFO L175 Difference]: Start difference. First operand has 122 places, 119 transitions, 250 flow. Second operand 3 states and 281 transitions. [2024-01-27 14:50:18,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 114 transitions, 336 flow [2024-01-27 14:50:18,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 114 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:50:18,705 INFO L231 Difference]: Finished difference. Result has 117 places, 114 transitions, 240 flow [2024-01-27 14:50:18,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=117, PETRI_TRANSITIONS=114} [2024-01-27 14:50:18,707 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -18 predicate places. [2024-01-27 14:50:18,708 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 114 transitions, 240 flow [2024-01-27 14:50:18,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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-01-27 14:50:18,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:18,708 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:50:18,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 14:50:18,709 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (and 79 more)] === [2024-01-27 14:50:18,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:18,709 INFO L85 PathProgramCache]: Analyzing trace with hash 2081502326, now seen corresponding path program 1 times [2024-01-27 14:50:18,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:18,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965283712] [2024-01-27 14:50:18,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:18,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:18,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:50:18,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:18,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965283712] [2024-01-27 14:50:18,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965283712] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:18,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:18,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:50:18,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960259332] [2024-01-27 14:50:18,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:18,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:18,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:18,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:18,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:18,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 131 [2024-01-27 14:50:18,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 114 transitions, 240 flow. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 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-01-27 14:50:18,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:18,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 131 [2024-01-27 14:50:18,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:22,736 INFO L124 PetriNetUnfolderBase]: 44633/68000 cut-off events. [2024-01-27 14:50:22,736 INFO L125 PetriNetUnfolderBase]: For 468/468 co-relation queries the response was YES. [2024-01-27 14:50:22,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124922 conditions, 68000 events. 44633/68000 cut-off events. For 468/468 co-relation queries the response was YES. Maximal size of possible extension queue 3418. Compared 555941 event pairs, 34013 based on Foata normal form. 2/53449 useless extension candidates. Maximal degree in co-relation 124905. Up to 56255 conditions per place. [2024-01-27 14:50:23,242 INFO L140 encePairwiseOnDemand]: 124/131 looper letters, 49 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2024-01-27 14:50:23,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 109 transitions, 332 flow [2024-01-27 14:50:23,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:50:23,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:50:23,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2024-01-27 14:50:23,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6997455470737913 [2024-01-27 14:50:23,244 INFO L175 Difference]: Start difference. First operand has 117 places, 114 transitions, 240 flow. Second operand 3 states and 275 transitions. [2024-01-27 14:50:23,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 109 transitions, 332 flow [2024-01-27 14:50:23,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 109 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:50:23,246 INFO L231 Difference]: Finished difference. Result has 112 places, 109 transitions, 230 flow [2024-01-27 14:50:23,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=112, PETRI_TRANSITIONS=109} [2024-01-27 14:50:23,247 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -23 predicate places. [2024-01-27 14:50:23,247 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 109 transitions, 230 flow [2024-01-27 14:50:23,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 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-01-27 14:50:23,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:23,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:50:23,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 14:50:23,248 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (and 79 more)] === [2024-01-27 14:50:23,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:23,248 INFO L85 PathProgramCache]: Analyzing trace with hash -2023232233, now seen corresponding path program 1 times [2024-01-27 14:50:23,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:23,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909965451] [2024-01-27 14:50:23,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:23,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:23,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:50:23,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:23,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909965451] [2024-01-27 14:50:23,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909965451] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:23,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:23,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 14:50:23,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614203307] [2024-01-27 14:50:23,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:23,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:50:23,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:23,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:50:23,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:50:23,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 131 [2024-01-27 14:50:23,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 109 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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-01-27 14:50:23,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:23,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 131 [2024-01-27 14:50:23,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:25,563 INFO L124 PetriNetUnfolderBase]: 24674/40931 cut-off events. [2024-01-27 14:50:25,563 INFO L125 PetriNetUnfolderBase]: For 307/307 co-relation queries the response was YES. [2024-01-27 14:50:25,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72357 conditions, 40931 events. 24674/40931 cut-off events. For 307/307 co-relation queries the response was YES. Maximal size of possible extension queue 2236. Compared 360641 event pairs, 17952 based on Foata normal form. 0/37450 useless extension candidates. Maximal degree in co-relation 72323. Up to 31016 conditions per place. [2024-01-27 14:50:25,804 INFO L140 encePairwiseOnDemand]: 127/131 looper letters, 47 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2024-01-27 14:50:25,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 107 transitions, 324 flow [2024-01-27 14:50:25,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:50:25,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:50:25,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2024-01-27 14:50:25,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7099236641221374 [2024-01-27 14:50:25,806 INFO L175 Difference]: Start difference. First operand has 112 places, 109 transitions, 230 flow. Second operand 3 states and 279 transitions. [2024-01-27 14:50:25,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 107 transitions, 324 flow [2024-01-27 14:50:25,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 107 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:50:25,808 INFO L231 Difference]: Finished difference. Result has 110 places, 107 transitions, 226 flow [2024-01-27 14:50:25,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=110, PETRI_TRANSITIONS=107} [2024-01-27 14:50:25,810 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -25 predicate places. [2024-01-27 14:50:25,810 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 107 transitions, 226 flow [2024-01-27 14:50:25,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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-01-27 14:50:25,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:25,811 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-01-27 14:50:25,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 14:50:25,811 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (and 79 more)] === [2024-01-27 14:50:25,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:25,811 INFO L85 PathProgramCache]: Analyzing trace with hash -789069194, now seen corresponding path program 1 times [2024-01-27 14:50:25,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:25,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630389968] [2024-01-27 14:50:25,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:25,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:25,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:25,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:50:25,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:25,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630389968] [2024-01-27 14:50:25,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630389968] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:25,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:25,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 14:50:25,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533196499] [2024-01-27 14:50:25,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:25,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:50:25,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:25,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:50:25,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:50:25,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 131 [2024-01-27 14:50:25,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 107 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 77.25) internal successors, (309), 4 states have internal predecessors, (309), 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-01-27 14:50:25,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:25,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 131 [2024-01-27 14:50:25,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:28,167 INFO L124 PetriNetUnfolderBase]: 26790/38519 cut-off events. [2024-01-27 14:50:28,167 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 14:50:28,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72164 conditions, 38519 events. 26790/38519 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 1933. Compared 282080 event pairs, 1602 based on Foata normal form. 1600/38749 useless extension candidates. Maximal degree in co-relation 72138. Up to 30153 conditions per place. [2024-01-27 14:50:28,378 INFO L140 encePairwiseOnDemand]: 122/131 looper letters, 70 selfloop transitions, 2 changer transitions 0/125 dead transitions. [2024-01-27 14:50:28,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 125 transitions, 409 flow [2024-01-27 14:50:28,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 14:50:28,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 14:50:28,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 379 transitions. [2024-01-27 14:50:28,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7232824427480916 [2024-01-27 14:50:28,381 INFO L175 Difference]: Start difference. First operand has 110 places, 107 transitions, 226 flow. Second operand 4 states and 379 transitions. [2024-01-27 14:50:28,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 125 transitions, 409 flow [2024-01-27 14:50:28,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 125 transitions, 405 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:50:28,384 INFO L231 Difference]: Finished difference. Result has 104 places, 100 transitions, 212 flow [2024-01-27 14:50:28,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=104, PETRI_TRANSITIONS=100} [2024-01-27 14:50:28,388 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -31 predicate places. [2024-01-27 14:50:28,388 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 100 transitions, 212 flow [2024-01-27 14:50:28,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.25) internal successors, (309), 4 states have internal predecessors, (309), 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-01-27 14:50:28,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:28,389 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, 1, 1] [2024-01-27 14:50:28,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 14:50:28,389 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (and 79 more)] === [2024-01-27 14:50:28,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:28,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1910314738, now seen corresponding path program 1 times [2024-01-27 14:50:28,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:28,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117011677] [2024-01-27 14:50:28,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:28,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:50:28,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:50:28,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:50:28,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117011677] [2024-01-27 14:50:28,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117011677] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:50:28,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:50:28,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 14:50:28,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668513499] [2024-01-27 14:50:28,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:50:28,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:50:28,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:50:28,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:50:28,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:50:28,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 131 [2024-01-27 14:50:28,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 100 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 77.75) internal successors, (311), 4 states have internal predecessors, (311), 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-01-27 14:50:28,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:50:28,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 131 [2024-01-27 14:50:28,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:50:30,884 INFO L124 PetriNetUnfolderBase]: 27904/46043 cut-off events. [2024-01-27 14:50:30,885 INFO L125 PetriNetUnfolderBase]: For 431/431 co-relation queries the response was YES. [2024-01-27 14:50:30,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81637 conditions, 46043 events. 27904/46043 cut-off events. For 431/431 co-relation queries the response was YES. Maximal size of possible extension queue 2379. Compared 403004 event pairs, 10422 based on Foata normal form. 1792/45636 useless extension candidates. Maximal degree in co-relation 81602. Up to 31785 conditions per place. [2024-01-27 14:50:31,128 INFO L140 encePairwiseOnDemand]: 122/131 looper letters, 76 selfloop transitions, 2 changer transitions 0/124 dead transitions. [2024-01-27 14:50:31,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 124 transitions, 419 flow [2024-01-27 14:50:31,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 14:50:31,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 14:50:31,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 385 transitions. [2024-01-27 14:50:31,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7347328244274809 [2024-01-27 14:50:31,133 INFO L175 Difference]: Start difference. First operand has 104 places, 100 transitions, 212 flow. Second operand 4 states and 385 transitions. [2024-01-27 14:50:31,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 124 transitions, 419 flow [2024-01-27 14:50:31,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 124 transitions, 416 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:50:31,135 INFO L231 Difference]: Finished difference. Result has 98 places, 93 transitions, 199 flow [2024-01-27 14:50:31,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=98, PETRI_TRANSITIONS=93} [2024-01-27 14:50:31,135 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -37 predicate places. [2024-01-27 14:50:31,136 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 93 transitions, 199 flow [2024-01-27 14:50:31,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.75) internal successors, (311), 4 states have internal predecessors, (311), 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-01-27 14:50:31,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:50:31,136 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, 1, 1] [2024-01-27 14:50:31,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 14:50:31,136 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (and 79 more)] === [2024-01-27 14:50:31,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:50:31,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1913733498, now seen corresponding path program 1 times [2024-01-27 14:50:31,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:50:31,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589670622] [2024-01-27 14:50:31,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:50:31,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:50:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 14:50:31,151 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 14:50:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 14:50:31,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 14:50:31,182 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 14:50:31,183 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 82 remaining) [2024-01-27 14:50:31,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 82 remaining) [2024-01-27 14:50:31,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 82 remaining) [2024-01-27 14:50:31,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 82 remaining) [2024-01-27 14:50:31,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 82 remaining) [2024-01-27 14:50:31,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 82 remaining) [2024-01-27 14:50:31,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 82 remaining) [2024-01-27 14:50:31,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 82 remaining) [2024-01-27 14:50:31,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 82 remaining) [2024-01-27 14:50:31,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 82 remaining) [2024-01-27 14:50:31,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 82 remaining) [2024-01-27 14:50:31,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 82 remaining) [2024-01-27 14:50:31,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 82 remaining) [2024-01-27 14:50:31,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 82 remaining) [2024-01-27 14:50:31,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 82 remaining) [2024-01-27 14:50:31,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 82 remaining) [2024-01-27 14:50:31,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 82 remaining) [2024-01-27 14:50:31,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 82 remaining) [2024-01-27 14:50:31,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err6ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 82 remaining) [2024-01-27 14:50:31,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 82 remaining) [2024-01-27 14:50:31,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 82 remaining) [2024-01-27 14:50:31,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 82 remaining) [2024-01-27 14:50:31,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err5ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 82 remaining) [2024-01-27 14:50:31,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 82 remaining) [2024-01-27 14:50:31,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 82 remaining) [2024-01-27 14:50:31,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 82 remaining) [2024-01-27 14:50:31,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 82 remaining) [2024-01-27 14:50:31,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 82 remaining) [2024-01-27 14:50:31,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 82 remaining) [2024-01-27 14:50:31,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 82 remaining) [2024-01-27 14:50:31,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 82 remaining) [2024-01-27 14:50:31,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 82 remaining) [2024-01-27 14:50:31,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 82 remaining) [2024-01-27 14:50:31,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 82 remaining) [2024-01-27 14:50:31,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 82 remaining) [2024-01-27 14:50:31,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 82 remaining) [2024-01-27 14:50:31,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 82 remaining) [2024-01-27 14:50:31,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 82 remaining) [2024-01-27 14:50:31,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 82 remaining) [2024-01-27 14:50:31,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 82 remaining) [2024-01-27 14:50:31,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 82 remaining) [2024-01-27 14:50:31,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 82 remaining) [2024-01-27 14:50:31,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (39 of 82 remaining) [2024-01-27 14:50:31,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 82 remaining) [2024-01-27 14:50:31,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 82 remaining) [2024-01-27 14:50:31,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 82 remaining) [2024-01-27 14:50:31,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 82 remaining) [2024-01-27 14:50:31,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err0ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 82 remaining) [2024-01-27 14:50:31,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err1ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 82 remaining) [2024-01-27 14:50:31,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err6ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 82 remaining) [2024-01-27 14:50:31,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err2ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 82 remaining) [2024-01-27 14:50:31,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err3ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 82 remaining) [2024-01-27 14:50:31,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err4ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 82 remaining) [2024-01-27 14:50:31,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err5ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 82 remaining) [2024-01-27 14:50:31,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 82 remaining) [2024-01-27 14:50:31,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 82 remaining) [2024-01-27 14:50:31,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 82 remaining) [2024-01-27 14:50:31,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 82 remaining) [2024-01-27 14:50:31,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 82 remaining) [2024-01-27 14:50:31,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 82 remaining) [2024-01-27 14:50:31,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 82 remaining) [2024-01-27 14:50:31,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 82 remaining) [2024-01-27 14:50:31,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 82 remaining) [2024-01-27 14:50:31,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err6ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 82 remaining) [2024-01-27 14:50:31,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 82 remaining) [2024-01-27 14:50:31,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 82 remaining) [2024-01-27 14:50:31,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 82 remaining) [2024-01-27 14:50:31,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 82 remaining) [2024-01-27 14:50:31,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 82 remaining) [2024-01-27 14:50:31,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 82 remaining) [2024-01-27 14:50:31,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err6ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 82 remaining) [2024-01-27 14:50:31,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 82 remaining) [2024-01-27 14:50:31,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 82 remaining) [2024-01-27 14:50:31,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 82 remaining) [2024-01-27 14:50:31,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err5ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 82 remaining) [2024-01-27 14:50:31,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err0ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 82 remaining) [2024-01-27 14:50:31,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err1ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 82 remaining) [2024-01-27 14:50:31,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err6ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 82 remaining) [2024-01-27 14:50:31,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err2ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 82 remaining) [2024-01-27 14:50:31,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err3ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 82 remaining) [2024-01-27 14:50:31,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err4ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 82 remaining) [2024-01-27 14:50:31,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err5ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 82 remaining) [2024-01-27 14:50:31,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 14:50:31,204 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:50:31,209 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 14:50:31,209 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 14:50:31,254 INFO L503 ceAbstractionStarter]: Automizer considered 48 witness invariants [2024-01-27 14:50:31,254 INFO L504 ceAbstractionStarter]: WitnessConsidered=48 [2024-01-27 14:50:31,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 02:50:31 BasicIcfg [2024-01-27 14:50:31,255 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 14:50:31,255 INFO L158 Benchmark]: Toolchain (without parser) took 23805.68ms. Allocated memory was 159.4MB in the beginning and 12.1GB in the end (delta: 11.9GB). Free memory was 126.1MB in the beginning and 10.1GB in the end (delta: -10.0GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2024-01-27 14:50:31,256 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 117.4MB. Free memory is still 69.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 14:50:31,257 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 88.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 14:50:31,257 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.76ms. Allocated memory is still 159.4MB. Free memory was 125.6MB in the beginning and 108.3MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-01-27 14:50:31,257 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.25ms. Allocated memory is still 159.4MB. Free memory was 108.3MB in the beginning and 106.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 14:50:31,258 INFO L158 Benchmark]: Boogie Preprocessor took 73.95ms. Allocated memory is still 159.4MB. Free memory was 106.3MB in the beginning and 103.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 14:50:31,258 INFO L158 Benchmark]: RCFGBuilder took 579.43ms. Allocated memory is still 159.4MB. Free memory was 103.8MB in the beginning and 112.9MB in the end (delta: -9.1MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2024-01-27 14:50:31,258 INFO L158 Benchmark]: TraceAbstraction took 22723.55ms. Allocated memory was 159.4MB in the beginning and 12.1GB in the end (delta: 11.9GB). Free memory was 111.8MB in the beginning and 10.1GB in the end (delta: -10.0GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2024-01-27 14:50:31,259 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 117.4MB. Free memory is still 69.7MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 88.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 373.76ms. Allocated memory is still 159.4MB. Free memory was 125.6MB in the beginning and 108.3MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.25ms. Allocated memory is still 159.4MB. Free memory was 108.3MB in the beginning and 106.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.95ms. Allocated memory is still 159.4MB. Free memory was 106.3MB in the beginning and 103.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 579.43ms. Allocated memory is still 159.4MB. Free memory was 103.8MB in the beginning and 112.9MB in the end (delta: -9.1MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. * TraceAbstraction took 22723.55ms. Allocated memory was 159.4MB in the beginning and 12.1GB in the end (delta: 11.9GB). Free memory was 111.8MB in the beginning and 10.1GB in the end (delta: -10.0GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 38]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L35] 0 unsigned int x1, x2, x3, x4, n; [L82] 0 pthread_t t1, t2, t3, t4; VAL [n=0, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x1=0, x2=0, x3=0, x4=0] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x4],IntegerLiteral[0U]]]] VAL [n=0, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x1=0, x2=0, x3=0, x4=0] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x2],IntegerLiteral[0U]]]] VAL [n=0, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x1=0, x2=0, x3=0, x4=0] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[x1]]],CastExpression[ACSLType[long long],IdentifierExpression[x3]]],IntegerLiteral[0LL]]]] VAL [n=0, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x1=0, x2=0, x3=0, x4=0] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[x1]]],CastExpression[ACSLType[long long],IdentifierExpression[x3]]],IntegerLiteral[0LL]]]] VAL [n=0, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x1=0, x2=0, x3=0, x4=0] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[x1]],CastExpression[ACSLType[long long],IdentifierExpression[x3]]],IntegerLiteral[0LL]]]] VAL [n=0, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x1=0, x2=0, x3=0, x4=0] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x3],IntegerLiteral[0U]]]] VAL [n=0, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x1=0, x2=0, x3=0, x4=0] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0U]]]] VAL [n=0, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x1=0, x2=0, x3=0, x4=0] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x1],IntegerLiteral[0U]]]] VAL [n=0, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x1=0, x2=0, x3=0, x4=0] [L85] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[x1]],CastExpression[ACSLType[long long],IdentifierExpression[x3]]],IntegerLiteral[0LL]]]] [L85] 0 x1 = __VERIFIER_nondet_uint() [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x4],IntegerLiteral[0U]]]] VAL [n=0, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x2=0, x3=0, x4=0] [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0U]]]] VAL [n=0, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x2=0, x3=0, x4=0] [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x2],IntegerLiteral[0U]]]] VAL [n=0, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x2=0, x3=0, x4=0] [L86] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x3],IntegerLiteral[0U]]]] [L86] 0 x2 = __VERIFIER_nondet_uint() [L87] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x4],IntegerLiteral[0U]]]] VAL [n=0, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x3=0, x4=0] [L87] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x3],IntegerLiteral[0U]]]] VAL [n=0, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x3=0, x4=0] [L87] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0U]]]] [L87] 0 x3 = __VERIFIER_nondet_uint() [L88] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x4],IntegerLiteral[0U]]]] VAL [n=0, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x4=0] [L88] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0U]]]] [L88] 0 x4 = __VERIFIER_nondet_uint() [L89] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0U]]]] [L89] 0 n = __VERIFIER_nondet_uint() [L92] CALL 0 assume_abort_if_not( x1 == x2 && x1 > 0 && x3 == x4 && x3 > 0 ) [L32] COND FALSE 0 !(!cond) [L92] RET 0 assume_abort_if_not( x1 == x2 && x1 > 0 && x3 == x4 && x3 > 0 ) [L94] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [_argptr={0:0}, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x1=1, x2=1, x3=1, x4=1] [L38] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, x1=1, x2=1, x3=1, x4=1] [L38] COND FALSE 1 !(x1 < n) VAL [_argptr={0:0}, _argptr={0:0}, n=1, x1=1, x2=1, x3=1, x4=1] [L38] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0U]]]] VAL [_argptr={0:0}, _argptr={0:0}, n=1, x1=1, x2=1, x3=1, x4=1] - UnprovableResult [Line: 38]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 41]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 42]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 38]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 61]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 94]: 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: 97]: 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: 96]: 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: 95]: 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: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 202 locations, 82 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: 22.6s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 21.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 332 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 242 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 781 IncrementalHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 29 mSDtfsCounter, 781 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=276occurred in iteration=0, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 192 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-27 14:50:31,290 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