./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/13-privatized_47-refine-protected2_true.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_47-refine-protected2_true.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cb09d658 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_47-refine-protected2_true.i ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/13-privatized_47-refine-protected2_true.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-cb09d65-m [2024-01-27 23:07:02,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 23:07:02,783 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 23:07:02,788 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 23:07:02,788 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 23:07:02,831 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 23:07:02,832 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 23:07:02,832 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 23:07:02,832 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 23:07:02,835 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 23:07:02,836 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 23:07:02,836 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 23:07:02,837 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 23:07:02,838 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 23:07:02,838 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 23:07:02,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 23:07:02,838 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 23:07:02,838 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 23:07:02,839 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 23:07:02,839 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 23:07:02,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 23:07:02,839 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 23:07:02,840 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 23:07:02,840 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 23:07:02,840 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 23:07:02,840 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 23:07:02,840 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 23:07:02,841 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 23:07:02,841 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 23:07:02,841 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 23:07:02,842 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 23:07:02,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 23:07:02,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 23:07:02,843 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 23:07:02,843 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 23:07:02,843 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 23:07:02,843 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 23:07:02,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 23:07:02,843 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 23:07:02,843 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 23:07:02,844 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 23:07:02,844 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 23:07:02,844 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 23:07:02,844 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 23:07:03,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 23:07:03,114 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 23:07:03,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 23:07:03,118 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-27 23:07:03,119 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-27 23:07:03,120 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_47-refine-protected2_true.yml/witness.yml [2024-01-27 23:07:03,180 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 23:07:03,180 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 23:07:03,181 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_47-refine-protected2_true.i [2024-01-27 23:07:04,237 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 23:07:04,410 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 23:07:04,410 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_47-refine-protected2_true.i [2024-01-27 23:07:04,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d36c7b6d3/e495574d4cdf46dd91290598f4ebd8db/FLAGe37e27e71 [2024-01-27 23:07:04,434 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d36c7b6d3/e495574d4cdf46dd91290598f4ebd8db [2024-01-27 23:07:04,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 23:07:04,435 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-27 23:07:04,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 23:07:04,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 23:07:04,442 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 23:07:04,443 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:07:03" (1/2) ... [2024-01-27 23:07:04,443 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2708e109 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:07:04, skipping insertion in model container [2024-01-27 23:07:04,444 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:07:03" (1/2) ... [2024-01-27 23:07:04,445 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6d55198 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:07:04, skipping insertion in model container [2024-01-27 23:07:04,445 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:07:04" (2/2) ... [2024-01-27 23:07:04,445 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2708e109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:04, skipping insertion in model container [2024-01-27 23:07:04,445 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:07:04" (2/2) ... [2024-01-27 23:07:04,446 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-27 23:07:04,483 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-27 23:07:04,485 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] g <= 1 [2024-01-27 23:07:04,485 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] g == 0 || g == 1 [2024-01-27 23:07:04,485 INFO L98 nessWitnessExtractor]: Location invariant before [L697-L697] 0 <= g [2024-01-27 23:07:04,485 INFO L98 nessWitnessExtractor]: Location invariant before [L691-L691] g == 0 [2024-01-27 23:07:04,486 INFO L98 nessWitnessExtractor]: Location invariant before [L687-L687] (unsigned long )arg == 0UL [2024-01-27 23:07:04,486 INFO L98 nessWitnessExtractor]: Location invariant before [L694-L694] g == 1 [2024-01-27 23:07:04,486 INFO L98 nessWitnessExtractor]: Location invariant before [L684-L684] (unsigned long )arg == 0UL [2024-01-27 23:07:04,486 INFO L98 nessWitnessExtractor]: Location invariant before [L686-L686] g == 1 [2024-01-27 23:07:04,487 INFO L98 nessWitnessExtractor]: Location invariant before [L686-L686] (unsigned long )arg == 0UL [2024-01-27 23:07:04,487 INFO L98 nessWitnessExtractor]: Location invariant before [L685-L685] 0 <= g [2024-01-27 23:07:04,487 INFO L98 nessWitnessExtractor]: Location invariant before [L685-L685] g <= 1 [2024-01-27 23:07:04,487 INFO L98 nessWitnessExtractor]: Location invariant before [L685-L685] (unsigned long )arg == 0UL [2024-01-27 23:07:04,487 INFO L98 nessWitnessExtractor]: Location invariant before [L685-L685] g == 0 || g == 1 [2024-01-27 23:07:04,487 INFO L98 nessWitnessExtractor]: Location invariant before [L693-L696] 0 <= g [2024-01-27 23:07:04,487 INFO L98 nessWitnessExtractor]: Location invariant before [L693-L696] g == 0 || g == 1 [2024-01-27 23:07:04,488 INFO L98 nessWitnessExtractor]: Location invariant after [L693-L696] g == 0 [2024-01-27 23:07:04,488 INFO L98 nessWitnessExtractor]: Location invariant before [L693-L696] g <= 1 [2024-01-27 23:07:04,488 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] g <= 1 [2024-01-27 23:07:04,488 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] 0 <= g [2024-01-27 23:07:04,488 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] g == 0 || g == 1 [2024-01-27 23:07:04,488 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] g <= 1 [2024-01-27 23:07:04,489 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] 0 <= g [2024-01-27 23:07:04,489 INFO L98 nessWitnessExtractor]: Location invariant before [L19-L19] g == 0 || g == 1 [2024-01-27 23:07:04,527 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 23:07:04,659 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_47-refine-protected2_true.i[1094,1107] [2024-01-27 23:07:04,746 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 23:07:04,762 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 23:07:04,773 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_47-refine-protected2_true.i[1094,1107] [2024-01-27 23:07:04,774 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 [2024-01-27 23:07:04,823 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 23:07:04,852 INFO L206 MainTranslator]: Completed translation [2024-01-27 23:07:04,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:04 WrapperNode [2024-01-27 23:07:04,853 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 23:07:04,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 23:07:04,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 23:07:04,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 23:07:04,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:04" (1/1) ... [2024-01-27 23:07:04,897 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:04" (1/1) ... [2024-01-27 23:07:04,911 INFO L138 Inliner]: procedures = 163, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 57 [2024-01-27 23:07:04,913 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 23:07:04,914 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 23:07:04,914 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 23:07:04,915 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 23:07:04,924 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:04" (1/1) ... [2024-01-27 23:07:04,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:04" (1/1) ... [2024-01-27 23:07:04,957 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:04" (1/1) ... [2024-01-27 23:07:04,976 INFO L175 MemorySlicer]: Split 8 memory accesses to 3 slices as follows [2, 5, 1]. 63 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 1 writes are split as follows [0, 0, 1]. [2024-01-27 23:07:04,976 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:04" (1/1) ... [2024-01-27 23:07:04,976 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:04" (1/1) ... [2024-01-27 23:07:04,988 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:04" (1/1) ... [2024-01-27 23:07:04,991 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:04" (1/1) ... [2024-01-27 23:07:04,996 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:04" (1/1) ... [2024-01-27 23:07:05,002 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:04" (1/1) ... [2024-01-27 23:07:05,004 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 23:07:05,009 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 23:07:05,009 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 23:07:05,010 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 23:07:05,010 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:04" (1/1) ... [2024-01-27 23:07:05,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 23:07:05,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 23:07:05,037 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 23:07:05,043 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 23:07:05,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 23:07:05,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 23:07:05,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 23:07:05,094 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-27 23:07:05,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 23:07:05,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 23:07:05,094 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-01-27 23:07:05,094 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-01-27 23:07:05,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 23:07:05,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 23:07:05,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 23:07:05,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 23:07:05,095 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-27 23:07:05,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 23:07:05,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 23:07:05,096 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 23:07:05,244 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 23:07:05,245 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 23:07:05,376 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 23:07:05,376 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 23:07:05,433 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 23:07:05,433 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-27 23:07:05,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:07:05 BoogieIcfgContainer [2024-01-27 23:07:05,436 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 23:07:05,437 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 23:07:05,437 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 23:07:05,440 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 23:07:05,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:07:03" (1/4) ... [2024-01-27 23:07:05,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f86e13b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.01 11:07:05, skipping insertion in model container [2024-01-27 23:07:05,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 11:07:04" (2/4) ... [2024-01-27 23:07:05,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f86e13b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:07:05, skipping insertion in model container [2024-01-27 23:07:05,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:07:04" (3/4) ... [2024-01-27 23:07:05,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f86e13b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:07:05, skipping insertion in model container [2024-01-27 23:07:05,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:07:05" (4/4) ... [2024-01-27 23:07:05,443 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_47-refine-protected2_true.i [2024-01-27 23:07:05,455 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 23:07:05,456 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2024-01-27 23:07:05,456 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 23:07:05,498 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-27 23:07:05,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 59 transitions, 122 flow [2024-01-27 23:07:05,571 INFO L124 PetriNetUnfolderBase]: 3/58 cut-off events. [2024-01-27 23:07:05,574 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 23:07:05,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 58 events. 3/58 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 138 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2024-01-27 23:07:05,578 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 59 transitions, 122 flow [2024-01-27 23:07:05,583 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 58 transitions, 119 flow [2024-01-27 23:07:05,597 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 23:07:05,604 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;@2ce046e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 23:07:05,604 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2024-01-27 23:07:05,608 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 23:07:05,609 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-27 23:07:05,609 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 23:07:05,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:07:05,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-27 23:07:05,611 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 25 more)] === [2024-01-27 23:07:05,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:07:05,614 INFO L85 PathProgramCache]: Analyzing trace with hash 7183, now seen corresponding path program 1 times [2024-01-27 23:07:05,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:07:05,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234364447] [2024-01-27 23:07:05,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:07:05,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:07:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:07:05,788 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 23:07:05,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:07:05,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234364447] [2024-01-27 23:07:05,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234364447] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:07:05,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:07:05,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:07:05,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669061232] [2024-01-27 23:07:05,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:07:05,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:07:05,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:07:05,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:07:05,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:07:05,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2024-01-27 23:07:05,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 58 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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 23:07:05,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:07:05,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2024-01-27 23:07:05,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:07:06,003 INFO L124 PetriNetUnfolderBase]: 72/292 cut-off events. [2024-01-27 23:07:06,004 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 23:07:06,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 292 events. 72/292 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1642 event pairs, 34 based on Foata normal form. 56/316 useless extension candidates. Maximal degree in co-relation 464. Up to 120 conditions per place. [2024-01-27 23:07:06,008 INFO L140 encePairwiseOnDemand]: 40/59 looper letters, 30 selfloop transitions, 4 changer transitions 0/61 dead transitions. [2024-01-27 23:07:06,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 61 transitions, 193 flow [2024-01-27 23:07:06,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:07:06,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:07:06,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2024-01-27 23:07:06,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7570621468926554 [2024-01-27 23:07:06,021 INFO L175 Difference]: Start difference. First operand has 59 places, 58 transitions, 119 flow. Second operand 3 states and 134 transitions. [2024-01-27 23:07:06,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 61 transitions, 193 flow [2024-01-27 23:07:06,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 61 transitions, 192 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 23:07:06,030 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 148 flow [2024-01-27 23:07:06,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2024-01-27 23:07:06,034 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -1 predicate places. [2024-01-27 23:07:06,035 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 148 flow [2024-01-27 23:07:06,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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 23:07:06,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:07:06,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-27 23:07:06,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 23:07:06,036 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 25 more)] === [2024-01-27 23:07:06,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:07:06,037 INFO L85 PathProgramCache]: Analyzing trace with hash 214264105, now seen corresponding path program 1 times [2024-01-27 23:07:06,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:07:06,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17924879] [2024-01-27 23:07:06,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:07:06,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:07:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:07:06,175 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 23:07:06,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:07:06,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17924879] [2024-01-27 23:07:06,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17924879] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:07:06,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:07:06,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 23:07:06,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536996333] [2024-01-27 23:07:06,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:07:06,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 23:07:06,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:07:06,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 23:07:06,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 23:07:06,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 59 [2024-01-27 23:07:06,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 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 23:07:06,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:07:06,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 59 [2024-01-27 23:07:06,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:07:06,254 INFO L124 PetriNetUnfolderBase]: 51/233 cut-off events. [2024-01-27 23:07:06,255 INFO L125 PetriNetUnfolderBase]: For 39/41 co-relation queries the response was YES. [2024-01-27 23:07:06,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 233 events. 51/233 cut-off events. For 39/41 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1163 event pairs, 31 based on Foata normal form. 26/243 useless extension candidates. Maximal degree in co-relation 401. Up to 99 conditions per place. [2024-01-27 23:07:06,256 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 21 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2024-01-27 23:07:06,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 56 transitions, 200 flow [2024-01-27 23:07:06,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 23:07:06,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 23:07:06,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2024-01-27 23:07:06,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7372881355932204 [2024-01-27 23:07:06,258 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 148 flow. Second operand 4 states and 174 transitions. [2024-01-27 23:07:06,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 56 transitions, 200 flow [2024-01-27 23:07:06,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 56 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:07:06,260 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 136 flow [2024-01-27 23:07:06,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2024-01-27 23:07:06,261 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2024-01-27 23:07:06,261 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 136 flow [2024-01-27 23:07:06,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 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 23:07:06,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:07:06,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:07:06,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 23:07:06,262 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 25 more)] === [2024-01-27 23:07:06,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:07:06,263 INFO L85 PathProgramCache]: Analyzing trace with hash -986982867, now seen corresponding path program 1 times [2024-01-27 23:07:06,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:07:06,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203771322] [2024-01-27 23:07:06,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:07:06,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:07:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:07:06,323 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 23:07:06,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:07:06,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203771322] [2024-01-27 23:07:06,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203771322] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:07:06,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:07:06,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 23:07:06,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279352233] [2024-01-27 23:07:06,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:07:06,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 23:07:06,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:07:06,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 23:07:06,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 23:07:06,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 59 [2024-01-27 23:07:06,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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 23:07:06,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:07:06,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 59 [2024-01-27 23:07:06,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:07:06,483 INFO L124 PetriNetUnfolderBase]: 82/267 cut-off events. [2024-01-27 23:07:06,483 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-01-27 23:07:06,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 267 events. 82/267 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1367 event pairs, 30 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 540. Up to 109 conditions per place. [2024-01-27 23:07:06,487 INFO L140 encePairwiseOnDemand]: 50/59 looper letters, 30 selfloop transitions, 10 changer transitions 4/61 dead transitions. [2024-01-27 23:07:06,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 61 transitions, 250 flow [2024-01-27 23:07:06,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 23:07:06,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 23:07:06,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions. [2024-01-27 23:07:06,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5661016949152542 [2024-01-27 23:07:06,490 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 136 flow. Second operand 5 states and 167 transitions. [2024-01-27 23:07:06,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 61 transitions, 250 flow [2024-01-27 23:07:06,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 61 transitions, 247 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:07:06,491 INFO L231 Difference]: Finished difference. Result has 53 places, 48 transitions, 151 flow [2024-01-27 23:07:06,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=53, PETRI_TRANSITIONS=48} [2024-01-27 23:07:06,492 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -6 predicate places. [2024-01-27 23:07:06,492 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 48 transitions, 151 flow [2024-01-27 23:07:06,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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 23:07:06,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:07:06,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:07:06,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 23:07:06,493 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 25 more)] === [2024-01-27 23:07:06,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:07:06,494 INFO L85 PathProgramCache]: Analyzing trace with hash -385765872, now seen corresponding path program 1 times [2024-01-27 23:07:06,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:07:06,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930564918] [2024-01-27 23:07:06,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:07:06,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:07:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:07:06,521 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 23:07:06,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:07:06,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930564918] [2024-01-27 23:07:06,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930564918] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:07:06,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:07:06,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 23:07:06,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809928519] [2024-01-27 23:07:06,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:07:06,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:07:06,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:07:06,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:07:06,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:07:06,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 59 [2024-01-27 23:07:06,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 23:07:06,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:07:06,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 59 [2024-01-27 23:07:06,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:07:06,600 INFO L124 PetriNetUnfolderBase]: 36/135 cut-off events. [2024-01-27 23:07:06,600 INFO L125 PetriNetUnfolderBase]: For 73/74 co-relation queries the response was YES. [2024-01-27 23:07:06,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 135 events. 36/135 cut-off events. For 73/74 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 496 event pairs, 12 based on Foata normal form. 43/171 useless extension candidates. Maximal degree in co-relation 271. Up to 65 conditions per place. [2024-01-27 23:07:06,601 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 16 selfloop transitions, 2 changer transitions 8/42 dead transitions. [2024-01-27 23:07:06,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 42 transitions, 165 flow [2024-01-27 23:07:06,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:07:06,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:07:06,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-01-27 23:07:06,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.672316384180791 [2024-01-27 23:07:06,603 INFO L175 Difference]: Start difference. First operand has 53 places, 48 transitions, 151 flow. Second operand 3 states and 119 transitions. [2024-01-27 23:07:06,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 42 transitions, 165 flow [2024-01-27 23:07:06,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 42 transitions, 160 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 23:07:06,604 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 96 flow [2024-01-27 23:07:06,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2024-01-27 23:07:06,605 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -13 predicate places. [2024-01-27 23:07:06,605 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 96 flow [2024-01-27 23:07:06,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 23:07:06,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:07:06,606 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] [2024-01-27 23:07:06,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 23:07:06,606 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 25 more)] === [2024-01-27 23:07:06,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:07:06,607 INFO L85 PathProgramCache]: Analyzing trace with hash 327783134, now seen corresponding path program 1 times [2024-01-27 23:07:06,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:07:06,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946355580] [2024-01-27 23:07:06,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:07:06,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:07:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:07:06,661 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 23:07:06,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:07:06,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946355580] [2024-01-27 23:07:06,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946355580] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:07:06,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:07:06,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 23:07:06,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956566375] [2024-01-27 23:07:06,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:07:06,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:07:06,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:07:06,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:07:06,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:07:06,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 59 [2024-01-27 23:07:06,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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 23:07:06,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:07:06,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 59 [2024-01-27 23:07:06,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:07:06,691 INFO L124 PetriNetUnfolderBase]: 7/62 cut-off events. [2024-01-27 23:07:06,691 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-01-27 23:07:06,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 62 events. 7/62 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 2 based on Foata normal form. 5/65 useless extension candidates. Maximal degree in co-relation 100. Up to 18 conditions per place. [2024-01-27 23:07:06,692 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 10 selfloop transitions, 3 changer transitions 3/32 dead transitions. [2024-01-27 23:07:06,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 32 transitions, 119 flow [2024-01-27 23:07:06,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:07:06,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:07:06,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2024-01-27 23:07:06,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.807909604519774 [2024-01-27 23:07:06,693 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 96 flow. Second operand 3 states and 143 transitions. [2024-01-27 23:07:06,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 32 transitions, 119 flow [2024-01-27 23:07:06,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 32 transitions, 108 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-01-27 23:07:06,694 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 72 flow [2024-01-27 23:07:06,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2024-01-27 23:07:06,695 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -21 predicate places. [2024-01-27 23:07:06,695 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 72 flow [2024-01-27 23:07:06,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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 23:07:06,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:07:06,696 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:07:06,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 23:07:06,696 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 25 more)] === [2024-01-27 23:07:06,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:07:06,697 INFO L85 PathProgramCache]: Analyzing trace with hash 449467246, now seen corresponding path program 1 times [2024-01-27 23:07:06,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:07:06,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584389241] [2024-01-27 23:07:06,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:07:06,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:07:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 23:07:06,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 23:07:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 23:07:06,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 23:07:06,737 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 23:07:06,738 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 28 remaining) [2024-01-27 23:07:06,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 28 remaining) [2024-01-27 23:07:06,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 28 remaining) [2024-01-27 23:07:06,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 28 remaining) [2024-01-27 23:07:06,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 28 remaining) [2024-01-27 23:07:06,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 28 remaining) [2024-01-27 23:07:06,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (21 of 28 remaining) [2024-01-27 23:07:06,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (20 of 28 remaining) [2024-01-27 23:07:06,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 28 remaining) [2024-01-27 23:07:06,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 28 remaining) [2024-01-27 23:07:06,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 28 remaining) [2024-01-27 23:07:06,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 28 remaining) [2024-01-27 23:07:06,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 28 remaining) [2024-01-27 23:07:06,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 28 remaining) [2024-01-27 23:07:06,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 28 remaining) [2024-01-27 23:07:06,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 28 remaining) [2024-01-27 23:07:06,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 28 remaining) [2024-01-27 23:07:06,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 28 remaining) [2024-01-27 23:07:06,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 28 remaining) [2024-01-27 23:07:06,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 28 remaining) [2024-01-27 23:07:06,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 28 remaining) [2024-01-27 23:07:06,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 28 remaining) [2024-01-27 23:07:06,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 28 remaining) [2024-01-27 23:07:06,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 28 remaining) [2024-01-27 23:07:06,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 28 remaining) [2024-01-27 23:07:06,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 28 remaining) [2024-01-27 23:07:06,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 28 remaining) [2024-01-27 23:07:06,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 28 remaining) [2024-01-27 23:07:06,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 23:07:06,744 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-01-27 23:07:06,748 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 23:07:06,748 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 23:07:06,767 INFO L503 ceAbstractionStarter]: Automizer considered 17 witness invariants [2024-01-27 23:07:06,767 INFO L504 ceAbstractionStarter]: WitnessConsidered=17 [2024-01-27 23:07:06,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 11:07:06 BasicIcfg [2024-01-27 23:07:06,767 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 23:07:06,768 INFO L158 Benchmark]: Toolchain (without parser) took 2332.90ms. Allocated memory was 302.0MB in the beginning and 423.6MB in the end (delta: 121.6MB). Free memory was 211.4MB in the beginning and 367.3MB in the end (delta: -155.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 23:07:06,768 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 302.0MB. Free memory is still 261.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 23:07:06,768 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 302.0MB. Free memory is still 258.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 23:07:06,769 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.78ms. Allocated memory is still 302.0MB. Free memory was 211.4MB in the beginning and 188.4MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-01-27 23:07:06,769 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.13ms. Allocated memory is still 302.0MB. Free memory was 188.4MB in the beginning and 186.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 23:07:06,769 INFO L158 Benchmark]: Boogie Preprocessor took 94.54ms. Allocated memory is still 302.0MB. Free memory was 186.3MB in the beginning and 260.5MB in the end (delta: -74.2MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2024-01-27 23:07:06,770 INFO L158 Benchmark]: RCFGBuilder took 426.72ms. Allocated memory is still 302.0MB. Free memory was 260.5MB in the beginning and 244.6MB in the end (delta: 15.8MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2024-01-27 23:07:06,770 INFO L158 Benchmark]: TraceAbstraction took 1330.16ms. Allocated memory was 302.0MB in the beginning and 423.6MB in the end (delta: 121.6MB). Free memory was 243.6MB in the beginning and 367.3MB in the end (delta: -123.7MB). Peak memory consumption was 44.2kB. Max. memory is 16.1GB. [2024-01-27 23:07:06,771 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 302.0MB. Free memory is still 261.4MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.13ms. Allocated memory is still 302.0MB. Free memory is still 258.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 416.78ms. Allocated memory is still 302.0MB. Free memory was 211.4MB in the beginning and 188.4MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.13ms. Allocated memory is still 302.0MB. Free memory was 188.4MB in the beginning and 186.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.54ms. Allocated memory is still 302.0MB. Free memory was 186.3MB in the beginning and 260.5MB in the end (delta: -74.2MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * RCFGBuilder took 426.72ms. Allocated memory is still 302.0MB. Free memory was 260.5MB in the beginning and 244.6MB in the end (delta: 15.8MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1330.16ms. Allocated memory was 302.0MB in the beginning and 423.6MB in the end (delta: 121.6MB). Free memory was 243.6MB in the beginning and 367.3MB in the end (delta: -123.7MB). Peak memory consumption was 44.2kB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 693]: invariant of correctness witness can be violated invariant of correctness witness can be violated 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 } } } }; [L690] 0 pthread_t id; VAL [A={3:0}, g=0, id={5:0}] [L691] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[0]]]] [L691] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [A={3:0}, arg={0:0}, g=0, id={5:0}] [L684] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [A={3:0}, arg={0:0}, arg={0:0}, g=0] [L685] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[1]]]]] VAL [A={3:0}, arg={0:0}, arg={0:0}, g=0] [L685] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [A={3:0}, arg={0:0}, arg={0:0}, g=0] [L685] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[1]]]] VAL [A={3:0}, arg={0:0}, arg={0:0}, g=0] [L685] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]]]] [L685] 1 g = 1 VAL [A={3:0}, arg={0:0}, arg={0:0}, g=1] [L686] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[arg]],IntegerLiteral[0UL]]]] VAL [A={3:0}, arg={0:0}, arg={0:0}, g=1] [L686] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[1]]]] VAL [A={3:0}, arg={0:0}, arg={0:0}, g=1] [L693] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IdentifierExpression[g],IntegerLiteral[1]]]] VAL [A={3:0}, arg={0:0}, arg={0:0}, g=1, id={5:0}] [L693] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[1]]]]] VAL [A={3:0}, arg={0:0}, arg={0:0}, g=1, id={5:0}] [L693] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[g]]]] VAL [A={3:0}, arg={0:0}, arg={0:0}, g=1, id={5:0}] [L693] COND TRUE 0 \read(g) VAL [A={3:0}, arg={0:0}, arg={0:0}, g=1, id={5:0}] [L694] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[1]]]] [L694] CALL 0 __VERIFIER_assert(g) [L19] COND FALSE 0 !(!(cond)) VAL [A={3:0}, \old(cond)=1, arg={0:0}, arg={0:0}, cond=1, g=1] [L694] RET 0 __VERIFIER_assert(g) [L693] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[g],IntegerLiteral[0]]]] VAL [A={3:0}, arg={0:0}, arg={0:0}, g=1, id={5:0}] - UnprovableResult [Line: 691]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 693]: 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 invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 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: 691]: 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: 684]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds 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: 685]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds 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: 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: 687]: 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, 80 locations, 28 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.2s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 288 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 169 mSDsluCounter, 93 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 310 IncrementalHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 67 mSDtfsCounter, 310 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151occurred in iteration=3, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 99 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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 23:07:06,798 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