./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/13-privatized_19-publish-precision_unknown_2_neg.i --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/13-privatized_19-publish-precision_unknown_2_neg.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/goblint-regression/13-privatized_19-publish-precision_unknown_2_neg.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/13-privatized_19-publish-precision_unknown_2_neg.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 23:21:28,375 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 23:21:28,430 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 23:21:28,436 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 23:21:28,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 23:21:28,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 23:21:28,462 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 23:21:28,462 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 23:21:28,463 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 23:21:28,466 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 23:21:28,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 23:21:28,466 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 23:21:28,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 23:21:28,467 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 23:21:28,468 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 23:21:28,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 23:21:28,468 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 23:21:28,468 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 23:21:28,468 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 23:21:28,469 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 23:21:28,469 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 23:21:28,469 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 23:21:28,469 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 23:21:28,470 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 23:21:28,470 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 23:21:28,470 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 23:21:28,470 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 23:21:28,470 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 23:21:28,471 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 23:21:28,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 23:21:28,472 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 23:21:28,472 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 23:21:28,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 23:21:28,473 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 23:21:28,473 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 23:21:28,473 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 23:21:28,473 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 23:21:28,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 23:21:28,474 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 23:21:28,474 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 23:21:28,474 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 23:21:28,474 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 23:21:28,474 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 23:21:28,475 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 23:21:28,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 23:21:28,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 23:21:28,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 23:21:28,735 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 23:21:28,735 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 23:21:28,736 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_19-publish-precision_unknown_2_neg.i [2024-01-29 23:21:29,787 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 23:21:30,002 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 23:21:30,004 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_19-publish-precision_unknown_2_neg.i [2024-01-29 23:21:30,016 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a478c3846/838505d8ce2a4b34b6f9c015acf0e911/FLAGe53f34ba6 [2024-01-29 23:21:30,027 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a478c3846/838505d8ce2a4b34b6f9c015acf0e911 [2024-01-29 23:21:30,029 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 23:21:30,029 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 23:21:30,029 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/13-privatized_19-publish-precision_unknown_2_neg.yml/witness.yml [2024-01-29 23:21:30,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 23:21:30,131 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 23:21:30,132 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 23:21:30,132 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 23:21:30,135 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 23:21:30,135 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:21:30" (1/2) ... [2024-01-29 23:21:30,136 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4487b3ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:30, skipping insertion in model container [2024-01-29 23:21:30,136 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:21:30" (1/2) ... [2024-01-29 23:21:30,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4692dd5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:21:30, skipping insertion in model container [2024-01-29 23:21:30,138 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 11:21:30" (2/2) ... [2024-01-29 23:21:30,138 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4487b3ea and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:30, skipping insertion in model container [2024-01-29 23:21:30,138 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 11:21:30" (2/2) ... [2024-01-29 23:21:30,139 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 23:21:30,181 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 23:21:30,183 INFO L98 nessWitnessExtractor]: Location invariant before [L685-L685] (unsigned long )arg == 0UL [2024-01-29 23:21:30,183 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] ((0 <= glob1) && (glob1 <= 5)) && (glob1 == 0 || glob1 == 5) [2024-01-29 23:21:30,183 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (0 <= glob1) && (glob1 <= 5) [2024-01-29 23:21:30,183 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] ((0 <= glob1) && (glob1 <= 5)) && (0 <= glob1) [2024-01-29 23:21:30,184 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (((0 <= glob1) && (glob1 <= 5)) && (glob1 == 0 || glob1 == 5)) && (glob1 <= 5) [2024-01-29 23:21:30,184 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] ((0 <= glob1) && (glob1 <= 5)) && (glob1 <= 127) [2024-01-29 23:21:30,184 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] ((0 <= glob1) && (glob1 <= 5)) && (glob1 == 0 || glob1 == 5) [2024-01-29 23:21:30,184 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (((0 <= glob1) && (glob1 <= 5)) && (glob1 == 0 || glob1 == 5)) && (glob1 % 5 == 0) [2024-01-29 23:21:30,185 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] ((0 <= glob1) && (glob1 <= 5)) && (glob1 <= 5) [2024-01-29 23:21:30,185 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (((0 <= glob1) && (glob1 <= 5)) && (glob1 == 0 || glob1 == 5)) && (glob1 == 0 || glob1 == 5) [2024-01-29 23:21:30,185 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] ((0 <= glob1) && (glob1 <= 5)) && (glob1 % 5 == 0) [2024-01-29 23:21:30,185 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] ((0 <= glob1) && (glob1 <= 5)) && (glob1 <= 127) [2024-01-29 23:21:30,185 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (((0 <= glob1) && (glob1 <= 5)) && (glob1 == 0 || glob1 == 5)) && (glob1 <= 127) [2024-01-29 23:21:30,185 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] ((0 <= glob1) && (glob1 <= 5)) && (glob1 % 5 == 0) [2024-01-29 23:21:30,185 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] 0 <= glob1 [2024-01-29 23:21:30,185 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] (((0 <= glob1) && (glob1 <= 5)) && (glob1 == 0 || glob1 == 5)) && (0 <= glob1) [2024-01-29 23:21:30,186 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] (glob1 == 0) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:30,186 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] glob1 == 0 [2024-01-29 23:21:30,201 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] glob1 == 0 [2024-01-29 23:21:30,201 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] (0 <= glob1) && (glob1 <= 5) [2024-01-29 23:21:30,202 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] 0 <= glob1 [2024-01-29 23:21:30,202 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] ((0 <= glob1) && (glob1 <= 5)) && (glob1 % 5 == 0) [2024-01-29 23:21:30,202 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] ((0 <= glob1) && (glob1 <= 5)) && (glob1 <= 127) [2024-01-29 23:21:30,202 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] ((0 <= glob1) && (glob1 <= 5)) && (glob1 == 0 || glob1 == 5) [2024-01-29 23:21:30,203 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] (((0 <= glob1) && (glob1 <= 5)) && (glob1 <= 127)) && (glob1 % 5 == 0) [2024-01-29 23:21:30,203 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] ((0 <= glob1) && (glob1 <= 5)) && (glob1 <= 127) [2024-01-29 23:21:30,203 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] (0 <= glob1) && (glob1 <= 5) [2024-01-29 23:21:30,203 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] ((((0 <= glob1) && (glob1 <= 5)) && (glob1 <= 127)) && (glob1 % 5 == 0)) && (glob1 == 0 || glob1 == 5) [2024-01-29 23:21:30,203 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] 0 <= glob1 [2024-01-29 23:21:30,203 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] ((((0 <= glob1) && (glob1 <= 5)) && (glob1 <= 127)) && (glob1 % 5 == 0)) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:30,203 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L700] 0 <= glob1 [2024-01-29 23:21:30,203 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L700] (0 <= glob1) && (glob1 <= 5) [2024-01-29 23:21:30,203 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L700] (0 <= glob1) && (glob1 == 0 || glob1 == 5) [2024-01-29 23:21:30,204 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L700] (0 <= glob1) && (glob1 % 5 == 0) [2024-01-29 23:21:30,204 INFO L98 nessWitnessExtractor]: Location invariant before [L700-L700] (0 <= glob1) && (glob1 <= 127) [2024-01-29 23:21:30,204 INFO L98 nessWitnessExtractor]: Location invariant before [L693-L693] (unsigned long )arg == 0UL [2024-01-29 23:21:30,204 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] (glob1 == 5) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:30,204 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] glob1 == 5 [2024-01-29 23:21:30,205 INFO L98 nessWitnessExtractor]: Location invariant before [L686-L686] (0 <= glob1) && (glob1 == 0 || glob1 == 5) [2024-01-29 23:21:30,205 INFO L98 nessWitnessExtractor]: Location invariant before [L686-L686] 0 <= glob1 [2024-01-29 23:21:30,206 INFO L98 nessWitnessExtractor]: Location invariant before [L686-L686] (0 <= glob1) && (glob1 <= 127) [2024-01-29 23:21:30,206 INFO L98 nessWitnessExtractor]: Location invariant before [L686-L686] (0 <= glob1) && (glob1 <= 5) [2024-01-29 23:21:30,206 INFO L98 nessWitnessExtractor]: Location invariant before [L686-L686] (0 <= glob1) && (glob1 % 5 == 0) [2024-01-29 23:21:30,206 INFO L98 nessWitnessExtractor]: Location invariant before [L686-L686] (0 <= glob1) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:30,206 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] (glob1 == 0) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:30,206 INFO L98 nessWitnessExtractor]: Location invariant before [L692-L692] glob1 == 0 [2024-01-29 23:21:30,207 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] glob1 == 5 [2024-01-29 23:21:30,207 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] (glob1 == 5) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:30,207 INFO L98 nessWitnessExtractor]: Location invariant before [L689-L689] glob1 == 5 [2024-01-29 23:21:30,207 INFO L98 nessWitnessExtractor]: Location invariant before [L689-L689] (glob1 == 5) && ((unsigned long )arg == 0UL) [2024-01-29 23:21:30,244 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 23:21:30,393 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_19-publish-precision_unknown_2_neg.i[1103,1116] [2024-01-29 23:21:30,551 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 23:21:30,560 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 23:21:30,571 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_19-publish-precision_unknown_2_neg.i[1103,1116] [2024-01-29 23:21:30,572 WARN L424 MainDispatcher]: Unable to annotate void __VERIFIER_assert(int cond) { if(!(cond)) { ERROR: {reach_error();abort();} } } 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 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 23:21:30,653 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 23:21:30,687 INFO L206 MainTranslator]: Completed translation [2024-01-29 23:21:30,688 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:30 WrapperNode [2024-01-29 23:21:30,688 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 23:21:30,689 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 23:21:30,689 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 23:21:30,689 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 23:21:30,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:30" (1/1) ... [2024-01-29 23:21:30,704 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:30" (1/1) ... [2024-01-29 23:21:30,720 INFO L138 Inliner]: procedures = 163, calls = 33, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2024-01-29 23:21:30,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 23:21:30,721 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 23:21:30,721 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 23:21:30,721 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 23:21:30,729 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:30" (1/1) ... [2024-01-29 23:21:30,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:30" (1/1) ... [2024-01-29 23:21:30,732 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:30" (1/1) ... [2024-01-29 23:21:30,743 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 5, 5, 2]. 36 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 1]. [2024-01-29 23:21:30,743 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:30" (1/1) ... [2024-01-29 23:21:30,743 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:30" (1/1) ... [2024-01-29 23:21:30,752 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:30" (1/1) ... [2024-01-29 23:21:30,754 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:30" (1/1) ... [2024-01-29 23:21:30,755 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:30" (1/1) ... [2024-01-29 23:21:30,756 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:30" (1/1) ... [2024-01-29 23:21:30,758 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 23:21:30,764 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 23:21:30,765 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 23:21:30,765 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 23:21:30,766 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:30" (1/1) ... [2024-01-29 23:21:30,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 23:21:30,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 23:21:30,812 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 23:21:30,836 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 23:21:30,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 23:21:30,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 23:21:30,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 23:21:30,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-29 23:21:30,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 23:21:30,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 23:21:30,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 23:21:30,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-29 23:21:30,868 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-29 23:21:30,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 23:21:30,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 23:21:30,869 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-01-29 23:21:30,869 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-01-29 23:21:30,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 23:21:30,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 23:21:30,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 23:21:30,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 23:21:30,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-29 23:21:30,870 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-29 23:21:30,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 23:21:30,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 23:21:30,871 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 23:21:30,988 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 23:21:30,990 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 23:21:31,196 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 23:21:31,196 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 23:21:31,288 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 23:21:31,288 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-29 23:21:31,288 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:21:31 BoogieIcfgContainer [2024-01-29 23:21:31,289 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 23:21:31,290 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 23:21:31,290 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 23:21:31,293 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 23:21:31,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:21:30" (1/4) ... [2024-01-29 23:21:31,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e8679a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:21:31, skipping insertion in model container [2024-01-29 23:21:31,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 11:21:30" (2/4) ... [2024-01-29 23:21:31,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e8679a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 11:21:31, skipping insertion in model container [2024-01-29 23:21:31,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 11:21:30" (3/4) ... [2024-01-29 23:21:31,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e8679a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 11:21:31, skipping insertion in model container [2024-01-29 23:21:31,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:21:31" (4/4) ... [2024-01-29 23:21:31,295 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_19-publish-precision_unknown_2_neg.i [2024-01-29 23:21:31,308 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 23:21:31,308 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2024-01-29 23:21:31,308 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 23:21:31,380 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-01-29 23:21:31,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 98 transitions, 203 flow [2024-01-29 23:21:31,486 INFO L124 PetriNetUnfolderBase]: 1/97 cut-off events. [2024-01-29 23:21:31,486 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-29 23:21:31,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 97 events. 1/97 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 145 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2024-01-29 23:21:31,491 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 98 transitions, 203 flow [2024-01-29 23:21:31,498 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 95 transitions, 193 flow [2024-01-29 23:21:31,504 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 23:21:31,509 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;@fffae46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 23:21:31,510 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2024-01-29 23:21:31,511 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 23:21:31,512 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 23:21:31,512 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 23:21:31,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:31,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 23:21:31,513 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 23:21:31,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:31,517 INFO L85 PathProgramCache]: Analyzing trace with hash 8827, now seen corresponding path program 1 times [2024-01-29 23:21:31,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:31,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64083148] [2024-01-29 23:21:31,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:31,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:31,696 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 23:21:31,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:31,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64083148] [2024-01-29 23:21:31,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64083148] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:31,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:31,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 23:21:31,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994731438] [2024-01-29 23:21:31,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:31,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 23:21:31,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:31,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 23:21:31,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 23:21:31,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 98 [2024-01-29 23:21:31,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 193 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 23:21:31,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:31,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 98 [2024-01-29 23:21:31,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:32,024 INFO L124 PetriNetUnfolderBase]: 178/735 cut-off events. [2024-01-29 23:21:32,024 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 23:21:32,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 735 events. 178/735 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4858 event pairs, 130 based on Foata normal form. 151/859 useless extension candidates. Maximal degree in co-relation 1202. Up to 255 conditions per place. [2024-01-29 23:21:32,031 INFO L140 encePairwiseOnDemand]: 71/98 looper letters, 40 selfloop transitions, 3 changer transitions 0/87 dead transitions. [2024-01-29 23:21:32,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 87 transitions, 263 flow [2024-01-29 23:21:32,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 23:21:32,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 23:21:32,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 203 transitions. [2024-01-29 23:21:32,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6904761904761905 [2024-01-29 23:21:32,049 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 193 flow. Second operand 3 states and 203 transitions. [2024-01-29 23:21:32,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 87 transitions, 263 flow [2024-01-29 23:21:32,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 87 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 23:21:32,059 INFO L231 Difference]: Finished difference. Result has 87 places, 81 transitions, 193 flow [2024-01-29 23:21:32,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=87, PETRI_TRANSITIONS=81} [2024-01-29 23:21:32,063 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -11 predicate places. [2024-01-29 23:21:32,063 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 81 transitions, 193 flow [2024-01-29 23:21:32,064 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 23:21:32,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:32,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-29 23:21:32,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 23:21:32,065 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 23:21:32,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:32,066 INFO L85 PathProgramCache]: Analyzing trace with hash 263371298, now seen corresponding path program 1 times [2024-01-29 23:21:32,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:32,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352632416] [2024-01-29 23:21:32,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:32,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:32,269 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 23:21:32,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:32,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352632416] [2024-01-29 23:21:32,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352632416] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:32,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:32,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:21:32,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786551658] [2024-01-29 23:21:32,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:32,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:21:32,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:32,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:21:32,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:21:32,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 98 [2024-01-29 23:21:32,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 81 transitions, 193 flow. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 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 23:21:32,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:32,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 98 [2024-01-29 23:21:32,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:32,399 INFO L124 PetriNetUnfolderBase]: 60/509 cut-off events. [2024-01-29 23:21:32,400 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-01-29 23:21:32,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 736 conditions, 509 events. 60/509 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2959 event pairs, 36 based on Foata normal form. 7/420 useless extension candidates. Maximal degree in co-relation 723. Up to 170 conditions per place. [2024-01-29 23:21:32,402 INFO L140 encePairwiseOnDemand]: 94/98 looper letters, 23 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2024-01-29 23:21:32,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 85 transitions, 251 flow [2024-01-29 23:21:32,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:21:32,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:21:32,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 323 transitions. [2024-01-29 23:21:32,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8239795918367347 [2024-01-29 23:21:32,405 INFO L175 Difference]: Start difference. First operand has 87 places, 81 transitions, 193 flow. Second operand 4 states and 323 transitions. [2024-01-29 23:21:32,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 85 transitions, 251 flow [2024-01-29 23:21:32,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 85 transitions, 245 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:21:32,407 INFO L231 Difference]: Finished difference. Result has 86 places, 79 transitions, 187 flow [2024-01-29 23:21:32,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=187, PETRI_PLACES=86, PETRI_TRANSITIONS=79} [2024-01-29 23:21:32,408 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -12 predicate places. [2024-01-29 23:21:32,408 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 79 transitions, 187 flow [2024-01-29 23:21:32,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 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 23:21:32,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:32,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:32,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 23:21:32,409 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 23:21:32,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:32,410 INFO L85 PathProgramCache]: Analyzing trace with hash -810561504, now seen corresponding path program 1 times [2024-01-29 23:21:32,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:32,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488297053] [2024-01-29 23:21:32,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:32,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:32,461 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 23:21:32,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:32,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488297053] [2024-01-29 23:21:32,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488297053] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:32,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:32,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 23:21:32,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207429396] [2024-01-29 23:21:32,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:32,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:21:32,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:32,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:21:32,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:21:32,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 98 [2024-01-29 23:21:32,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 79 transitions, 187 flow. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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 23:21:32,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:32,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 98 [2024-01-29 23:21:32,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:32,671 INFO L124 PetriNetUnfolderBase]: 208/771 cut-off events. [2024-01-29 23:21:32,671 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-01-29 23:21:32,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1420 conditions, 771 events. 208/771 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4861 event pairs, 94 based on Foata normal form. 0/748 useless extension candidates. Maximal degree in co-relation 1407. Up to 255 conditions per place. [2024-01-29 23:21:32,676 INFO L140 encePairwiseOnDemand]: 90/98 looper letters, 49 selfloop transitions, 5 changer transitions 0/88 dead transitions. [2024-01-29 23:21:32,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 88 transitions, 313 flow [2024-01-29 23:21:32,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:21:32,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:21:32,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 197 transitions. [2024-01-29 23:21:32,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5025510204081632 [2024-01-29 23:21:32,678 INFO L175 Difference]: Start difference. First operand has 86 places, 79 transitions, 187 flow. Second operand 4 states and 197 transitions. [2024-01-29 23:21:32,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 88 transitions, 313 flow [2024-01-29 23:21:32,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 88 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:21:32,682 INFO L231 Difference]: Finished difference. Result has 84 places, 76 transitions, 188 flow [2024-01-29 23:21:32,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=84, PETRI_TRANSITIONS=76} [2024-01-29 23:21:32,683 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -14 predicate places. [2024-01-29 23:21:32,683 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 76 transitions, 188 flow [2024-01-29 23:21:32,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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 23:21:32,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:32,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:32,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 23:21:32,684 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 23:21:32,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:32,684 INFO L85 PathProgramCache]: Analyzing trace with hash -2120885802, now seen corresponding path program 1 times [2024-01-29 23:21:32,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:32,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850533735] [2024-01-29 23:21:32,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:32,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:32,808 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 23:21:32,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:32,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850533735] [2024-01-29 23:21:32,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850533735] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:32,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:32,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:21:32,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211058525] [2024-01-29 23:21:32,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:32,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:21:32,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:32,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:21:32,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:21:32,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 98 [2024-01-29 23:21:32,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 76 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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 23:21:32,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:32,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 98 [2024-01-29 23:21:32,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:33,014 INFO L124 PetriNetUnfolderBase]: 226/810 cut-off events. [2024-01-29 23:21:33,014 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2024-01-29 23:21:33,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1527 conditions, 810 events. 226/810 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5321 event pairs, 134 based on Foata normal form. 0/782 useless extension candidates. Maximal degree in co-relation 1514. Up to 269 conditions per place. [2024-01-29 23:21:33,018 INFO L140 encePairwiseOnDemand]: 91/98 looper letters, 51 selfloop transitions, 10 changer transitions 6/104 dead transitions. [2024-01-29 23:21:33,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 104 transitions, 386 flow [2024-01-29 23:21:33,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 23:21:33,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 23:21:33,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 284 transitions. [2024-01-29 23:21:33,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5795918367346938 [2024-01-29 23:21:33,020 INFO L175 Difference]: Start difference. First operand has 84 places, 76 transitions, 188 flow. Second operand 5 states and 284 transitions. [2024-01-29 23:21:33,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 104 transitions, 386 flow [2024-01-29 23:21:33,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 104 transitions, 370 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-29 23:21:33,025 INFO L231 Difference]: Finished difference. Result has 89 places, 82 transitions, 242 flow [2024-01-29 23:21:33,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=242, PETRI_PLACES=89, PETRI_TRANSITIONS=82} [2024-01-29 23:21:33,026 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -9 predicate places. [2024-01-29 23:21:33,027 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 82 transitions, 242 flow [2024-01-29 23:21:33,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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 23:21:33,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:33,027 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:33,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 23:21:33,027 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr13ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 23:21:33,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:33,028 INFO L85 PathProgramCache]: Analyzing trace with hash 562765965, now seen corresponding path program 1 times [2024-01-29 23:21:33,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:33,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134176091] [2024-01-29 23:21:33,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:33,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:33,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:33,066 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 23:21:33,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:33,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134176091] [2024-01-29 23:21:33,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134176091] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:33,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:33,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 23:21:33,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769149730] [2024-01-29 23:21:33,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:33,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 23:21:33,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:33,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 23:21:33,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 23:21:33,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 98 [2024-01-29 23:21:33,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 82 transitions, 242 flow. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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 23:21:33,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:33,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 98 [2024-01-29 23:21:33,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:33,186 INFO L124 PetriNetUnfolderBase]: 117/399 cut-off events. [2024-01-29 23:21:33,187 INFO L125 PetriNetUnfolderBase]: For 227/244 co-relation queries the response was YES. [2024-01-29 23:21:33,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 399 events. 117/399 cut-off events. For 227/244 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1889 event pairs, 66 based on Foata normal form. 88/474 useless extension candidates. Maximal degree in co-relation 806. Up to 149 conditions per place. [2024-01-29 23:21:33,189 INFO L140 encePairwiseOnDemand]: 83/98 looper letters, 31 selfloop transitions, 4 changer transitions 0/73 dead transitions. [2024-01-29 23:21:33,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 73 transitions, 274 flow [2024-01-29 23:21:33,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 23:21:33,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 23:21:33,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2024-01-29 23:21:33,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6156462585034014 [2024-01-29 23:21:33,190 INFO L175 Difference]: Start difference. First operand has 89 places, 82 transitions, 242 flow. Second operand 3 states and 181 transitions. [2024-01-29 23:21:33,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 73 transitions, 274 flow [2024-01-29 23:21:33,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 73 transitions, 269 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 23:21:33,194 INFO L231 Difference]: Finished difference. Result has 77 places, 69 transitions, 199 flow [2024-01-29 23:21:33,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=199, PETRI_PLACES=77, PETRI_TRANSITIONS=69} [2024-01-29 23:21:33,195 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -21 predicate places. [2024-01-29 23:21:33,196 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 69 transitions, 199 flow [2024-01-29 23:21:33,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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 23:21:33,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:33,196 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:33,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 23:21:33,196 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr14ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 23:21:33,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:33,197 INFO L85 PathProgramCache]: Analyzing trace with hash 265876114, now seen corresponding path program 1 times [2024-01-29 23:21:33,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:33,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635345855] [2024-01-29 23:21:33,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:33,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:33,281 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 23:21:33,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:33,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635345855] [2024-01-29 23:21:33,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635345855] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:33,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:33,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:21:33,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526141949] [2024-01-29 23:21:33,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:33,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:21:33,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:33,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:21:33,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:21:33,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 98 [2024-01-29 23:21:33,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 69 transitions, 199 flow. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 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 23:21:33,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:33,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 98 [2024-01-29 23:21:33,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:33,456 INFO L124 PetriNetUnfolderBase]: 148/486 cut-off events. [2024-01-29 23:21:33,457 INFO L125 PetriNetUnfolderBase]: For 226/248 co-relation queries the response was YES. [2024-01-29 23:21:33,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1020 conditions, 486 events. 148/486 cut-off events. For 226/248 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2333 event pairs, 13 based on Foata normal form. 0/481 useless extension candidates. Maximal degree in co-relation 1003. Up to 193 conditions per place. [2024-01-29 23:21:33,459 INFO L140 encePairwiseOnDemand]: 92/98 looper letters, 40 selfloop transitions, 5 changer transitions 0/76 dead transitions. [2024-01-29 23:21:33,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 76 transitions, 311 flow [2024-01-29 23:21:33,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:21:33,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:21:33,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 182 transitions. [2024-01-29 23:21:33,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-01-29 23:21:33,460 INFO L175 Difference]: Start difference. First operand has 77 places, 69 transitions, 199 flow. Second operand 4 states and 182 transitions. [2024-01-29 23:21:33,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 76 transitions, 311 flow [2024-01-29 23:21:33,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 76 transitions, 303 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:21:33,464 INFO L231 Difference]: Finished difference. Result has 75 places, 66 transitions, 195 flow [2024-01-29 23:21:33,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=75, PETRI_TRANSITIONS=66} [2024-01-29 23:21:33,467 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -23 predicate places. [2024-01-29 23:21:33,467 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 66 transitions, 195 flow [2024-01-29 23:21:33,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 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 23:21:33,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:33,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:33,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 23:21:33,468 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 23:21:33,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:33,468 INFO L85 PathProgramCache]: Analyzing trace with hash 556386528, now seen corresponding path program 1 times [2024-01-29 23:21:33,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:33,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808606804] [2024-01-29 23:21:33,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:33,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:33,621 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 23:21:33,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:33,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808606804] [2024-01-29 23:21:33,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808606804] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:33,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:33,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 23:21:33,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027662948] [2024-01-29 23:21:33,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:33,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 23:21:33,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:33,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 23:21:33,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-01-29 23:21:33,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 98 [2024-01-29 23:21:33,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 66 transitions, 195 flow. Second operand has 5 states, 5 states have (on average 78.8) internal successors, (394), 5 states have internal predecessors, (394), 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 23:21:33,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:33,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 98 [2024-01-29 23:21:33,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:33,670 INFO L124 PetriNetUnfolderBase]: 32/231 cut-off events. [2024-01-29 23:21:33,670 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2024-01-29 23:21:33,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 231 events. 32/231 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 774 event pairs, 14 based on Foata normal form. 10/231 useless extension candidates. Maximal degree in co-relation 380. Up to 51 conditions per place. [2024-01-29 23:21:33,671 INFO L140 encePairwiseOnDemand]: 91/98 looper letters, 14 selfloop transitions, 6 changer transitions 9/68 dead transitions. [2024-01-29 23:21:33,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 68 transitions, 233 flow [2024-01-29 23:21:33,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:21:33,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:21:33,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 334 transitions. [2024-01-29 23:21:33,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8520408163265306 [2024-01-29 23:21:33,673 INFO L175 Difference]: Start difference. First operand has 75 places, 66 transitions, 195 flow. Second operand 4 states and 334 transitions. [2024-01-29 23:21:33,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 68 transitions, 233 flow [2024-01-29 23:21:33,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 68 transitions, 221 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-01-29 23:21:33,675 INFO L231 Difference]: Finished difference. Result has 74 places, 56 transitions, 159 flow [2024-01-29 23:21:33,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=74, PETRI_TRANSITIONS=56} [2024-01-29 23:21:33,677 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -24 predicate places. [2024-01-29 23:21:33,677 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 56 transitions, 159 flow [2024-01-29 23:21:33,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 78.8) internal successors, (394), 5 states have internal predecessors, (394), 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 23:21:33,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:33,678 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:33,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 23:21:33,678 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr20ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 23:21:33,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:33,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1051431814, now seen corresponding path program 1 times [2024-01-29 23:21:33,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:33,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299570056] [2024-01-29 23:21:33,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:33,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:33,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 23:21:33,751 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 23:21:33,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 23:21:33,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299570056] [2024-01-29 23:21:33,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299570056] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 23:21:33,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 23:21:33,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 23:21:33,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791399065] [2024-01-29 23:21:33,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 23:21:33,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 23:21:33,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 23:21:33,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 23:21:33,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 23:21:33,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 98 [2024-01-29 23:21:33,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 56 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 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 23:21:33,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 23:21:33,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 98 [2024-01-29 23:21:33,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 23:21:33,917 INFO L124 PetriNetUnfolderBase]: 59/275 cut-off events. [2024-01-29 23:21:33,917 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-01-29 23:21:33,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 275 events. 59/275 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 939 event pairs, 12 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 511. Up to 117 conditions per place. [2024-01-29 23:21:33,918 INFO L140 encePairwiseOnDemand]: 95/98 looper letters, 18 selfloop transitions, 1 changer transitions 24/63 dead transitions. [2024-01-29 23:21:33,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 63 transitions, 257 flow [2024-01-29 23:21:33,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 23:21:33,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 23:21:33,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2024-01-29 23:21:33,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-01-29 23:21:33,922 INFO L175 Difference]: Start difference. First operand has 74 places, 56 transitions, 159 flow. Second operand 4 states and 175 transitions. [2024-01-29 23:21:33,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 63 transitions, 257 flow [2024-01-29 23:21:33,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 63 transitions, 249 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 23:21:33,924 INFO L231 Difference]: Finished difference. Result has 67 places, 38 transitions, 100 flow [2024-01-29 23:21:33,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=67, PETRI_TRANSITIONS=38} [2024-01-29 23:21:33,926 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -31 predicate places. [2024-01-29 23:21:33,926 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 38 transitions, 100 flow [2024-01-29 23:21:33,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 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 23:21:33,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 23:21:33,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:33,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 23:21:33,927 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 58 more)] === [2024-01-29 23:21:33,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 23:21:33,927 INFO L85 PathProgramCache]: Analyzing trace with hash -127730840, now seen corresponding path program 1 times [2024-01-29 23:21:33,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 23:21:33,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925417252] [2024-01-29 23:21:33,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 23:21:33,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 23:21:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 23:21:33,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 23:21:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 23:21:33,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 23:21:33,967 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 23:21:33,968 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (60 of 61 remaining) [2024-01-29 23:21:33,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 61 remaining) [2024-01-29 23:21:33,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 61 remaining) [2024-01-29 23:21:33,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 61 remaining) [2024-01-29 23:21:33,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 61 remaining) [2024-01-29 23:21:33,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 61 remaining) [2024-01-29 23:21:33,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 61 remaining) [2024-01-29 23:21:33,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 61 remaining) [2024-01-29 23:21:33,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 61 remaining) [2024-01-29 23:21:33,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 61 remaining) [2024-01-29 23:21:33,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 61 remaining) [2024-01-29 23:21:33,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 61 remaining) [2024-01-29 23:21:33,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 61 remaining) [2024-01-29 23:21:33,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 61 remaining) [2024-01-29 23:21:33,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 61 remaining) [2024-01-29 23:21:33,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 61 remaining) [2024-01-29 23:21:33,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 61 remaining) [2024-01-29 23:21:33,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 61 remaining) [2024-01-29 23:21:33,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 61 remaining) [2024-01-29 23:21:33,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 61 remaining) [2024-01-29 23:21:33,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 61 remaining) [2024-01-29 23:21:33,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 61 remaining) [2024-01-29 23:21:33,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 61 remaining) [2024-01-29 23:21:33,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 61 remaining) [2024-01-29 23:21:33,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 61 remaining) [2024-01-29 23:21:33,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr12ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 61 remaining) [2024-01-29 23:21:33,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr13ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 61 remaining) [2024-01-29 23:21:33,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr14ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 61 remaining) [2024-01-29 23:21:33,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr15ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 61 remaining) [2024-01-29 23:21:33,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr16ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 61 remaining) [2024-01-29 23:21:33,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr17ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 61 remaining) [2024-01-29 23:21:33,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr18ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 61 remaining) [2024-01-29 23:21:33,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr19ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 61 remaining) [2024-01-29 23:21:33,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr20ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 61 remaining) [2024-01-29 23:21:33,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr21ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 61 remaining) [2024-01-29 23:21:33,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr22ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 61 remaining) [2024-01-29 23:21:33,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr23ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 61 remaining) [2024-01-29 23:21:33,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 61 remaining) [2024-01-29 23:21:33,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 61 remaining) [2024-01-29 23:21:33,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 61 remaining) [2024-01-29 23:21:33,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 61 remaining) [2024-01-29 23:21:33,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 61 remaining) [2024-01-29 23:21:33,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 61 remaining) [2024-01-29 23:21:33,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 61 remaining) [2024-01-29 23:21:33,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 61 remaining) [2024-01-29 23:21:33,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 61 remaining) [2024-01-29 23:21:33,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 61 remaining) [2024-01-29 23:21:33,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 61 remaining) [2024-01-29 23:21:33,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 61 remaining) [2024-01-29 23:21:33,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr12ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 61 remaining) [2024-01-29 23:21:33,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr13ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 61 remaining) [2024-01-29 23:21:33,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr14ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 61 remaining) [2024-01-29 23:21:33,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr15ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 61 remaining) [2024-01-29 23:21:33,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr16ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 61 remaining) [2024-01-29 23:21:33,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr17ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 61 remaining) [2024-01-29 23:21:33,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr18ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 61 remaining) [2024-01-29 23:21:33,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr19ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 61 remaining) [2024-01-29 23:21:33,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr20ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 61 remaining) [2024-01-29 23:21:33,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr21ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 61 remaining) [2024-01-29 23:21:33,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr22ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 61 remaining) [2024-01-29 23:21:33,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr23ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 61 remaining) [2024-01-29 23:21:33,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 23:21:33,978 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 23:21:33,983 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 23:21:33,983 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 23:21:34,006 INFO L503 ceAbstractionStarter]: Automizer considered 35 witness invariants [2024-01-29 23:21:34,007 INFO L504 ceAbstractionStarter]: WitnessConsidered=35 [2024-01-29 23:21:34,007 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 11:21:34 BasicIcfg [2024-01-29 23:21:34,007 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 23:21:34,008 INFO L158 Benchmark]: Toolchain (without parser) took 3877.14ms. Allocated memory was 111.1MB in the beginning and 155.2MB in the end (delta: 44.0MB). Free memory was 53.4MB in the beginning and 74.6MB in the end (delta: -21.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-01-29 23:21:34,008 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 81.8MB. Free memory is still 47.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 23:21:34,008 INFO L158 Benchmark]: Witness Parser took 0.09ms. Allocated memory is still 111.1MB. Free memory is still 57.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 23:21:34,008 INFO L158 Benchmark]: CACSL2BoogieTranslator took 556.49ms. Allocated memory is still 111.1MB. Free memory was 53.0MB in the beginning and 61.1MB in the end (delta: -8.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 23:21:34,009 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.23ms. Allocated memory is still 111.1MB. Free memory was 61.1MB in the beginning and 59.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 23:21:34,009 INFO L158 Benchmark]: Boogie Preprocessor took 42.63ms. Allocated memory is still 111.1MB. Free memory was 59.1MB in the beginning and 56.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 23:21:34,009 INFO L158 Benchmark]: RCFGBuilder took 524.29ms. Allocated memory is still 111.1MB. Free memory was 56.5MB in the beginning and 52.2MB in the end (delta: 4.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-01-29 23:21:34,009 INFO L158 Benchmark]: TraceAbstraction took 2717.39ms. Allocated memory was 111.1MB in the beginning and 155.2MB in the end (delta: 44.0MB). Free memory was 51.9MB in the beginning and 74.6MB in the end (delta: -22.7MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2024-01-29 23:21:34,010 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 81.8MB. Free memory is still 47.1MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.09ms. Allocated memory is still 111.1MB. Free memory is still 57.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 556.49ms. Allocated memory is still 111.1MB. Free memory was 53.0MB in the beginning and 61.1MB in the end (delta: -8.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.23ms. Allocated memory is still 111.1MB. Free memory was 61.1MB in the beginning and 59.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.63ms. Allocated memory is still 111.1MB. Free memory was 59.1MB in the beginning and 56.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 524.29ms. Allocated memory is still 111.1MB. Free memory was 56.5MB in the beginning and 52.2MB in the end (delta: 4.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 2717.39ms. Allocated memory was 111.1MB in the beginning and 155.2MB in the end (delta: 44.0MB). Free memory was 51.9MB in the beginning and 74.6MB in the end (delta: -22.7MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L681] 0 int glob1 = 0; [L682] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L696] 0 pthread_t id; VAL [glob1=0, id={5:0}, mutex1={3:0}, mutex2={4:0}] [L697] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]]]] [L697] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [arg={0:0}, glob1=0, id={5:0}, mutex1={3:0}, mutex2={4:0}] [L685] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, mutex2={4:0}] [L686] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, mutex2={4:0}] [L686] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[glob1],IntegerLiteral[5]],IntegerLiteral[0]]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, mutex2={4:0}] [L686] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[5]]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, mutex2={4:0}] [L686] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[127]]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, mutex2={4:0}] [L686] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, mutex2={4:0}] [L686] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[5]]]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, mutex2={4:0}] [L687] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[5]]],BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[127]]],BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[glob1],IntegerLiteral[5]],IntegerLiteral[0]]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, mutex2={4:0}] [L687] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, mutex2={4:0}] [L687] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[5]]],BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[127]]],BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[glob1],IntegerLiteral[5]],IntegerLiteral[0]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[5]]]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, mutex2={4:0}] [L687] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[5]]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, mutex2={4:0}] [L687] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[5]]],BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[127]]]]] VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, mutex2={4:0}] [L687] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[5]]],BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[127]]],BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[glob1],IntegerLiteral[5]],IntegerLiteral[0]]]]] [L687] 1 glob1 = 5 VAL [arg={0:0}, arg={0:0}, glob1=5, mutex1={3:0}, mutex2={4:0}] [L688] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[5]]]] VAL [arg={0:0}, arg={0:0}, glob1=5, mutex1={3:0}, mutex2={4:0}] [L688] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[5]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]]] VAL [arg={0:0}, arg={0:0}, glob1=5, mutex1={3:0}, mutex2={4:0}] [L699] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[5]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[glob1],IntegerLiteral[5]]]]]] VAL [arg={0:0}, arg={0:0}, glob1=5, id={5:0}, mutex1={3:0}, mutex2={4:0}] [L699] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[5]]],BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[127]]]]] VAL [arg={0:0}, arg={0:0}, glob1=5, id={5:0}, mutex1={3:0}, mutex2={4:0}] [L699] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[5]]],BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[glob1],IntegerLiteral[5]],IntegerLiteral[0]]]]] VAL [arg={0:0}, arg={0:0}, glob1=5, id={5:0}, mutex1={3:0}, mutex2={4:0}] [L699] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]]]] VAL [arg={0:0}, arg={0:0}, glob1=5, id={5:0}, mutex1={3:0}, mutex2={4:0}] [L699] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[glob1]],BinaryExpression[COMPLEQ,IdentifierExpression[glob1],IntegerLiteral[5]]]]] [L699] CALL 0 __VERIFIER_assert(!(glob1 == 5)) [L19] COND TRUE 0 !(cond) VAL [\old(cond)=0, arg={0:0}, arg={0:0}, cond=0, glob1=5, mutex1={3:0}, mutex2={4:0}] [L19] 0 reach_error() VAL [\old(cond)=0, arg={0:0}, arg={0:0}, cond=0, glob1=5, mutex1={3:0}, mutex2={4:0}] - UnprovableResult [Line: 697]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 697]: 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: 685]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 687]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 689]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 689]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 161 locations, 61 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.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1165 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 668 mSDsluCounter, 289 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 115 mSDsCounter, 228 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1023 IncrementalHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 228 mSolverCounterUnsat, 174 mSDtfsCounter, 1023 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=242occurred in iteration=4, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 171 NumberOfCodeBlocks, 171 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 834 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 23:21:34,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE