This is Ultimate 0.2.4-tmp.dk.referee-eval-04d6fb3-m [2024-09-15 20:16:27,222 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-15 20:16:27,266 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-15 20:16:27,269 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-15 20:16:27,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-15 20:16:27,284 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-15 20:16:27,285 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-15 20:16:27,285 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-15 20:16:27,285 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-15 20:16:27,285 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-15 20:16:27,286 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-15 20:16:27,286 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-15 20:16:27,286 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-15 20:16:27,287 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-15 20:16:27,287 INFO L153 SettingsManager]: * Use SBE=true [2024-09-15 20:16:27,287 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-15 20:16:27,287 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-15 20:16:27,288 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-15 20:16:27,288 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-15 20:16:27,288 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-15 20:16:27,288 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-15 20:16:27,289 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-15 20:16:27,289 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-15 20:16:27,289 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-15 20:16:27,290 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-15 20:16:27,290 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-15 20:16:27,290 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-15 20:16:27,290 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-15 20:16:27,294 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-15 20:16:27,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-15 20:16:27,295 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-15 20:16:27,295 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-15 20:16:27,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 20:16:27,295 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-15 20:16:27,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-15 20:16:27,295 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-15 20:16:27,295 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-15 20:16:27,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-15 20:16:27,296 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-15 20:16:27,296 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-15 20:16:27,296 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-15 20:16:27,297 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-15 20:16:27,297 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/certificate-witnesses-artifact/automizer/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: Positions where we compute the Hoare Annotation -> None [2024-09-15 20:16:27,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-15 20:16:27,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-15 20:16:27,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-15 20:16:27,632 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-15 20:16:27,636 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-15 20:16:27,638 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/hard-ll_valuebound5.yml/witness-2.1.yml [2024-09-15 20:16:27,694 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-15 20:16:27,694 INFO L274 PluginConnector]: CDTParser initialized [2024-09-15 20:16:27,694 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound5.c [2024-09-15 20:16:29,008 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-15 20:16:29,173 INFO L384 CDTParser]: Found 1 translation units. [2024-09-15 20:16:29,174 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound5.c [2024-09-15 20:16:29,181 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/c99ddf464/e6e545916ecb4fe4bc3a9889189bb0d0/FLAG66183c9af [2024-09-15 20:16:29,193 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/c99ddf464/e6e545916ecb4fe4bc3a9889189bb0d0 [2024-09-15 20:16:29,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-15 20:16:29,195 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-15 20:16:29,196 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-15 20:16:29,196 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-15 20:16:29,199 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-15 20:16:29,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 15.09 08:16:27" (1/2) ... [2024-09-15 20:16:29,200 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cfbd44d and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:16:29, skipping insertion in model container [2024-09-15 20:16:29,201 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 15.09 08:16:27" (1/2) ... [2024-09-15 20:16:29,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@652e2923 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:16:29, skipping insertion in model container [2024-09-15 20:16:29,202 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 08:16:29" (2/2) ... [2024-09-15 20:16:29,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cfbd44d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:16:29, skipping insertion in model container [2024-09-15 20:16:29,206 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 08:16:29" (2/2) ... [2024-09-15 20:16:29,213 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-15 20:16:29,213 INFO L1541 ArrayList]: Loop invariant at [L36-L44] ((((((d == B) && (A == r)) && (A <= 5)) && (q == 0)) && (1 <= d)) && (p == 1)) [2024-09-15 20:16:29,213 INFO L1541 ArrayList]: Loop invariant at [L46-L58] ((((((((((((0 <= r) && (((__int128) r + 1) <= d)) && (((__int128) d + r) == A)) && (((__int128) r + ((long long) 2 * B)) == ((__int128) A + d))) && (q == 1)) && (p == 1)) || (((((((0 <= (r + (((__int128) -1 * d) / 2))) && (((__int128) r + 1) <= d)) && (((__int128) A + d) == ((__int128) ((long long) B * 4) + r))) && ((d % 2) == 0)) && (q == 0)) && (p == 4)) && ((A + (d / 2)) == ((__int128) r + ((long long) 2 * B))))) || ((((((q == 2) && (0 <= r)) && (p == 2)) && (((__int128) A + d) == ((__int128) ((long long) B * 4) + r))) && (A == ((__int128) r + ((long long) 2 * B)))) && ((((__int128) d + r) + 1) <= ((long long) B * 4)))) || ((((((A == r) && (d == ((long long) 2 * B))) && (((__int128) r + 1) <= d)) && (p == 2)) && (q == 0)) && (B <= r))) || ((((((q == 2) && (B <= 2147483647)) && (((__int128) r + 1) <= ((__int128) d + (d / 2)))) && (d == ((A + ((__int128) -1 * r)) / 2))) && (A == ((__int128) r + ((long long) 2 * B)))) && (p == 1))) || (((((((((__int128) r + B) + ((__int128) q * B)) == ((__int128) A + d)) && (((__int128) r + 1) <= ((__int128) d + (d / 2)))) && (((__int128) r + ((long long) 2 * B)) <= 4294967295)) && ((r + ((__int128) q * B)) == A)) && (((__int128) d + ((long long) 2 * B)) <= 4294967295)) && (p == 1))) || ((((d == B) && (A == r)) && (q == 0)) && (p == 1))) [2024-09-15 20:16:29,214 INFO L1541 ArrayList]: Function contract at [L11]: requires null, ensures (\old(cond) != 0) [2024-09-15 20:16:29,214 INFO L1541 ArrayList]: Function contract at [L14]: requires (\old(cond) != 0), ensures (\old(cond) != 0) [2024-09-15 20:16:29,230 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-15 20:16:29,357 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound5.c[538,551] [2024-09-15 20:16:29,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 20:16:29,388 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global Start Parsing Global [2024-09-15 20:16:29,421 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound5.c[538,551] Start Parsing Local Start Parsing Local [2024-09-15 20:16:29,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 20:16:29,464 INFO L204 MainTranslator]: Completed translation [2024-09-15 20:16:29,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:16:29 WrapperNode [2024-09-15 20:16:29,465 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-15 20:16:29,466 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-15 20:16:29,467 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-15 20:16:29,467 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-15 20:16:29,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:16:29" (1/1) ... [2024-09-15 20:16:29,481 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:16:29" (1/1) ... [2024-09-15 20:16:29,519 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-09-15 20:16:29,520 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-15 20:16:29,520 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-15 20:16:29,520 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-15 20:16:29,520 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-15 20:16:29,531 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:16:29" (1/1) ... [2024-09-15 20:16:29,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:16:29" (1/1) ... [2024-09-15 20:16:29,534 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:16:29" (1/1) ... [2024-09-15 20:16:29,541 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Procedure assume_abort_if_not is not part of the Ultimate memory model but has specification other that is not a ModifiesSpecification [2024-09-15 20:16:29,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:16:29" (1/1) ... [2024-09-15 20:16:29,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:16:29" (1/1) ... [2024-09-15 20:16:29,549 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:16:29" (1/1) ... [2024-09-15 20:16:29,557 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:16:29" (1/1) ... [2024-09-15 20:16:29,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:16:29" (1/1) ... [2024-09-15 20:16:29,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:16:29" (1/1) ... [2024-09-15 20:16:29,567 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-15 20:16:29,567 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-15 20:16:29,567 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-15 20:16:29,568 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-15 20:16:29,568 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:16:29" (1/1) ... [2024-09-15 20:16:29,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 20:16:29,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 20:16:29,598 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-15 20:16:29,600 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-15 20:16:29,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-15 20:16:29,642 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-15 20:16:29,643 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-15 20:16:29,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-15 20:16:29,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-15 20:16:29,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-15 20:16:29,643 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-15 20:16:29,644 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-15 20:16:29,714 INFO L242 CfgBuilder]: Building ICFG [2024-09-15 20:16:29,716 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-15 20:16:29,926 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-15 20:16:29,942 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-09-15 20:16:29,943 INFO L291 CfgBuilder]: Performing block encoding [2024-09-15 20:16:29,963 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-15 20:16:29,964 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-15 20:16:29,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 08:16:29 BoogieIcfgContainer [2024-09-15 20:16:29,964 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-15 20:16:29,965 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-15 20:16:29,968 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-15 20:16:29,970 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-15 20:16:29,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 15.09 08:16:27" (1/4) ... [2024-09-15 20:16:29,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a70f052 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 15.09 08:16:29, skipping insertion in model container [2024-09-15 20:16:29,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 08:16:29" (2/4) ... [2024-09-15 20:16:29,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a70f052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 08:16:29, skipping insertion in model container [2024-09-15 20:16:29,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:16:29" (3/4) ... [2024-09-15 20:16:29,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a70f052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 08:16:29, skipping insertion in model container [2024-09-15 20:16:29,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 08:16:29" (4/4) ... [2024-09-15 20:16:29,972 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-ll_valuebound5.c [2024-09-15 20:16:29,985 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-15 20:16:29,985 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-09-15 20:16:30,027 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-15 20:16:30,034 INFO L336 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@292e5485, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-15 20:16:30,035 INFO L337 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-09-15 20:16:30,038 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 25 states have (on average 1.56) internal successors, (39), 30 states have internal predecessors, (39), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-15 20:16:30,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-15 20:16:30,046 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:16:30,046 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-15 20:16:30,047 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-15 20:16:30,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:16:30,054 INFO L85 PathProgramCache]: Analyzing trace with hash 134843102, now seen corresponding path program 1 times [2024-09-15 20:16:30,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:16:30,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046484565] [2024-09-15 20:16:30,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:16:30,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:16:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:16:30,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:16:30,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:16:30,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046484565] [2024-09-15 20:16:30,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046484565] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:16:30,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:16:30,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-15 20:16:30,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288781792] [2024-09-15 20:16:30,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:16:30,187 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-15 20:16:30,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:16:30,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-15 20:16:30,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-15 20:16:30,227 INFO L87 Difference]: Start difference. First operand has 43 states, 25 states have (on average 1.56) internal successors, (39), 30 states have internal predecessors, (39), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:16:30,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:16:30,253 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-09-15 20:16:30,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-15 20:16:30,258 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-09-15 20:16:30,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:16:30,267 INFO L225 Difference]: With dead ends: 43 [2024-09-15 20:16:30,270 INFO L226 Difference]: Without dead ends: 41 [2024-09-15 20:16:30,275 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-15 20:16:30,278 INFO L434 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:16:30,281 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:16:30,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-15 20:16:30,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-09-15 20:16:30,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 29 states have internal predecessors, (32), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-15 20:16:30,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2024-09-15 20:16:30,319 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 5 [2024-09-15 20:16:30,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:16:30,319 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2024-09-15 20:16:30,319 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:16:30,320 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2024-09-15 20:16:30,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-15 20:16:30,320 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:16:30,321 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-15 20:16:30,321 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-15 20:16:30,322 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-15 20:16:30,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:16:30,322 INFO L85 PathProgramCache]: Analyzing trace with hash 134843164, now seen corresponding path program 1 times [2024-09-15 20:16:30,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:16:30,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072892960] [2024-09-15 20:16:30,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:16:30,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:16:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:16:30,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 20:16:30,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:16:30,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072892960] [2024-09-15 20:16:30,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072892960] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:16:30,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:16:30,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:16:30,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581916271] [2024-09-15 20:16:30,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:16:30,419 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:16:30,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:16:30,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:16:30,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:16:30,421 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:16:30,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:16:30,458 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2024-09-15 20:16:30,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:16:30,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-09-15 20:16:30,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:16:30,460 INFO L225 Difference]: With dead ends: 40 [2024-09-15 20:16:30,460 INFO L226 Difference]: Without dead ends: 40 [2024-09-15 20:16:30,461 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:16:30,462 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:16:30,463 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 121 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:16:30,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-09-15 20:16:30,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-09-15 20:16:30,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 28 states have internal predecessors, (31), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-15 20:16:30,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2024-09-15 20:16:30,475 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 5 [2024-09-15 20:16:30,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:16:30,475 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2024-09-15 20:16:30,475 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:16:30,476 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2024-09-15 20:16:30,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-15 20:16:30,477 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:16:30,477 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:16:30,477 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-15 20:16:30,478 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-15 20:16:30,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:16:30,479 INFO L85 PathProgramCache]: Analyzing trace with hash 363565673, now seen corresponding path program 1 times [2024-09-15 20:16:30,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:16:30,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747722196] [2024-09-15 20:16:30,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:16:30,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:16:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:16:30,724 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-15 20:16:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:16:30,760 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-15 20:16:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:16:30,767 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-15 20:16:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:16:30,788 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-15 20:16:30,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:16:30,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747722196] [2024-09-15 20:16:30,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747722196] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 20:16:30,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069906822] [2024-09-15 20:16:30,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:16:30,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 20:16:30,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 20:16:30,796 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-15 20:16:30,801 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-15 20:16:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:16:30,843 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-15 20:16:30,846 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 20:16:30,907 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-15 20:16:30,907 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 20:16:30,989 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-15 20:16:30,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069906822] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 20:16:30,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-15 20:16:30,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 7 [2024-09-15 20:16:30,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218768310] [2024-09-15 20:16:30,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-15 20:16:30,991 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-15 20:16:30,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:16:30,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-15 20:16:30,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-09-15 20:16:30,992 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-15 20:16:31,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:16:31,104 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2024-09-15 20:16:31,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-15 20:16:31,105 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 19 [2024-09-15 20:16:31,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:16:31,106 INFO L225 Difference]: With dead ends: 34 [2024-09-15 20:16:31,106 INFO L226 Difference]: Without dead ends: 34 [2024-09-15 20:16:31,106 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-09-15 20:16:31,107 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 20:16:31,107 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 83 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 20:16:31,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-15 20:16:31,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-09-15 20:16:31,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 22 states have internal predecessors, (23), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-15 20:16:31,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2024-09-15 20:16:31,112 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 19 [2024-09-15 20:16:31,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:16:31,113 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-09-15 20:16:31,113 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-15 20:16:31,113 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2024-09-15 20:16:31,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-15 20:16:31,114 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:16:31,114 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:16:31,127 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-15 20:16:31,318 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 20:16:31,319 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-15 20:16:31,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:16:31,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1764960997, now seen corresponding path program 1 times [2024-09-15 20:16:31,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:16:31,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392785205] [2024-09-15 20:16:31,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:16:31,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:16:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:16:31,359 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-15 20:16:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:16:31,365 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-15 20:16:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:16:31,367 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-15 20:16:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:16:31,370 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-15 20:16:31,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:16:31,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392785205] [2024-09-15 20:16:31,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392785205] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:16:31,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:16:31,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:16:31,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885470725] [2024-09-15 20:16:31,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:16:31,371 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-15 20:16:31,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:16:31,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-15 20:16:31,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-15 20:16:31,375 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-15 20:16:31,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:16:31,385 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2024-09-15 20:16:31,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-15 20:16:31,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-09-15 20:16:31,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:16:31,386 INFO L225 Difference]: With dead ends: 32 [2024-09-15 20:16:31,386 INFO L226 Difference]: Without dead ends: 32 [2024-09-15 20:16:31,386 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-15 20:16:31,387 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:16:31,387 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:16:31,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-15 20:16:31,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-15 20:16:31,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-15 20:16:31,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-09-15 20:16:31,392 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 24 [2024-09-15 20:16:31,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:16:31,392 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-09-15 20:16:31,392 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-15 20:16:31,392 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-09-15 20:16:31,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-15 20:16:31,392 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:16:31,392 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:16:31,393 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-15 20:16:31,393 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-15 20:16:31,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:16:31,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1764960836, now seen corresponding path program 1 times [2024-09-15 20:16:31,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:16:31,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73751996] [2024-09-15 20:16:31,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:16:31,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:16:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:16:31,412 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-15 20:16:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:16:31,415 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-15 20:16:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:16:31,420 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-15 20:16:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:16:31,423 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-15 20:16:31,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:16:31,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73751996] [2024-09-15 20:16:31,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73751996] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:16:31,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:16:31,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-15 20:16:31,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288599827] [2024-09-15 20:16:31,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:16:31,426 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-15 20:16:31,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:16:31,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-15 20:16:31,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-15 20:16:31,427 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-15 20:16:31,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:16:31,465 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-09-15 20:16:31,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-15 20:16:31,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-09-15 20:16:31,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:16:31,466 INFO L225 Difference]: With dead ends: 31 [2024-09-15 20:16:31,466 INFO L226 Difference]: Without dead ends: 31 [2024-09-15 20:16:31,466 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-15 20:16:31,466 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:16:31,467 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 50 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:16:31,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-15 20:16:31,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-15 20:16:31,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-15 20:16:31,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-09-15 20:16:31,473 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 24 [2024-09-15 20:16:31,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:16:31,474 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-09-15 20:16:31,474 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-15 20:16:31,474 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-09-15 20:16:31,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-15 20:16:31,474 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:16:31,474 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:16:31,474 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-15 20:16:31,475 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-15 20:16:31,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:16:31,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1154352905, now seen corresponding path program 1 times [2024-09-15 20:16:31,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:16:31,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251223350] [2024-09-15 20:16:31,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:16:31,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:16:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-15 20:16:31,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1375701065] [2024-09-15 20:16:31,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:16:31,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 20:16:31,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 20:16:31,493 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-15 20:16:31,494 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-15 20:16:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-15 20:16:31,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-15 20:16:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-15 20:16:31,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-15 20:16:31,548 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-15 20:16:31,548 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 12 remaining) [2024-09-15 20:16:31,549 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION (10 of 12 remaining) [2024-09-15 20:16:31,550 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (9 of 12 remaining) [2024-09-15 20:16:31,550 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONPRE_CONDITION (8 of 12 remaining) [2024-09-15 20:16:31,550 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 12 remaining) [2024-09-15 20:16:31,550 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION (6 of 12 remaining) [2024-09-15 20:16:31,550 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONPRE_CONDITION (5 of 12 remaining) [2024-09-15 20:16:31,550 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONPRE_CONDITION (4 of 12 remaining) [2024-09-15 20:16:31,550 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONPRE_CONDITION (3 of 12 remaining) [2024-09-15 20:16:31,550 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION (2 of 12 remaining) [2024-09-15 20:16:31,550 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 12 remaining) [2024-09-15 20:16:31,550 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION (0 of 12 remaining) [2024-09-15 20:16:31,562 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-15 20:16:31,751 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-15 20:16:31,753 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-09-15 20:16:31,765 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-09-15 20:16:31,767 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-09-15 20:16:31,768 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-09-15 20:16:31,768 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-09-15 20:16:31,768 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-09-15 20:16:31,769 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-09-15 20:16:31,772 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-15 20:16:31,774 INFO L469 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-09-15 20:16:31,774 INFO L470 ceAbstractionStarter]: WitnessConsidered=2 [2024-09-15 20:16:31,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 08:16:31 BoogieIcfgContainer [2024-09-15 20:16:31,774 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-15 20:16:31,775 INFO L158 Benchmark]: Toolchain (without parser) took 2580.00ms. Allocated memory was 90.2MB in the beginning and 115.3MB in the end (delta: 25.2MB). Free memory was 66.3MB in the beginning and 51.0MB in the end (delta: 15.3MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2024-09-15 20:16:31,775 INFO L158 Benchmark]: Witness Parser took 0.11ms. Allocated memory is still 62.9MB. Free memory was 39.7MB in the beginning and 39.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 20:16:31,775 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 62.9MB. Free memory is still 37.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 20:16:31,775 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.71ms. Allocated memory is still 90.2MB. Free memory was 66.1MB in the beginning and 51.3MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-15 20:16:31,775 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.94ms. Allocated memory is still 90.2MB. Free memory was 51.3MB in the beginning and 49.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-15 20:16:31,775 INFO L158 Benchmark]: Boogie Preprocessor took 46.53ms. Allocated memory is still 90.2MB. Free memory was 49.0MB in the beginning and 47.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-15 20:16:31,776 INFO L158 Benchmark]: RCFGBuilder took 396.88ms. Allocated memory is still 90.2MB. Free memory was 47.2MB in the beginning and 50.5MB in the end (delta: -3.3MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-09-15 20:16:31,776 INFO L158 Benchmark]: TraceAbstraction took 1809.11ms. Allocated memory was 90.2MB in the beginning and 115.3MB in the end (delta: 25.2MB). Free memory was 49.7MB in the beginning and 51.0MB in the end (delta: -1.3MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2024-09-15 20:16:31,779 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.11ms. Allocated memory is still 62.9MB. Free memory was 39.7MB in the beginning and 39.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.09ms. Allocated memory is still 62.9MB. Free memory is still 37.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.71ms. Allocated memory is still 90.2MB. Free memory was 66.1MB in the beginning and 51.3MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.94ms. Allocated memory is still 90.2MB. Free memory was 51.3MB in the beginning and 49.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.53ms. Allocated memory is still 90.2MB. Free memory was 49.0MB in the beginning and 47.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 396.88ms. Allocated memory is still 90.2MB. Free memory was 47.2MB in the beginning and 50.5MB in the end (delta: -3.3MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1809.11ms. Allocated memory was 90.2MB in the beginning and 115.3MB in the end (delta: 25.2MB). Free memory was 49.7MB in the beginning and 51.0MB in the end (delta: -1.3MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 36]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L23] unsigned int A, B; [L24] long long r, d, p, q; [L25] A = __VERIFIER_nondet_uint() [L26] CALL assume_abort_if_not(A>=0 && A<=5) VAL [\old(cond)=1] [L12] COND FALSE !(!cond) VAL [\old(cond)=1] [L26] RET assume_abort_if_not(A>=0 && A<=5) VAL [A=-4294967295] [L27] B = __VERIFIER_nondet_uint() [L28] CALL assume_abort_if_not(B>=0 && B<=5) VAL [\old(cond)=1] [L12] COND FALSE !(!cond) VAL [\old(cond)=1] [L28] RET assume_abort_if_not(B>=0 && B<=5) VAL [A=-4294967295, B=1] [L29] CALL assume_abort_if_not(B >= 1) VAL [\old(cond)=1] [L12] COND FALSE !(!cond) VAL [\old(cond)=1] [L29] RET assume_abort_if_not(B >= 1) VAL [A=-4294967295, B=1] [L31] r = A [L32] d = B [L33] p = 1 [L34] q = 0 VAL [A=-4294967295, B=1, d=1, p=1, q=0, r=1] [L36] COND TRUE 1 VAL [A=-4294967295, B=1, d=1, p=1, q=0, r=1] [L37] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L37] RET __VERIFIER_assert(q == 0) VAL [A=-4294967295, B=1, d=1, p=1, q=0, r=1] [L38] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L38] RET __VERIFIER_assert(r == A) VAL [A=-4294967295, B=1, d=1, p=1, q=0, r=1] [L39] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L39] RET __VERIFIER_assert(d == B * p) VAL [A=-4294967295, B=1, d=1, p=1, q=0, r=1] [L40] COND FALSE !(!(r >= d)) [L42] d = 2 * d [L43] p = 2 * p VAL [A=-4294967295, B=1, d=2, p=2, q=0, r=1] - UnprovableResult [Line: 14]: Unable to prove that procedure precondition always holds Unable to prove that procedure precondition always holds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that procedure precondition always holds Unable to prove that procedure precondition always holds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that procedure precondition always holds Unable to prove that procedure precondition always holds Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that procedure precondition always holds Unable to prove that procedure precondition always holds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that procedure precondition always holds Unable to prove that procedure precondition always holds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that procedure precondition always holds Unable to prove that procedure precondition always holds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that procedure precondition always holds Unable to prove that procedure precondition always holds Reason: Not analyzed. - UnprovableResult [Line: 11]: Unable to prove that procedure postcondition always holds Unable to prove that procedure postcondition always holds Reason: Not analyzed. - UnprovableResult [Line: 17]: 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: 14]: Unable to prove that procedure postcondition always holds Unable to prove that procedure postcondition always holds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 43 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 376 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 193 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 128 IncrementalHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 183 mSDtfsCounter, 128 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 300 SizeOfPredicates, 1 NumberOfNonLiveVariables, 58 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 55/60 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-09-15 20:16:31,821 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...