./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/13-privatized_41-traces-ex-7_unknown_1_pos.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_41-traces-ex-7_unknown_1_pos.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_41-traces-ex-7_unknown_1_pos.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/13-privatized_41-traces-ex-7_unknown_1_pos.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 14:59:42,295 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 14:59:42,370 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 14:59:42,377 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 14:59:42,378 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 14:59:42,401 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 14:59:42,402 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 14:59:42,402 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 14:59:42,402 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 14:59:42,403 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 14:59:42,403 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 14:59:42,403 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 14:59:42,403 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 14:59:42,404 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 14:59:42,407 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 14:59:42,407 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 14:59:42,408 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 14:59:42,410 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 14:59:42,411 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 14:59:42,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 14:59:42,413 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 14:59:42,413 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 14:59:42,413 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 14:59:42,413 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 14:59:42,414 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 14:59:42,414 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 14:59:42,414 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 14:59:42,414 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 14:59:42,415 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 14:59:42,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 14:59:42,416 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 14:59:42,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 14:59:42,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 14:59:42,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 14:59:42,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 14:59:42,417 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 14:59:42,417 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 14:59:42,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 14:59:42,417 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 14:59:42,417 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 14:59:42,417 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 14:59:42,418 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 14:59:42,418 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 14:59:42,418 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-27 14:59:42,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 14:59:42,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 14:59:42,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 14:59:42,657 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-27 14:59:42,658 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-27 14:59:42,659 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_41-traces-ex-7_unknown_1_pos.yml/witness.yml [2024-01-27 14:59:42,758 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 14:59:42,760 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 14:59:42,761 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_41-traces-ex-7_unknown_1_pos.i [2024-01-27 14:59:43,747 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 14:59:43,934 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 14:59:43,935 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_41-traces-ex-7_unknown_1_pos.i [2024-01-27 14:59:43,949 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff9713af1/f1bbc277caf34bd59ed0e2e0ec6f1b9b/FLAG9c1685ceb [2024-01-27 14:59:43,964 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff9713af1/f1bbc277caf34bd59ed0e2e0ec6f1b9b [2024-01-27 14:59:43,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 14:59:43,965 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-27 14:59:43,968 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 14:59:43,968 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 14:59:43,972 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 14:59:43,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 02:59:42" (1/2) ... [2024-01-27 14:59:43,975 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55473417 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:59:43, skipping insertion in model container [2024-01-27 14:59:43,975 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 02:59:42" (1/2) ... [2024-01-27 14:59:43,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1b750d7b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 02:59:43, skipping insertion in model container [2024-01-27 14:59:43,977 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 02:59:43" (2/2) ... [2024-01-27 14:59:43,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55473417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:59:43, skipping insertion in model container [2024-01-27 14:59:43,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 02:59:43" (2/2) ... [2024-01-27 14:59:43,977 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-27 14:59:44,024 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-27 14:59:44,026 INFO L98 nessWitnessExtractor]: Location invariant before [L690-L690] (unsigned long )arg == 0UL [2024-01-27 14:59:44,026 INFO L98 nessWitnessExtractor]: Location invariant before [L689-L689] (unsigned long )arg == 0UL [2024-01-27 14:59:44,026 INFO L98 nessWitnessExtractor]: Location invariant before [L689-L689] g == 17 [2024-01-27 14:59:44,026 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] g == 17 [2024-01-27 14:59:44,026 INFO L98 nessWitnessExtractor]: Location invariant before [L688-L688] (unsigned long )arg == 0UL [2024-01-27 14:59:44,027 INFO L98 nessWitnessExtractor]: Location invariant before [L686-L686] (unsigned long )arg == 0UL [2024-01-27 14:59:44,027 INFO L98 nessWitnessExtractor]: Location invariant before [L686-L686] g <= 17 [2024-01-27 14:59:44,027 INFO L98 nessWitnessExtractor]: Location invariant before [L686-L686] g == 0 || g == 17 [2024-01-27 14:59:44,027 INFO L98 nessWitnessExtractor]: Location invariant before [L686-L686] g <= 127 [2024-01-27 14:59:44,027 INFO L98 nessWitnessExtractor]: Location invariant before [L686-L686] g % 17 == 0 [2024-01-27 14:59:44,027 INFO L98 nessWitnessExtractor]: Location invariant before [L686-L686] 0 <= g [2024-01-27 14:59:44,027 INFO L98 nessWitnessExtractor]: Location invariant before [L685-L685] (unsigned long )arg == 0UL [2024-01-27 14:59:44,028 INFO L98 nessWitnessExtractor]: Location invariant before [L698-L698] g <= 17 [2024-01-27 14:59:44,028 INFO L98 nessWitnessExtractor]: Location invariant before [L698-L698] g <= 127 [2024-01-27 14:59:44,028 INFO L98 nessWitnessExtractor]: Location invariant before [L698-L698] g == 0 || g == 17 [2024-01-27 14:59:44,028 INFO L98 nessWitnessExtractor]: Location invariant before [L698-L698] 0 <= g [2024-01-27 14:59:44,028 INFO L98 nessWitnessExtractor]: Location invariant before [L698-L698] g % 17 == 0 [2024-01-27 14:59:44,028 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] 0 <= g [2024-01-27 14:59:44,028 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] g % 17 == 0 [2024-01-27 14:59:44,029 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] g <= 17 [2024-01-27 14:59:44,029 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] g <= 127 [2024-01-27 14:59:44,029 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] g == 0 || g == 17 [2024-01-27 14:59:44,029 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] (unsigned long )arg == 0UL [2024-01-27 14:59:44,029 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] g <= 17 [2024-01-27 14:59:44,030 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] g % 17 == 0 [2024-01-27 14:59:44,030 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] g == 0 || g == 17 [2024-01-27 14:59:44,030 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] 0 <= g [2024-01-27 14:59:44,030 INFO L98 nessWitnessExtractor]: Location invariant before [L699-L699] g <= 127 [2024-01-27 14:59:44,030 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] g == 0 || g == 17 [2024-01-27 14:59:44,030 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] g <= 17 [2024-01-27 14:59:44,030 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] g == 0 || g == 17 [2024-01-27 14:59:44,031 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] g <= 17 [2024-01-27 14:59:44,031 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] g <= 17 [2024-01-27 14:59:44,031 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] g % 17 == 0 [2024-01-27 14:59:44,031 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] g <= 127 [2024-01-27 14:59:44,031 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] g % 17 == 0 [2024-01-27 14:59:44,032 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] g <= 127 [2024-01-27 14:59:44,032 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] g % 17 == 0 [2024-01-27 14:59:44,033 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] g == 0 || g == 17 [2024-01-27 14:59:44,033 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] 0 <= g [2024-01-27 14:59:44,033 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] g <= 127 [2024-01-27 14:59:44,033 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] 0 <= g [2024-01-27 14:59:44,033 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] 0 <= g [2024-01-27 14:59:44,034 INFO L98 nessWitnessExtractor]: Location invariant before [L696-L696] g == 0 || g == 17 [2024-01-27 14:59:44,034 INFO L98 nessWitnessExtractor]: Location invariant before [L696-L696] g % 17 == 0 [2024-01-27 14:59:44,034 INFO L98 nessWitnessExtractor]: Location invariant before [L696-L696] 0 <= g [2024-01-27 14:59:44,034 INFO L98 nessWitnessExtractor]: Location invariant before [L696-L696] g <= 127 [2024-01-27 14:59:44,034 INFO L98 nessWitnessExtractor]: Location invariant before [L696-L696] g <= 17 [2024-01-27 14:59:44,035 INFO L98 nessWitnessExtractor]: Location invariant before [L694-L694] g == 0 [2024-01-27 14:59:44,035 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] g <= 17 [2024-01-27 14:59:44,035 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] g == 0 || g == 17 [2024-01-27 14:59:44,035 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] g <= 127 [2024-01-27 14:59:44,035 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] 0 <= g [2024-01-27 14:59:44,035 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] g % 17 == 0 [2024-01-27 14:59:44,076 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 14:59:44,226 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_41-traces-ex-7_unknown_1_pos.i[1097,1110] [2024-01-27 14:59:44,347 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 14:59:44,358 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 14:59:44,368 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_41-traces-ex-7_unknown_1_pos.i[1097,1110] [2024-01-27 14:59:44,369 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 Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-27 14:59:44,455 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 14:59:44,503 INFO L206 MainTranslator]: Completed translation [2024-01-27 14:59:44,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:59:44 WrapperNode [2024-01-27 14:59:44,516 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 14:59:44,517 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 14:59:44,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 14:59:44,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 14:59:44,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:59:44" (1/1) ... [2024-01-27 14:59:44,543 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:59:44" (1/1) ... [2024-01-27 14:59:44,569 INFO L138 Inliner]: procedures = 163, calls = 31, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2024-01-27 14:59:44,569 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 14:59:44,570 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 14:59:44,570 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 14:59:44,570 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 14:59:44,578 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:59:44" (1/1) ... [2024-01-27 14:59:44,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:59:44" (1/1) ... [2024-01-27 14:59:44,581 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:59:44" (1/1) ... [2024-01-27 14:59:44,599 INFO L175 MemorySlicer]: Split 13 memory accesses to 4 slices as follows [2, 5, 5, 1]. 38 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-27 14:59:44,600 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:59:44" (1/1) ... [2024-01-27 14:59:44,600 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:59:44" (1/1) ... [2024-01-27 14:59:44,611 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:59:44" (1/1) ... [2024-01-27 14:59:44,618 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:59:44" (1/1) ... [2024-01-27 14:59:44,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:59:44" (1/1) ... [2024-01-27 14:59:44,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:59:44" (1/1) ... [2024-01-27 14:59:44,621 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 14:59:44,622 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 14:59:44,622 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 14:59:44,622 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 14:59:44,632 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:59:44" (1/1) ... [2024-01-27 14:59:44,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 14:59:44,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 14:59:44,673 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-27 14:59:44,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-27 14:59:44,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 14:59:44,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 14:59:44,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 14:59:44,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 14:59:44,708 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-27 14:59:44,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 14:59:44,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 14:59:44,709 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-01-27 14:59:44,710 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-01-27 14:59:44,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 14:59:44,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 14:59:44,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 14:59:44,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 14:59:44,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 14:59:44,711 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-27 14:59:44,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 14:59:44,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 14:59:44,712 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 14:59:44,831 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 14:59:44,842 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 14:59:45,052 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 14:59:45,052 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 14:59:45,139 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 14:59:45,139 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-27 14:59:45,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 02:59:45 BoogieIcfgContainer [2024-01-27 14:59:45,140 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 14:59:45,141 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 14:59:45,141 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 14:59:45,143 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 14:59:45,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 02:59:42" (1/4) ... [2024-01-27 14:59:45,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@171f1230 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.01 02:59:45, skipping insertion in model container [2024-01-27 14:59:45,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 02:59:43" (2/4) ... [2024-01-27 14:59:45,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@171f1230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 02:59:45, skipping insertion in model container [2024-01-27 14:59:45,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 02:59:44" (3/4) ... [2024-01-27 14:59:45,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@171f1230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 02:59:45, skipping insertion in model container [2024-01-27 14:59:45,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 02:59:45" (4/4) ... [2024-01-27 14:59:45,146 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_41-traces-ex-7_unknown_1_pos.i [2024-01-27 14:59:45,158 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 14:59:45,159 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 40 error locations. [2024-01-27 14:59:45,159 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 14:59:45,197 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-27 14:59:45,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 102 transitions, 208 flow [2024-01-27 14:59:45,269 INFO L124 PetriNetUnfolderBase]: 1/101 cut-off events. [2024-01-27 14:59:45,269 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 14:59:45,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 101 events. 1/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 206 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2024-01-27 14:59:45,273 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 102 transitions, 208 flow [2024-01-27 14:59:45,277 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 101 transitions, 205 flow [2024-01-27 14:59:45,289 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 14:59:45,296 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;@15ad091, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 14:59:45,296 INFO L358 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2024-01-27 14:59:45,298 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 14:59:45,299 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-27 14:59:45,299 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 14:59:45,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:59:45,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-27 14:59:45,300 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 56 more)] === [2024-01-27 14:59:45,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:59:45,304 INFO L85 PathProgramCache]: Analyzing trace with hash 8808, now seen corresponding path program 1 times [2024-01-27 14:59:45,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:59:45,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789789630] [2024-01-27 14:59:45,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:59:45,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:59:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:59:45,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:59:45,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:59:45,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789789630] [2024-01-27 14:59:45,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789789630] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:59:45,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:59:45,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 14:59:45,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85015458] [2024-01-27 14:59:45,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:59:45,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:59:45,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:59:45,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:59:45,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:59:45,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 102 [2024-01-27 14:59:45,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 101 transitions, 205 flow. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 14:59:45,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:59:45,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 102 [2024-01-27 14:59:45,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:59:45,779 INFO L124 PetriNetUnfolderBase]: 156/590 cut-off events. [2024-01-27 14:59:45,779 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 14:59:45,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 945 conditions, 590 events. 156/590 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3821 event pairs, 114 based on Foata normal form. 118/656 useless extension candidates. Maximal degree in co-relation 934. Up to 311 conditions per place. [2024-01-27 14:59:45,786 INFO L140 encePairwiseOnDemand]: 68/102 looper letters, 43 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2024-01-27 14:59:45,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 96 transitions, 285 flow [2024-01-27 14:59:45,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:59:45,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:59:45,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions. [2024-01-27 14:59:45,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7647058823529411 [2024-01-27 14:59:45,805 INFO L175 Difference]: Start difference. First operand has 104 places, 101 transitions, 205 flow. Second operand 3 states and 234 transitions. [2024-01-27 14:59:45,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 96 transitions, 285 flow [2024-01-27 14:59:45,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 96 transitions, 284 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 14:59:45,817 INFO L231 Difference]: Finished difference. Result has 95 places, 89 transitions, 226 flow [2024-01-27 14:59:45,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=95, PETRI_TRANSITIONS=89} [2024-01-27 14:59:45,822 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -9 predicate places. [2024-01-27 14:59:45,822 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 89 transitions, 226 flow [2024-01-27 14:59:45,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 14:59:45,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:59:45,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-27 14:59:45,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 14:59:45,824 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 56 more)] === [2024-01-27 14:59:45,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:59:45,825 INFO L85 PathProgramCache]: Analyzing trace with hash 262789893, now seen corresponding path program 1 times [2024-01-27 14:59:45,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:59:45,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334875003] [2024-01-27 14:59:45,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:59:45,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:59:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:59:46,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:59:46,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:59:46,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334875003] [2024-01-27 14:59:46,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334875003] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:59:46,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:59:46,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 14:59:46,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581941333] [2024-01-27 14:59:46,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:59:46,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:59:46,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:59:46,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:59:46,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:59:46,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 102 [2024-01-27 14:59:46,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 89 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 79.25) internal successors, (317), 4 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 14:59:46,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:59:46,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 102 [2024-01-27 14:59:46,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:59:46,140 INFO L124 PetriNetUnfolderBase]: 49/335 cut-off events. [2024-01-27 14:59:46,140 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-01-27 14:59:46,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 335 events. 49/335 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1657 event pairs, 0 based on Foata normal form. 40/354 useless extension candidates. Maximal degree in co-relation 480. Up to 105 conditions per place. [2024-01-27 14:59:46,144 INFO L140 encePairwiseOnDemand]: 94/102 looper letters, 22 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2024-01-27 14:59:46,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 90 transitions, 276 flow [2024-01-27 14:59:46,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 14:59:46,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 14:59:46,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 342 transitions. [2024-01-27 14:59:46,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8382352941176471 [2024-01-27 14:59:46,148 INFO L175 Difference]: Start difference. First operand has 95 places, 89 transitions, 226 flow. Second operand 4 states and 342 transitions. [2024-01-27 14:59:46,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 90 transitions, 276 flow [2024-01-27 14:59:46,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 90 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:59:46,152 INFO L231 Difference]: Finished difference. Result has 90 places, 83 transitions, 214 flow [2024-01-27 14:59:46,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=214, PETRI_PLACES=90, PETRI_TRANSITIONS=83} [2024-01-27 14:59:46,152 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -14 predicate places. [2024-01-27 14:59:46,153 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 83 transitions, 214 flow [2024-01-27 14:59:46,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.25) internal successors, (317), 4 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 14:59:46,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:59:46,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:59:46,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 14:59:46,153 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr14ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 56 more)] === [2024-01-27 14:59:46,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:59:46,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1247592629, now seen corresponding path program 1 times [2024-01-27 14:59:46,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:59:46,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593436523] [2024-01-27 14:59:46,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:59:46,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:59:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:59:46,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:59:46,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:59:46,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593436523] [2024-01-27 14:59:46,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593436523] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:59:46,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:59:46,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 14:59:46,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712886085] [2024-01-27 14:59:46,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:59:46,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 14:59:46,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:59:46,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 14:59:46,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 14:59:46,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 102 [2024-01-27 14:59:46,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 83 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 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-27 14:59:46,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:59:46,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 102 [2024-01-27 14:59:46,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:59:46,361 INFO L124 PetriNetUnfolderBase]: 56/249 cut-off events. [2024-01-27 14:59:46,362 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2024-01-27 14:59:46,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 249 events. 56/249 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1088 event pairs, 14 based on Foata normal form. 120/361 useless extension candidates. Maximal degree in co-relation 382. Up to 90 conditions per place. [2024-01-27 14:59:46,363 INFO L140 encePairwiseOnDemand]: 79/102 looper letters, 20 selfloop transitions, 1 changer transitions 8/68 dead transitions. [2024-01-27 14:59:46,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 68 transitions, 194 flow [2024-01-27 14:59:46,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 14:59:46,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 14:59:46,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 200 transitions. [2024-01-27 14:59:46,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6535947712418301 [2024-01-27 14:59:46,365 INFO L175 Difference]: Start difference. First operand has 90 places, 83 transitions, 214 flow. Second operand 3 states and 200 transitions. [2024-01-27 14:59:46,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 68 transitions, 194 flow [2024-01-27 14:59:46,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 68 transitions, 189 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 14:59:46,367 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 115 flow [2024-01-27 14:59:46,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2024-01-27 14:59:46,368 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -37 predicate places. [2024-01-27 14:59:46,369 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 115 flow [2024-01-27 14:59:46,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 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-27 14:59:46,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:59:46,369 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] [2024-01-27 14:59:46,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 14:59:46,370 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 56 more)] === [2024-01-27 14:59:46,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:59:46,371 INFO L85 PathProgramCache]: Analyzing trace with hash 2137343101, now seen corresponding path program 1 times [2024-01-27 14:59:46,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:59:46,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587278173] [2024-01-27 14:59:46,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:59:46,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:59:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:59:46,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:59:46,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:59:46,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587278173] [2024-01-27 14:59:46,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587278173] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:59:46,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:59:46,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 14:59:46,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101032336] [2024-01-27 14:59:46,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:59:46,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:59:46,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:59:46,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:59:46,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:59:46,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 102 [2024-01-27 14:59:46,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 14:59:46,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:59:46,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 102 [2024-01-27 14:59:46,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:59:46,638 INFO L124 PetriNetUnfolderBase]: 58/234 cut-off events. [2024-01-27 14:59:46,638 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-01-27 14:59:46,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 382 conditions, 234 events. 58/234 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 961 event pairs, 18 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 371. Up to 77 conditions per place. [2024-01-27 14:59:46,639 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 19 selfloop transitions, 2 changer transitions 12/70 dead transitions. [2024-01-27 14:59:46,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 70 transitions, 213 flow [2024-01-27 14:59:46,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 14:59:46,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 14:59:46,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 285 transitions. [2024-01-27 14:59:46,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5588235294117647 [2024-01-27 14:59:46,642 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 115 flow. Second operand 5 states and 285 transitions. [2024-01-27 14:59:46,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 70 transitions, 213 flow [2024-01-27 14:59:46,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 70 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 14:59:46,644 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 124 flow [2024-01-27 14:59:46,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2024-01-27 14:59:46,644 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -37 predicate places. [2024-01-27 14:59:46,645 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 124 flow [2024-01-27 14:59:46,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 14:59:46,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:59:46,645 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:59:46,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 14:59:46,645 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 56 more)] === [2024-01-27 14:59:46,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:59:46,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1019762041, now seen corresponding path program 1 times [2024-01-27 14:59:46,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:59:46,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782265008] [2024-01-27 14:59:46,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:59:46,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:59:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:59:46,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:59:46,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:59:46,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782265008] [2024-01-27 14:59:46,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782265008] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:59:46,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:59:46,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 14:59:46,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833376961] [2024-01-27 14:59:46,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:59:46,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 14:59:46,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:59:46,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 14:59:46,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-27 14:59:46,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 102 [2024-01-27 14:59:46,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 14:59:46,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:59:46,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 102 [2024-01-27 14:59:46,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:59:46,814 INFO L124 PetriNetUnfolderBase]: 13/159 cut-off events. [2024-01-27 14:59:46,815 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-01-27 14:59:46,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 159 events. 13/159 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 376 event pairs, 5 based on Foata normal form. 6/163 useless extension candidates. Maximal degree in co-relation 218. Up to 27 conditions per place. [2024-01-27 14:59:46,815 INFO L140 encePairwiseOnDemand]: 97/102 looper letters, 12 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2024-01-27 14:59:46,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 57 transitions, 166 flow [2024-01-27 14:59:46,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 14:59:46,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 14:59:46,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2024-01-27 14:59:46,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8799019607843137 [2024-01-27 14:59:46,816 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 124 flow. Second operand 4 states and 359 transitions. [2024-01-27 14:59:46,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 57 transitions, 166 flow [2024-01-27 14:59:46,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 57 transitions, 158 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-01-27 14:59:46,818 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 126 flow [2024-01-27 14:59:46,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2024-01-27 14:59:46,818 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -41 predicate places. [2024-01-27 14:59:46,818 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 126 flow [2024-01-27 14:59:46,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 14:59:46,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:59:46,819 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:59:46,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 14:59:46,819 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 56 more)] === [2024-01-27 14:59:46,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:59:46,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1099164685, now seen corresponding path program 2 times [2024-01-27 14:59:46,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:59:46,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361377464] [2024-01-27 14:59:46,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:59:46,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:59:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 14:59:46,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 14:59:46,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 14:59:46,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361377464] [2024-01-27 14:59:46,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361377464] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 14:59:46,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 14:59:46,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 14:59:46,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709927523] [2024-01-27 14:59:46,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 14:59:46,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 14:59:46,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 14:59:46,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 14:59:46,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-01-27 14:59:46,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 102 [2024-01-27 14:59:46,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 14:59:46,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 14:59:46,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 102 [2024-01-27 14:59:46,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 14:59:46,989 INFO L124 PetriNetUnfolderBase]: 10/129 cut-off events. [2024-01-27 14:59:46,989 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-01-27 14:59:46,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 129 events. 10/129 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 214 event pairs, 5 based on Foata normal form. 1/126 useless extension candidates. Maximal degree in co-relation 179. Up to 20 conditions per place. [2024-01-27 14:59:46,990 INFO L140 encePairwiseOnDemand]: 98/102 looper letters, 12 selfloop transitions, 4 changer transitions 1/57 dead transitions. [2024-01-27 14:59:46,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 168 flow [2024-01-27 14:59:46,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 14:59:46,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 14:59:46,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 358 transitions. [2024-01-27 14:59:46,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8774509803921569 [2024-01-27 14:59:46,991 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 126 flow. Second operand 4 states and 358 transitions. [2024-01-27 14:59:46,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 168 flow [2024-01-27 14:59:46,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 57 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 14:59:46,992 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 129 flow [2024-01-27 14:59:46,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2024-01-27 14:59:46,993 INFO L281 CegarLoopForPetriNet]: 104 programPoint places, -40 predicate places. [2024-01-27 14:59:46,993 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 129 flow [2024-01-27 14:59:46,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 14:59:46,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 14:59:46,993 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 14:59:46,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 14:59:46,993 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 56 more)] === [2024-01-27 14:59:46,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 14:59:46,994 INFO L85 PathProgramCache]: Analyzing trace with hash -2113212024, now seen corresponding path program 1 times [2024-01-27 14:59:46,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 14:59:46,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683343196] [2024-01-27 14:59:46,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 14:59:46,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 14:59:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 14:59:47,009 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 14:59:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 14:59:47,040 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 14:59:47,040 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 14:59:47,041 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (58 of 59 remaining) [2024-01-27 14:59:47,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 59 remaining) [2024-01-27 14:59:47,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 59 remaining) [2024-01-27 14:59:47,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 59 remaining) [2024-01-27 14:59:47,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 59 remaining) [2024-01-27 14:59:47,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 59 remaining) [2024-01-27 14:59:47,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 59 remaining) [2024-01-27 14:59:47,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 59 remaining) [2024-01-27 14:59:47,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 59 remaining) [2024-01-27 14:59:47,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 59 remaining) [2024-01-27 14:59:47,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 59 remaining) [2024-01-27 14:59:47,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 59 remaining) [2024-01-27 14:59:47,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 59 remaining) [2024-01-27 14:59:47,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 59 remaining) [2024-01-27 14:59:47,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 59 remaining) [2024-01-27 14:59:47,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 59 remaining) [2024-01-27 14:59:47,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 59 remaining) [2024-01-27 14:59:47,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 59 remaining) [2024-01-27 14:59:47,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 59 remaining) [2024-01-27 14:59:47,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 59 remaining) [2024-01-27 14:59:47,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 59 remaining) [2024-01-27 14:59:47,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 59 remaining) [2024-01-27 14:59:47,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 59 remaining) [2024-01-27 14:59:47,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 59 remaining) [2024-01-27 14:59:47,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 59 remaining) [2024-01-27 14:59:47,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 59 remaining) [2024-01-27 14:59:47,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 59 remaining) [2024-01-27 14:59:47,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 59 remaining) [2024-01-27 14:59:47,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 59 remaining) [2024-01-27 14:59:47,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 59 remaining) [2024-01-27 14:59:47,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 59 remaining) [2024-01-27 14:59:47,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 59 remaining) [2024-01-27 14:59:47,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 59 remaining) [2024-01-27 14:59:47,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 59 remaining) [2024-01-27 14:59:47,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 59 remaining) [2024-01-27 14:59:47,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr12ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 59 remaining) [2024-01-27 14:59:47,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr13ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 59 remaining) [2024-01-27 14:59:47,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr14ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 59 remaining) [2024-01-27 14:59:47,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr15ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 59 remaining) [2024-01-27 14:59:47,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr16ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 59 remaining) [2024-01-27 14:59:47,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr17ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 59 remaining) [2024-01-27 14:59:47,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 59 remaining) [2024-01-27 14:59:47,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 59 remaining) [2024-01-27 14:59:47,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 59 remaining) [2024-01-27 14:59:47,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 59 remaining) [2024-01-27 14:59:47,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 59 remaining) [2024-01-27 14:59:47,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 59 remaining) [2024-01-27 14:59:47,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 59 remaining) [2024-01-27 14:59:47,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 59 remaining) [2024-01-27 14:59:47,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 59 remaining) [2024-01-27 14:59:47,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 59 remaining) [2024-01-27 14:59:47,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 59 remaining) [2024-01-27 14:59:47,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 59 remaining) [2024-01-27 14:59:47,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr12ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 59 remaining) [2024-01-27 14:59:47,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr13ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 59 remaining) [2024-01-27 14:59:47,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr14ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 59 remaining) [2024-01-27 14:59:47,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr15ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 59 remaining) [2024-01-27 14:59:47,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr16ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 59 remaining) [2024-01-27 14:59:47,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr17ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 59 remaining) [2024-01-27 14:59:47,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 14:59:47,047 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2024-01-27 14:59:47,052 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 14:59:47,052 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 14:59:47,079 INFO L503 ceAbstractionStarter]: Automizer considered 39 witness invariants [2024-01-27 14:59:47,080 INFO L504 ceAbstractionStarter]: WitnessConsidered=39 [2024-01-27 14:59:47,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 02:59:47 BasicIcfg [2024-01-27 14:59:47,080 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 14:59:47,081 INFO L158 Benchmark]: Toolchain (without parser) took 3115.75ms. Allocated memory was 157.3MB in the beginning and 251.7MB in the end (delta: 94.4MB). Free memory was 96.5MB in the beginning and 184.2MB in the end (delta: -87.7MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2024-01-27 14:59:47,081 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 157.3MB. Free memory was 118.6MB in the beginning and 118.5MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 14:59:47,081 INFO L158 Benchmark]: CDTParser took 0.65ms. Allocated memory is still 157.3MB. Free memory is still 114.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 14:59:47,081 INFO L158 Benchmark]: CACSL2BoogieTranslator took 547.93ms. Allocated memory is still 157.3MB. Free memory was 96.2MB in the beginning and 123.2MB in the end (delta: -27.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-01-27 14:59:47,081 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.81ms. Allocated memory is still 157.3MB. Free memory was 123.2MB in the beginning and 121.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 14:59:47,081 INFO L158 Benchmark]: Boogie Preprocessor took 51.37ms. Allocated memory is still 157.3MB. Free memory was 121.1MB in the beginning and 119.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 14:59:47,082 INFO L158 Benchmark]: RCFGBuilder took 517.97ms. Allocated memory is still 157.3MB. Free memory was 119.0MB in the beginning and 89.6MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-01-27 14:59:47,082 INFO L158 Benchmark]: TraceAbstraction took 1939.25ms. Allocated memory was 157.3MB in the beginning and 251.7MB in the end (delta: 94.4MB). Free memory was 88.8MB in the beginning and 184.2MB in the end (delta: -95.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 14:59:47,083 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.15ms. Allocated memory is still 157.3MB. Free memory was 118.6MB in the beginning and 118.5MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.65ms. Allocated memory is still 157.3MB. Free memory is still 114.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 547.93ms. Allocated memory is still 157.3MB. Free memory was 96.2MB in the beginning and 123.2MB in the end (delta: -27.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.81ms. Allocated memory is still 157.3MB. Free memory was 123.2MB in the beginning and 121.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.37ms. Allocated memory is still 157.3MB. Free memory was 121.1MB in the beginning and 119.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 517.97ms. Allocated memory is still 157.3MB. Free memory was 119.0MB in the beginning and 89.6MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1939.25ms. Allocated memory was 157.3MB in the beginning and 251.7MB in the end (delta: 94.4MB). Free memory was 88.8MB in the beginning and 184.2MB in the end (delta: -95.4MB). There was no memory consumed. 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 g = 0; [L682] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L682] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t D = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t D = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t D = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t D = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t D = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L683] 0 pthread_mutex_t D = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L693] 0 pthread_t id; VAL [A={3:0}, D={4:0}, g=0, id={5:0}] [L694] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[0]]]] [L694] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [A={3:0}, D={4:0}, arg={0:0}, g=0, id={5:0}] [L685] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=0] [L686] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=0] [L686] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[g],IntegerLiteral[17]],IntegerLiteral[0]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=0] [L686] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=0] [L686] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=0] [L686] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[17]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=0] [L686] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=0] [L687] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=0] [L687] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=0] [L687] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=0] [L687] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[17]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=0] [L687] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[g],IntegerLiteral[17]],IntegerLiteral[0]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=0] [L687] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]]]] [L687] 1 g = 17 VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17] [L688] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17] [L688] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17] [L689] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17] [L689] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17] [L696] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[17]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17, id={5:0}] [L696] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17, id={5:0}] [L696] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17, id={5:0}] [L696] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[g],IntegerLiteral[17]],IntegerLiteral[0]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17, id={5:0}] [L696] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17, id={5:0}] [L697] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[g],IntegerLiteral[17]],IntegerLiteral[0]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17, id={5:0}] [L697] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17, id={5:0}] [L697] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17, id={5:0}] [L697] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17, id={5:0}] [L697] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[17]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17, id={5:0}] [L698] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,BinaryExpression[ARITHMOD,IdentifierExpression[g],IntegerLiteral[17]],IntegerLiteral[0]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17, id={5:0}] [L698] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17, id={5:0}] [L698] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[17]]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17, id={5:0}] [L698] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[127]]]] VAL [A={3:0}, D={4:0}, arg={0:0}, arg={0:0}, g=17, id={5:0}] [L698] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[17]]]] [L698] CALL 0 __VERIFIER_assert(g == 0) [L19] COND TRUE 0 !(cond) VAL [A={3:0}, D={4:0}, \old(cond)=0, arg={0:0}, arg={0:0}, cond=0, g=17] [L19] 0 reach_error() VAL [A={3:0}, D={4:0}, \old(cond)=0, arg={0:0}, arg={0:0}, cond=0, g=17] - UnprovableResult [Line: 694]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 696]: 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 invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - 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: 697]: 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 invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - 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: 698]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 698]: 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: 694]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 149 locations, 59 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: 1.8s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 539 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 330 mSDsluCounter, 88 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 458 IncrementalHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 85 mSDtfsCounter, 458 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=226occurred in iteration=1, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 199 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 141 ConstructedInterpolants, 0 QuantifiedInterpolants, 581 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-27 14:59:47,104 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