./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-sre-subst.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/chl-sre-subst.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8857f20b 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/chl-sre-subst.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-sre-subst.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-8857f20-m [2024-01-29 22:57:03,421 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 22:57:03,488 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 22:57:03,493 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 22:57:03,494 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 22:57:03,519 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 22:57:03,520 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 22:57:03,520 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 22:57:03,521 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 22:57:03,524 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 22:57:03,524 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 22:57:03,525 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 22:57:03,526 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 22:57:03,527 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 22:57:03,527 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 22:57:03,527 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 22:57:03,527 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 22:57:03,527 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 22:57:03,528 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 22:57:03,528 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 22:57:03,528 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 22:57:03,528 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 22:57:03,529 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 22:57:03,529 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 22:57:03,529 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 22:57:03,529 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 22:57:03,529 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 22:57:03,529 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 22:57:03,530 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 22:57:03,530 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 22:57:03,531 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 22:57:03,531 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 22:57:03,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:57:03,532 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 22:57:03,532 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 22:57:03,532 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 22:57:03,532 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 22:57:03,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 22:57:03,532 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 22:57:03,533 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 22:57:03,533 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 22:57:03,533 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 22:57:03,533 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 22:57:03,533 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-29 22:57:03,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 22:57:03,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 22:57:03,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 22:57:03,763 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 22:57:03,764 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 22:57:03,764 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/chl-sre-subst.wvr.yml/witness.yml [2024-01-29 22:57:03,896 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 22:57:03,903 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 22:57:03,904 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-sre-subst.wvr.c [2024-01-29 22:57:05,082 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 22:57:05,240 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 22:57:05,241 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-sre-subst.wvr.c [2024-01-29 22:57:05,247 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bf9963a6/8b41a3d47a324af196f44705b24c5734/FLAGd45d91a6c [2024-01-29 22:57:05,259 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bf9963a6/8b41a3d47a324af196f44705b24c5734 [2024-01-29 22:57:05,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 22:57:05,260 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 22:57:05,261 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 22:57:05,261 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 22:57:05,265 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 22:57:05,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:57:03" (1/2) ... [2024-01-29 22:57:05,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e559210 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:05, skipping insertion in model container [2024-01-29 22:57:05,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:57:03" (1/2) ... [2024-01-29 22:57:05,268 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2b93e328 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:57:05, skipping insertion in model container [2024-01-29 22:57:05,268 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:57:05" (2/2) ... [2024-01-29 22:57:05,268 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e559210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:05, skipping insertion in model container [2024-01-29 22:57:05,269 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:57:05" (2/2) ... [2024-01-29 22:57:05,269 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 22:57:05,285 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 22:57:05,286 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (result_3 == 0) && (result_4 == 0) [2024-01-29 22:57:05,286 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((result_3 == 0) && (result_4 == 0)) && (result_5 == 0) [2024-01-29 22:57:05,286 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((result_3 == 0) && (result_4 == 0)) && (sponsored_0 == (_Bool)0 || sponsored_0 == (_Bool)1) [2024-01-29 22:57:05,286 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((result_3 == 0) && (result_4 == 0)) && (sponsored_1 == (_Bool)0 || sponsored_1 == (_Bool)1) [2024-01-29 22:57:05,287 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((result_3 == 0) && (result_4 == 0)) && (sponsored_2 == (_Bool)0) [2024-01-29 22:57:05,287 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] result_3 == 0 [2024-01-29 22:57:05,287 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] (unsigned long )_argptr == 0UL [2024-01-29 22:57:05,287 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-01-29 22:57:05,287 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] ((result_3 == 0) && (sponsored_0 == (_Bool)0 || sponsored_0 == (_Bool)1)) && (sponsored_1 == (_Bool)0 || sponsored_1 == (_Bool)1) [2024-01-29 22:57:05,287 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (result_3 == 0) && (sponsored_0 == (_Bool)0 || sponsored_0 == (_Bool)1) [2024-01-29 22:57:05,287 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] result_3 == 0 [2024-01-29 22:57:05,287 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (result_3 == 0) && (result_4 == 0) [2024-01-29 22:57:05,288 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (((result_3 == 0) && (sponsored_0 == (_Bool)0 || sponsored_0 == (_Bool)1)) && (sponsored_1 == (_Bool)0 || sponsored_1 == (_Bool)1)) && (sponsored_2 == (_Bool)0 || sponsored_2 == (_Bool)1) [2024-01-29 22:57:05,288 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (result_3 == 0) && (result_5 == 0) [2024-01-29 22:57:05,288 INFO L98 nessWitnessExtractor]: Location invariant before [L44-L44] (unsigned long )_argptr == 0UL [2024-01-29 22:57:05,288 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] ((result_3 == 0) && (result_4 == 0)) && (sponsored_0 == (_Bool)0 || sponsored_0 == (_Bool)1) [2024-01-29 22:57:05,288 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (result_3 == 0) && (result_4 == 0) [2024-01-29 22:57:05,288 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] ((result_3 == 0) && (result_4 == 0)) && (sponsored_2 == (_Bool)0) [2024-01-29 22:57:05,288 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] result_3 == 0 [2024-01-29 22:57:05,288 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] ((result_3 == 0) && (result_4 == 0)) && (sponsored_1 == (_Bool)0) [2024-01-29 22:57:05,289 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] ((result_3 == 0) && (result_4 == 0)) && (result_5 == 0) [2024-01-29 22:57:05,289 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] (result_3 == 0) && (sponsored_1 == (_Bool)0) [2024-01-29 22:57:05,289 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] result_3 == 0 [2024-01-29 22:57:05,289 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] (result_3 == 0) && (sponsored_0 == (_Bool)0) [2024-01-29 22:57:05,290 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] ((result_3 == 0) && (sponsored_1 == (_Bool)0)) && (sponsored_2 == (_Bool)0) [2024-01-29 22:57:05,290 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] (result_3 == 0) && (result_4 == 0) [2024-01-29 22:57:05,290 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] (result_3 == 0) && (result_5 == 0) [2024-01-29 22:57:05,290 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] (result_3 == 0) && (result_4 == 0) [2024-01-29 22:57:05,290 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] ((result_3 == 0) && (result_4 == 0)) && (sponsored_2 == (_Bool)0) [2024-01-29 22:57:05,290 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] ((result_3 == 0) && (result_4 == 0)) && (sponsored_0 == (_Bool)0 || sponsored_0 == (_Bool)1) [2024-01-29 22:57:05,290 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] ((result_3 == 0) && (result_4 == 0)) && (val == (_Bool)0 || val == (_Bool)1) [2024-01-29 22:57:05,290 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] ((result_3 == 0) && (result_4 == 0)) && (sponsored_1 == (_Bool)0 || sponsored_1 == (_Bool)1) [2024-01-29 22:57:05,291 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] ((result_3 == 0) && (result_4 == 0)) && (result_5 == 0) [2024-01-29 22:57:05,291 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] result_3 == 0 [2024-01-29 22:57:05,309 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 22:57:05,435 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/chl-sre-subst.wvr.c[2372,2385] [2024-01-29 22:57:05,439 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:57:05,450 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 22:57:05,457 WARN L424 MainDispatcher]: Unable to annotate __assert_fail(const char *__assertion, const char *__file, unsigned int __line, const char *__function) with a witness entry 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-29 22:57:05,497 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/chl-sre-subst.wvr.c[2372,2385] [2024-01-29 22:57:05,498 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:57:05,509 INFO L206 MainTranslator]: Completed translation [2024-01-29 22:57:05,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:05 WrapperNode [2024-01-29 22:57:05,509 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 22:57:05,510 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 22:57:05,510 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 22:57:05,510 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 22:57:05,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:05" (1/1) ... [2024-01-29 22:57:05,523 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:05" (1/1) ... [2024-01-29 22:57:05,549 INFO L138 Inliner]: procedures = 22, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 100 [2024-01-29 22:57:05,557 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 22:57:05,558 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 22:57:05,558 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 22:57:05,558 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 22:57:05,568 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:05" (1/1) ... [2024-01-29 22:57:05,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:05" (1/1) ... [2024-01-29 22:57:05,580 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:05" (1/1) ... [2024-01-29 22:57:05,591 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-01-29 22:57:05,602 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:05" (1/1) ... [2024-01-29 22:57:05,603 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:05" (1/1) ... [2024-01-29 22:57:05,608 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:05" (1/1) ... [2024-01-29 22:57:05,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:05" (1/1) ... [2024-01-29 22:57:05,616 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:05" (1/1) ... [2024-01-29 22:57:05,623 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:05" (1/1) ... [2024-01-29 22:57:05,625 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 22:57:05,626 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 22:57:05,626 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 22:57:05,626 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 22:57:05,627 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:05" (1/1) ... [2024-01-29 22:57:05,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:57:05,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 22:57:05,674 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-29 22:57:05,679 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-29 22:57:05,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 22:57:05,735 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-29 22:57:05,735 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-29 22:57:05,735 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-29 22:57:05,735 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-29 22:57:05,735 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-29 22:57:05,735 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-29 22:57:05,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 22:57:05,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 22:57:05,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 22:57:05,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-29 22:57:05,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 22:57:05,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 22:57:05,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 22:57:05,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 22:57:05,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-29 22:57:05,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 22:57:05,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 22:57:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 22:57:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 22:57:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 22:57:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-29 22:57:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 22:57:05,739 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-29 22:57:05,816 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 22:57:05,818 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 22:57:06,000 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 22:57:06,000 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 22:57:06,082 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 22:57:06,082 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-29 22:57:06,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:57:06 BoogieIcfgContainer [2024-01-29 22:57:06,082 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 22:57:06,084 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 22:57:06,084 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 22:57:06,086 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 22:57:06,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:57:03" (1/4) ... [2024-01-29 22:57:06,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f22cf71 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 10:57:06, skipping insertion in model container [2024-01-29 22:57:06,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:57:05" (2/4) ... [2024-01-29 22:57:06,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f22cf71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:57:06, skipping insertion in model container [2024-01-29 22:57:06,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:57:05" (3/4) ... [2024-01-29 22:57:06,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f22cf71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:57:06, skipping insertion in model container [2024-01-29 22:57:06,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:57:06" (4/4) ... [2024-01-29 22:57:06,089 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-sre-subst.wvr.c [2024-01-29 22:57:06,101 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 22:57:06,101 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2024-01-29 22:57:06,101 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 22:57:06,150 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-29 22:57:06,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 75 transitions, 171 flow [2024-01-29 22:57:06,224 INFO L124 PetriNetUnfolderBase]: 0/72 cut-off events. [2024-01-29 22:57:06,225 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:57:06,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 72 events. 0/72 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-01-29 22:57:06,227 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 75 transitions, 171 flow [2024-01-29 22:57:06,230 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 71 transitions, 160 flow [2024-01-29 22:57:06,242 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 22:57:06,250 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;@defea96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 22:57:06,250 INFO L358 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2024-01-29 22:57:06,253 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 22:57:06,253 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 22:57:06,253 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:57:06,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:06,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 22:57:06,255 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 31 more)] === [2024-01-29 22:57:06,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:06,261 INFO L85 PathProgramCache]: Analyzing trace with hash 9632, now seen corresponding path program 1 times [2024-01-29 22:57:06,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:06,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45957397] [2024-01-29 22:57:06,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:06,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:06,495 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-29 22:57:06,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:06,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45957397] [2024-01-29 22:57:06,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45957397] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:06,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:06,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:06,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775692618] [2024-01-29 22:57:06,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:06,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:06,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:06,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:06,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:06,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 75 [2024-01-29 22:57:06,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 71 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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-29 22:57:06,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:06,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 75 [2024-01-29 22:57:06,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:06,719 INFO L124 PetriNetUnfolderBase]: 138/320 cut-off events. [2024-01-29 22:57:06,719 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-01-29 22:57:06,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 320 events. 138/320 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1075 event pairs, 34 based on Foata normal form. 4/312 useless extension candidates. Maximal degree in co-relation 497. Up to 223 conditions per place. [2024-01-29 22:57:06,724 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 33 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2024-01-29 22:57:06,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 74 transitions, 244 flow [2024-01-29 22:57:06,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:06,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:06,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2024-01-29 22:57:06,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2024-01-29 22:57:06,735 INFO L175 Difference]: Start difference. First operand has 81 places, 71 transitions, 160 flow. Second operand 3 states and 165 transitions. [2024-01-29 22:57:06,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 74 transitions, 244 flow [2024-01-29 22:57:06,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 74 transitions, 228 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-01-29 22:57:06,741 INFO L231 Difference]: Finished difference. Result has 72 places, 67 transitions, 153 flow [2024-01-29 22:57:06,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=72, PETRI_TRANSITIONS=67} [2024-01-29 22:57:06,745 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -9 predicate places. [2024-01-29 22:57:06,746 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 67 transitions, 153 flow [2024-01-29 22:57:06,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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-29 22:57:06,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:06,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-29 22:57:06,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 22:57:06,747 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 31 more)] === [2024-01-29 22:57:06,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:06,747 INFO L85 PathProgramCache]: Analyzing trace with hash 298857, now seen corresponding path program 1 times [2024-01-29 22:57:06,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:06,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044252176] [2024-01-29 22:57:06,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:06,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:06,783 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-29 22:57:06,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:06,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044252176] [2024-01-29 22:57:06,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044252176] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:06,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:06,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:06,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243849465] [2024-01-29 22:57:06,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:06,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:06,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:06,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:06,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:06,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2024-01-29 22:57:06,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 67 transitions, 153 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:06,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:06,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2024-01-29 22:57:06,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:06,905 INFO L124 PetriNetUnfolderBase]: 138/318 cut-off events. [2024-01-29 22:57:06,906 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2024-01-29 22:57:06,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 665 conditions, 318 events. 138/318 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1096 event pairs, 66 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 198. Up to 231 conditions per place. [2024-01-29 22:57:06,908 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 41 selfloop transitions, 4 changer transitions 0/73 dead transitions. [2024-01-29 22:57:06,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 73 transitions, 265 flow [2024-01-29 22:57:06,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:06,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:06,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2024-01-29 22:57:06,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2024-01-29 22:57:06,910 INFO L175 Difference]: Start difference. First operand has 72 places, 67 transitions, 153 flow. Second operand 3 states and 145 transitions. [2024-01-29 22:57:06,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 73 transitions, 265 flow [2024-01-29 22:57:06,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 73 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 22:57:06,912 INFO L231 Difference]: Finished difference. Result has 70 places, 66 transitions, 170 flow [2024-01-29 22:57:06,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=70, PETRI_TRANSITIONS=66} [2024-01-29 22:57:06,913 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -11 predicate places. [2024-01-29 22:57:06,913 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 66 transitions, 170 flow [2024-01-29 22:57:06,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:06,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:06,914 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-29 22:57:06,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 22:57:06,914 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 31 more)] === [2024-01-29 22:57:06,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:06,915 INFO L85 PathProgramCache]: Analyzing trace with hash 9264886, now seen corresponding path program 1 times [2024-01-29 22:57:06,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:06,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135985641] [2024-01-29 22:57:06,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:06,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:07,070 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-29 22:57:07,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:07,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135985641] [2024-01-29 22:57:07,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135985641] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:07,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:07,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:07,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421956033] [2024-01-29 22:57:07,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:07,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:07,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:07,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:07,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:07,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 75 [2024-01-29 22:57:07,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 66 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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-29 22:57:07,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:07,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 75 [2024-01-29 22:57:07,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:07,198 INFO L124 PetriNetUnfolderBase]: 138/306 cut-off events. [2024-01-29 22:57:07,198 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2024-01-29 22:57:07,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 306 events. 138/306 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 959 event pairs, 118 based on Foata normal form. 1/297 useless extension candidates. Maximal degree in co-relation 402. Up to 246 conditions per place. [2024-01-29 22:57:07,202 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 26 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2024-01-29 22:57:07,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 64 transitions, 222 flow [2024-01-29 22:57:07,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:07,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:07,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2024-01-29 22:57:07,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2024-01-29 22:57:07,206 INFO L175 Difference]: Start difference. First operand has 70 places, 66 transitions, 170 flow. Second operand 3 states and 160 transitions. [2024-01-29 22:57:07,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 64 transitions, 222 flow [2024-01-29 22:57:07,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 64 transitions, 218 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 22:57:07,208 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 166 flow [2024-01-29 22:57:07,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2024-01-29 22:57:07,208 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -12 predicate places. [2024-01-29 22:57:07,209 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 166 flow [2024-01-29 22:57:07,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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-29 22:57:07,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:07,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-29 22:57:07,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 22:57:07,209 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 31 more)] === [2024-01-29 22:57:07,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:07,210 INFO L85 PathProgramCache]: Analyzing trace with hash 287211755, now seen corresponding path program 1 times [2024-01-29 22:57:07,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:07,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909888506] [2024-01-29 22:57:07,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:07,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:07,308 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-29 22:57:07,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:07,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909888506] [2024-01-29 22:57:07,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909888506] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:07,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:07,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:07,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479458720] [2024-01-29 22:57:07,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:07,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:07,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:07,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:07,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:07,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 75 [2024-01-29 22:57:07,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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-29 22:57:07,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:07,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 75 [2024-01-29 22:57:07,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:07,421 INFO L124 PetriNetUnfolderBase]: 138/305 cut-off events. [2024-01-29 22:57:07,421 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2024-01-29 22:57:07,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 305 events. 138/305 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 960 event pairs, 118 based on Foata normal form. 1/298 useless extension candidates. Maximal degree in co-relation 654. Up to 248 conditions per place. [2024-01-29 22:57:07,423 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 27 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2024-01-29 22:57:07,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 63 transitions, 222 flow [2024-01-29 22:57:07,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:07,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:07,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2024-01-29 22:57:07,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2024-01-29 22:57:07,425 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 166 flow. Second operand 3 states and 160 transitions. [2024-01-29 22:57:07,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 63 transitions, 222 flow [2024-01-29 22:57:07,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 63 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:07,427 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 164 flow [2024-01-29 22:57:07,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2024-01-29 22:57:07,428 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -13 predicate places. [2024-01-29 22:57:07,428 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 164 flow [2024-01-29 22:57:07,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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-29 22:57:07,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:07,428 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:07,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 22:57:07,429 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 31 more)] === [2024-01-29 22:57:07,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:07,429 INFO L85 PathProgramCache]: Analyzing trace with hash 750840564, now seen corresponding path program 1 times [2024-01-29 22:57:07,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:07,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756655132] [2024-01-29 22:57:07,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:07,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:07,458 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-29 22:57:07,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:07,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756655132] [2024-01-29 22:57:07,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756655132] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:07,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:07,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:57:07,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685254555] [2024-01-29 22:57:07,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:07,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:57:07,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:07,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:57:07,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:57:07,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 75 [2024-01-29 22:57:07,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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-29 22:57:07,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:07,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 75 [2024-01-29 22:57:07,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:07,628 INFO L124 PetriNetUnfolderBase]: 138/313 cut-off events. [2024-01-29 22:57:07,628 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2024-01-29 22:57:07,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 313 events. 138/313 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1074 event pairs, 68 based on Foata normal form. 0/306 useless extension candidates. Maximal degree in co-relation 674. Up to 237 conditions per place. [2024-01-29 22:57:07,630 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 33 selfloop transitions, 4 changer transitions 0/68 dead transitions. [2024-01-29 22:57:07,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 68 transitions, 254 flow [2024-01-29 22:57:07,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:07,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:07,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2024-01-29 22:57:07,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6488888888888888 [2024-01-29 22:57:07,632 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 164 flow. Second operand 3 states and 146 transitions. [2024-01-29 22:57:07,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 68 transitions, 254 flow [2024-01-29 22:57:07,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 68 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:57:07,636 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 180 flow [2024-01-29 22:57:07,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2024-01-29 22:57:07,638 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -14 predicate places. [2024-01-29 22:57:07,639 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 180 flow [2024-01-29 22:57:07,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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-29 22:57:07,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:07,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:07,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 22:57:07,639 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 31 more)] === [2024-01-29 22:57:07,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:07,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1801221332, now seen corresponding path program 1 times [2024-01-29 22:57:07,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:07,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059904051] [2024-01-29 22:57:07,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:07,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:07,714 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-29 22:57:07,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:07,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059904051] [2024-01-29 22:57:07,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059904051] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:07,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:07,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:57:07,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720278644] [2024-01-29 22:57:07,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:07,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:57:07,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:07,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:57:07,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:57:07,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 75 [2024-01-29 22:57:07,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:07,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:07,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 75 [2024-01-29 22:57:07,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:07,869 INFO L124 PetriNetUnfolderBase]: 138/312 cut-off events. [2024-01-29 22:57:07,869 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2024-01-29 22:57:07,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 312 events. 138/312 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1079 event pairs, 70 based on Foata normal form. 0/309 useless extension candidates. Maximal degree in co-relation 210. Up to 231 conditions per place. [2024-01-29 22:57:07,871 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 42 selfloop transitions, 6 changer transitions 0/68 dead transitions. [2024-01-29 22:57:07,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 68 transitions, 288 flow [2024-01-29 22:57:07,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:57:07,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:57:07,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 161 transitions. [2024-01-29 22:57:07,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5366666666666666 [2024-01-29 22:57:07,872 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 180 flow. Second operand 4 states and 161 transitions. [2024-01-29 22:57:07,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 68 transitions, 288 flow [2024-01-29 22:57:07,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 284 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 22:57:07,874 INFO L231 Difference]: Finished difference. Result has 68 places, 62 transitions, 186 flow [2024-01-29 22:57:07,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2024-01-29 22:57:07,875 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -13 predicate places. [2024-01-29 22:57:07,875 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 186 flow [2024-01-29 22:57:07,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:07,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:07,876 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:07,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 22:57:07,876 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 31 more)] === [2024-01-29 22:57:07,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:07,877 INFO L85 PathProgramCache]: Analyzing trace with hash 101890305, now seen corresponding path program 1 times [2024-01-29 22:57:07,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:07,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421447678] [2024-01-29 22:57:07,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:07,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:07,916 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-29 22:57:07,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:07,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421447678] [2024-01-29 22:57:07,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421447678] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:07,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:07,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:57:07,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946562873] [2024-01-29 22:57:07,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:07,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:57:07,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:07,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:57:07,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:57:07,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 75 [2024-01-29 22:57:07,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 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-29 22:57:07,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:07,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 75 [2024-01-29 22:57:07,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:08,073 INFO L124 PetriNetUnfolderBase]: 138/310 cut-off events. [2024-01-29 22:57:08,073 INFO L125 PetriNetUnfolderBase]: For 201/201 co-relation queries the response was YES. [2024-01-29 22:57:08,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 310 events. 138/310 cut-off events. For 201/201 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1071 event pairs, 70 based on Foata normal form. 0/308 useless extension candidates. Maximal degree in co-relation 210. Up to 231 conditions per place. [2024-01-29 22:57:08,075 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 41 selfloop transitions, 6 changer transitions 0/66 dead transitions. [2024-01-29 22:57:08,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 66 transitions, 290 flow [2024-01-29 22:57:08,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:57:08,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:57:08,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2024-01-29 22:57:08,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.55 [2024-01-29 22:57:08,076 INFO L175 Difference]: Start difference. First operand has 68 places, 62 transitions, 186 flow. Second operand 4 states and 165 transitions. [2024-01-29 22:57:08,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 66 transitions, 290 flow [2024-01-29 22:57:08,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 66 transitions, 278 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 22:57:08,078 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 182 flow [2024-01-29 22:57:08,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2024-01-29 22:57:08,079 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -15 predicate places. [2024-01-29 22:57:08,079 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 182 flow [2024-01-29 22:57:08,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 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-29 22:57:08,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:08,079 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:08,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 22:57:08,080 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 31 more)] === [2024-01-29 22:57:08,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:08,080 INFO L85 PathProgramCache]: Analyzing trace with hash -867654597, now seen corresponding path program 1 times [2024-01-29 22:57:08,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:08,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291701106] [2024-01-29 22:57:08,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:08,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 22:57:08,090 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 22:57:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 22:57:08,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 22:57:08,120 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 22:57:08,121 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 34 remaining) [2024-01-29 22:57:08,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 34 remaining) [2024-01-29 22:57:08,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 34 remaining) [2024-01-29 22:57:08,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 34 remaining) [2024-01-29 22:57:08,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 34 remaining) [2024-01-29 22:57:08,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 34 remaining) [2024-01-29 22:57:08,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 34 remaining) [2024-01-29 22:57:08,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 34 remaining) [2024-01-29 22:57:08,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 34 remaining) [2024-01-29 22:57:08,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 34 remaining) [2024-01-29 22:57:08,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 34 remaining) [2024-01-29 22:57:08,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 34 remaining) [2024-01-29 22:57:08,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 34 remaining) [2024-01-29 22:57:08,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 34 remaining) [2024-01-29 22:57:08,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 34 remaining) [2024-01-29 22:57:08,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 34 remaining) [2024-01-29 22:57:08,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 34 remaining) [2024-01-29 22:57:08,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 34 remaining) [2024-01-29 22:57:08,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 34 remaining) [2024-01-29 22:57:08,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 34 remaining) [2024-01-29 22:57:08,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 34 remaining) [2024-01-29 22:57:08,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 34 remaining) [2024-01-29 22:57:08,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 34 remaining) [2024-01-29 22:57:08,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 34 remaining) [2024-01-29 22:57:08,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 34 remaining) [2024-01-29 22:57:08,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 34 remaining) [2024-01-29 22:57:08,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 34 remaining) [2024-01-29 22:57:08,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION (6 of 34 remaining) [2024-01-29 22:57:08,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 34 remaining) [2024-01-29 22:57:08,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 34 remaining) [2024-01-29 22:57:08,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 34 remaining) [2024-01-29 22:57:08,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 34 remaining) [2024-01-29 22:57:08,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 34 remaining) [2024-01-29 22:57:08,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 34 remaining) [2024-01-29 22:57:08,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 22:57:08,134 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:08,139 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 22:57:08,148 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 22:57:08,178 INFO L503 ceAbstractionStarter]: Automizer considered 27 witness invariants [2024-01-29 22:57:08,178 INFO L504 ceAbstractionStarter]: WitnessConsidered=27 [2024-01-29 22:57:08,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:57:08 BasicIcfg [2024-01-29 22:57:08,179 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 22:57:08,179 INFO L158 Benchmark]: Toolchain (without parser) took 2918.88ms. Allocated memory was 146.8MB in the beginning and 213.9MB in the end (delta: 67.1MB). Free memory was 74.4MB in the beginning and 169.5MB in the end (delta: -95.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:57:08,179 INFO L158 Benchmark]: Witness Parser took 0.17ms. Allocated memory is still 111.1MB. Free memory was 72.0MB in the beginning and 71.8MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:57:08,179 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 146.8MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:57:08,180 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.38ms. Allocated memory is still 146.8MB. Free memory was 74.2MB in the beginning and 58.1MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-01-29 22:57:08,180 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.11ms. Allocated memory is still 146.8MB. Free memory was 58.1MB in the beginning and 56.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 22:57:08,180 INFO L158 Benchmark]: Boogie Preprocessor took 67.58ms. Allocated memory is still 146.8MB. Free memory was 56.2MB in the beginning and 53.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 22:57:08,180 INFO L158 Benchmark]: RCFGBuilder took 456.70ms. Allocated memory is still 146.8MB. Free memory was 53.9MB in the beginning and 88.6MB in the end (delta: -34.7MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2024-01-29 22:57:08,181 INFO L158 Benchmark]: TraceAbstraction took 2094.77ms. Allocated memory was 146.8MB in the beginning and 213.9MB in the end (delta: 67.1MB). Free memory was 87.9MB in the beginning and 169.5MB in the end (delta: -81.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:57:08,182 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.17ms. Allocated memory is still 111.1MB. Free memory was 72.0MB in the beginning and 71.8MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.17ms. Allocated memory is still 146.8MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.38ms. Allocated memory is still 146.8MB. Free memory was 74.2MB in the beginning and 58.1MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.11ms. Allocated memory is still 146.8MB. Free memory was 58.1MB in the beginning and 56.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.58ms. Allocated memory is still 146.8MB. Free memory was 56.2MB in the beginning and 53.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 456.70ms. Allocated memory is still 146.8MB. Free memory was 53.9MB in the beginning and 88.6MB in the end (delta: -34.7MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2094.77ms. Allocated memory was 146.8MB in the beginning and 213.9MB in the end (delta: 67.1MB). Free memory was 87.9MB in the beginning and 169.5MB in the end (delta: -81.6MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 64]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L38] int result_3, result_4, result_5; [L39] _Bool sponsored_0, sponsored_1, sponsored_2; [L60] pthread_t t1, t2, t3; VAL [result_3=0, result_4=0, result_5=0, sponsored_0=0, sponsored_1=0, sponsored_2=0, t1={3:0}, t2={6:0}, t3={5:0}] [L63] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_5],IntegerLiteral[0]]]]] VAL [result_3=0, result_4=0, result_5=0, sponsored_0=0, sponsored_1=0, sponsored_2=0, t1={3:0}, t2={6:0}, t3={5:0}] [L63] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_4],IntegerLiteral[0]]]]] VAL [result_3=0, result_4=0, result_5=0, sponsored_0=0, sponsored_1=0, sponsored_2=0, t1={3:0}, t2={6:0}, t3={5:0}] [L63] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sponsored_1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]],BinaryExpression[COMPEQ,IdentifierExpression[sponsored_2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] VAL [result_3=0, result_4=0, result_5=0, sponsored_0=0, sponsored_1=0, sponsored_2=0, t1={3:0}, t2={6:0}, t3={5:0}] [L63] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sponsored_0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] VAL [result_3=0, result_4=0, result_5=0, sponsored_0=0, sponsored_1=0, sponsored_2=0, t1={3:0}, t2={6:0}, t3={5:0}] [L63] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_3],IntegerLiteral[0]]]] VAL [result_3=0, result_4=0, result_5=0, sponsored_0=0, sponsored_1=0, sponsored_2=0, t1={3:0}, t2={6:0}, t3={5:0}] [L63] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sponsored_1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] [L63] sponsored_0 = __VERIFIER_nondet_bool() [L64] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_5],IntegerLiteral[0]]]]] VAL [result_3=0, result_4=0, result_5=0, sponsored_1=0, sponsored_2=0, t1={3:0}, t2={6:0}, t3={5:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sponsored_1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] VAL [result_3=0, result_4=0, result_5=0, sponsored_1=0, sponsored_2=0, t1={3:0}, t2={6:0}, t3={5:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_3],IntegerLiteral[0]]]] VAL [result_3=0, result_4=0, result_5=0, sponsored_1=0, sponsored_2=0, t1={3:0}, t2={6:0}, t3={5:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sponsored_2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] VAL [result_3=0, result_4=0, result_5=0, sponsored_1=0, sponsored_2=0, t1={3:0}, t2={6:0}, t3={5:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_4],IntegerLiteral[0]]]]] VAL [result_3=0, result_4=0, result_5=0, sponsored_1=0, sponsored_2=0, t1={3:0}, t2={6:0}, t3={5:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_4],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[sponsored_0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sponsored_0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] VAL [result_3=0, result_4=0, result_5=0, sponsored_0=2, sponsored_1=0, sponsored_2=0, t1={3:0}, t2={6:0}, t3={5:0}] - UnprovableResult [Line: 44]: 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: 63]: 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: 63]: 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: 63]: 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: 64]: 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: 64]: 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: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 77]: 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: 69]: 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: 68]: 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: 70]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 91 locations, 34 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.0s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 897 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 376 mSDsluCounter, 89 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 894 IncrementalHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 89 mSDtfsCounter, 894 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred in iteration=6, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 387 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-29 22:57:08,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE