This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-13 05:39:19,606 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 05:39:19,695 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 05:39:19,701 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 05:39:19,701 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 05:39:19,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 05:39:19,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 05:39:19,729 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 05:39:19,730 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 05:39:19,730 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 05:39:19,731 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 05:39:19,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 05:39:19,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 05:39:19,732 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 05:39:19,732 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 05:39:19,732 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 05:39:19,733 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 05:39:19,733 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 05:39:19,734 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 05:39:19,734 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 05:39:19,734 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 05:39:19,735 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 05:39:19,735 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 05:39:19,735 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 05:39:19,735 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 05:39:19,736 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 05:39:19,736 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 05:39:19,736 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 05:39:19,736 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 05:39:19,737 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 05:39:19,737 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 05:39:19,737 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 05:39:19,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 05:39:19,738 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 05:39:19,738 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 05:39:19,742 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 05:39:19,743 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 05:39:19,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 05:39:19,743 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 05:39:19,744 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 05:39:19,744 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 05:39:19,744 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 05:39:19,745 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-13 05:39:19,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 05:39:20,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 05:39:20,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 05:39:20,008 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 05:39:20,008 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 05:39:20,009 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound5.c [2024-09-13 05:39:21,282 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 05:39:21,443 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 05:39:21,444 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound5.c [2024-09-13 05:39:21,450 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/3a0f03080/273f49dabb6a4e1785b8be95077969a4/FLAGff8e8a445 [2024-09-13 05:39:21,462 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/3a0f03080/273f49dabb6a4e1785b8be95077969a4 [2024-09-13 05:39:21,464 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-13 05:39:21,465 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-13 05:39:21,465 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/geo1-ll_unwindbound5.yml/witness-2.1.yml [2024-09-13 05:39:21,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 05:39:21,516 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-13 05:39:21,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 05:39:21,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 05:39:21,522 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 05:39:21,523 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 05:39:21" (1/2) ... [2024-09-13 05:39:21,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bc5e64a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:39:21, skipping insertion in model container [2024-09-13 05:39:21,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 05:39:21" (1/2) ... [2024-09-13 05:39:21,527 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3e5f7586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:39:21, skipping insertion in model container [2024-09-13 05:39:21,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 05:39:21" (2/2) ... [2024-09-13 05:39:21,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bc5e64a and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:39:21, skipping insertion in model container [2024-09-13 05:39:21,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 05:39:21" (2/2) ... [2024-09-13 05:39:21,537 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-13 05:39:21,537 INFO L1541 ArrayList]: Loop invariant at [L35-L45] ((\old(counter) == 0) && (((((((((y == ((__int128) ((long long) z * z) * z)) && (1 <= z)) && (x == ((((long long) z * z) + z) + 1))) && (counter == 2)) || ((((y == ((((__int128) ((long long) z * z) * z) * z) * z)) && (counter == 4)) && ((((((((__int128) ((long long) z * z) * z) * z) + ((long long) z * z)) + z) + ((__int128) ((long long) z * z) * z)) + 1) == x)) && (1 <= z))) || ((((1 <= z) && (counter == 1)) && (((long long) z * z) == y)) && (x == ((long long) z + 1)))) || ((((counter == 3) && (x == (((((long long) z * z) + z) + ((__int128) ((long long) z * z) * z)) + 1))) && ((((__int128) ((long long) z * z) * z) * z) == y)) && (1 <= z))) || ((((z == y) && (x == 1)) && (counter == 0)) && (1 <= z))) || (((((((((__int128) ((long long) z * z) * z) * z) * z) * z) == y) && (1 <= z)) && (((((((((__int128) ((long long) z * z) * z) * z) + ((long long) z * z)) + z) + ((__int128) ((long long) z * z) * z)) + ((((__int128) ((long long) z * z) * z) * z) * z)) + 1) == x)) && (5 <= counter)))) [2024-09-13 05:39:21,538 INFO L1541 ArrayList]: Function contract at [L15]: requires (1 <= \old(cond)), ensures (1 <= \old(cond)) [2024-09-13 05:39:21,538 INFO L1541 ArrayList]: Function contract at [L23]: requires (counter == 0), ensures (\old(counter) == 0) [2024-09-13 05:39:21,538 INFO L1541 ArrayList]: Function contract at [L12]: requires (counter == 0), ensures ((\old(cond) != 0) && (counter == 0)) [2024-09-13 05:39:21,554 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 05:39:21,687 WARN L247 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/geo1-ll_unwindbound5.c[546,559] [2024-09-13 05:39:21,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 05:39:21,728 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global Start Parsing Global Start Parsing Global [2024-09-13 05:39:21,766 WARN L247 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/geo1-ll_unwindbound5.c[546,559] Start Parsing Global Start Parsing Global Start Parsing Local [2024-09-13 05:39:21,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 05:39:21,808 INFO L204 MainTranslator]: Completed translation [2024-09-13 05:39:21,808 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:39:21 WrapperNode [2024-09-13 05:39:21,809 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 05:39:21,809 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 05:39:21,809 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 05:39:21,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 05:39:21,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:39:21" (1/1) ... [2024-09-13 05:39:21,822 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:39:21" (1/1) ... [2024-09-13 05:39:21,851 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2024-09-13 05:39:21,854 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 05:39:21,855 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 05:39:21,855 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 05:39:21,856 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 05:39:21,864 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:39:21" (1/1) ... [2024-09-13 05:39:21,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:39:21" (1/1) ... [2024-09-13 05:39:21,865 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:39:21" (1/1) ... [2024-09-13 05:39:21,870 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-13 05:39:21,871 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:39:21" (1/1) ... [2024-09-13 05:39:21,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:39:21" (1/1) ... [2024-09-13 05:39:21,874 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:39:21" (1/1) ... [2024-09-13 05:39:21,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:39:21" (1/1) ... [2024-09-13 05:39:21,878 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:39:21" (1/1) ... [2024-09-13 05:39:21,879 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:39:21" (1/1) ... [2024-09-13 05:39:21,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 05:39:21,881 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 05:39:21,882 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 05:39:21,882 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 05:39:21,886 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:39:21" (1/1) ... [2024-09-13 05:39:21,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 05:39:21,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:39:21,909 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-13 05:39:21,910 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-13 05:39:21,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 05:39:21,953 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 05:39:21,953 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 05:39:21,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-13 05:39:21,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 05:39:21,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 05:39:21,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 05:39:21,954 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 05:39:22,003 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 05:39:22,005 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 05:39:22,164 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-13 05:39:22,175 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-13 05:39:22,208 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-09-13 05:39:22,208 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 05:39:22,234 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 05:39:22,234 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-13 05:39:22,234 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 05:39:22 BoogieIcfgContainer [2024-09-13 05:39:22,234 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 05:39:22,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 05:39:22,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 05:39:22,242 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 05:39:22,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 05:39:21" (1/4) ... [2024-09-13 05:39:22,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21113a4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 05:39:22, skipping insertion in model container [2024-09-13 05:39:22,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 05:39:21" (2/4) ... [2024-09-13 05:39:22,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21113a4c and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 05:39:22, skipping insertion in model container [2024-09-13 05:39:22,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:39:21" (3/4) ... [2024-09-13 05:39:22,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21113a4c and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 05:39:22, skipping insertion in model container [2024-09-13 05:39:22,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 05:39:22" (4/4) ... [2024-09-13 05:39:22,246 INFO L112 eAbstractionObserver]: Analyzing ICFG geo1-ll_unwindbound5.c [2024-09-13 05:39:22,260 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 05:39:22,260 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-09-13 05:39:22,295 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 05:39:22,302 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;@61a38b8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 05:39:22,303 INFO L337 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-09-13 05:39:22,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-13 05:39:22,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-09-13 05:39:22,311 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:39:22,312 INFO L216 NwaCegarLoop]: trace histogram [1, 1] [2024-09-13 05:39:22,313 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 7 more)] === [2024-09-13 05:39:22,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:39:22,319 INFO L85 PathProgramCache]: Analyzing trace with hash 3165, now seen corresponding path program 1 times [2024-09-13 05:39:22,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:39:22,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436694842] [2024-09-13 05:39:22,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:39:22,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:39:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:39:22,483 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-13 05:39:22,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:39:22,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436694842] [2024-09-13 05:39:22,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436694842] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:39:22,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:39:22,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-09-13 05:39:22,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619864186] [2024-09-13 05:39:22,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:39:22,493 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:39:22,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:39:22,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:39:22,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:39:22,518 INFO L87 Difference]: Start difference. First operand has 34 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-09-13 05:39:22,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:39:22,590 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2024-09-13 05:39:22,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:39:22,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2024-09-13 05:39:22,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:39:22,599 INFO L225 Difference]: With dead ends: 34 [2024-09-13 05:39:22,599 INFO L226 Difference]: Without dead ends: 33 [2024-09-13 05:39:22,601 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-13 05:39:22,605 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 12 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:39:22,606 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 42 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 05:39:22,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-13 05:39:22,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2024-09-13 05:39:22,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-13 05:39:22,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-09-13 05:39:22,635 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 2 [2024-09-13 05:39:22,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:39:22,636 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-09-13 05:39:22,636 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-09-13 05:39:22,636 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-09-13 05:39:22,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-09-13 05:39:22,638 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:39:22,638 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-09-13 05:39:22,639 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 05:39:22,639 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 7 more)] === [2024-09-13 05:39:22,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:39:22,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1369151349, now seen corresponding path program 1 times [2024-09-13 05:39:22,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:39:22,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174063404] [2024-09-13 05:39:22,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:39:22,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:39:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:39:22,829 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-13 05:39:22,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:39:22,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174063404] [2024-09-13 05:39:22,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174063404] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:39:22,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:39:22,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:39:22,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882456238] [2024-09-13 05:39:22,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:39:22,834 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:39:22,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:39:22,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:39:22,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:39:22,835 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-13 05:39:22,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:39:22,878 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2024-09-13 05:39:22,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:39:22,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 6 [2024-09-13 05:39:22,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:39:22,879 INFO L225 Difference]: With dead ends: 32 [2024-09-13 05:39:22,879 INFO L226 Difference]: Without dead ends: 32 [2024-09-13 05:39:22,880 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:39:22,881 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:39:22,881 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 41 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:39:22,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-13 05:39:22,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2024-09-13 05:39:22,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.263157894736842) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-13 05:39:22,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2024-09-13 05:39:22,886 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 6 [2024-09-13 05:39:22,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:39:22,886 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-09-13 05:39:22,886 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-13 05:39:22,887 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2024-09-13 05:39:22,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-13 05:39:22,887 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:39:22,887 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:39:22,887 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 05:39:22,888 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 7 more)] === [2024-09-13 05:39:22,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:39:22,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1437512956, now seen corresponding path program 1 times [2024-09-13 05:39:22,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:39:22,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686108065] [2024-09-13 05:39:22,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:39:22,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:39:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:39:23,491 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 05:39:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:39:23,545 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:39:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:39:23,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-13 05:39:23,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:39:23,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686108065] [2024-09-13 05:39:23,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686108065] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:39:23,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623733686] [2024-09-13 05:39:23,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:39:23,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:39:23,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:39:23,582 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-13 05:39:23,584 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-13 05:39:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:39:23,635 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-13 05:39:23,641 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:39:23,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-13 05:39:23,720 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:39:41,650 WARN L293 SmtUtils]: Spent 9.09s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 05:39:49,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-13 05:39:49,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623733686] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:39:49,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 05:39:49,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2024-09-13 05:39:49,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869668952] [2024-09-13 05:39:49,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 05:39:49,777 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-13 05:39:49,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:39:49,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-13 05:39:49,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-09-13 05:39:49,779 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 11 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-13 05:39:50,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:39:50,282 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2024-09-13 05:39:50,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-13 05:39:50,283 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 14 [2024-09-13 05:39:50,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:39:50,284 INFO L225 Difference]: With dead ends: 31 [2024-09-13 05:39:50,284 INFO L226 Difference]: Without dead ends: 31 [2024-09-13 05:39:50,284 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-09-13 05:39:50,285 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 13 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 05:39:50,286 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 95 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 05:39:50,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-13 05:39:50,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2024-09-13 05:39:50,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.25) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-13 05:39:50,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-09-13 05:39:50,291 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 14 [2024-09-13 05:39:50,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:39:50,292 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-09-13 05:39:50,292 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-13 05:39:50,293 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-09-13 05:39:50,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-13 05:39:50,293 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:39:50,293 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:39:50,311 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-13 05:39:50,494 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-13 05:39:50,494 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 7 more)] === [2024-09-13 05:39:50,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:39:50,495 INFO L85 PathProgramCache]: Analyzing trace with hash 170482061, now seen corresponding path program 1 times [2024-09-13 05:39:50,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:39:50,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418225240] [2024-09-13 05:39:50,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:39:50,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:39:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 05:39:50,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [881649918] [2024-09-13 05:39:50,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:39:50,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:39:50,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:39:50,540 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-13 05:39:50,543 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-13 05:39:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:39:50,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-13 05:39:50,588 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:39:50,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 05:39:50,610 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 05:39:50,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:39:50,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418225240] [2024-09-13 05:39:50,611 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 05:39:50,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881649918] [2024-09-13 05:39:50,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881649918] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:39:50,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:39:50,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 05:39:50,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988291750] [2024-09-13 05:39:50,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:39:50,614 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:39:50,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:39:50,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:39:50,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:39:50,615 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 05:39:50,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:39:50,649 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2024-09-13 05:39:50,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:39:50,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-09-13 05:39:50,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:39:50,650 INFO L225 Difference]: With dead ends: 35 [2024-09-13 05:39:50,651 INFO L226 Difference]: Without dead ends: 35 [2024-09-13 05:39:50,652 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-13 05:39:50,653 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:39:50,654 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 47 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:39:50,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-13 05:39:50,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-09-13 05:39:50,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 26 states have internal predecessors, (28), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 05:39:50,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-09-13 05:39:50,658 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 17 [2024-09-13 05:39:50,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:39:50,658 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-09-13 05:39:50,660 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 05:39:50,661 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-09-13 05:39:50,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-13 05:39:50,661 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:39:50,663 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:39:50,679 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-13 05:39:50,867 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:39:50,868 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 7 more)] === [2024-09-13 05:39:50,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:39:50,868 INFO L85 PathProgramCache]: Analyzing trace with hash 989974986, now seen corresponding path program 1 times [2024-09-13 05:39:50,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:39:50,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323383911] [2024-09-13 05:39:50,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:39:50,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:39:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:39:50,930 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 05:39:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:39:50,937 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:39:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:39:50,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 05:39:50,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:39:50,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323383911] [2024-09-13 05:39:50,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323383911] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:39:50,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:39:50,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 05:39:50,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102413711] [2024-09-13 05:39:50,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:39:50,945 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 05:39:50,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:39:50,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 05:39:50,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 05:39:50,948 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 05:39:50,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:39:50,979 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-09-13 05:39:50,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 05:39:50,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-09-13 05:39:50,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:39:50,983 INFO L225 Difference]: With dead ends: 33 [2024-09-13 05:39:50,983 INFO L226 Difference]: Without dead ends: 33 [2024-09-13 05:39:50,983 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-13 05:39:50,984 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:39:50,984 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 64 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:39:50,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-13 05:39:50,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-09-13 05:39:50,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 26 states have internal predecessors, (27), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 05:39:50,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-09-13 05:39:50,993 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 18 [2024-09-13 05:39:50,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:39:50,993 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-09-13 05:39:50,993 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 05:39:50,993 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-09-13 05:39:50,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-13 05:39:50,994 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:39:50,994 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:39:50,994 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-13 05:39:50,994 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 7 more)] === [2024-09-13 05:39:50,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:39:50,995 INFO L85 PathProgramCache]: Analyzing trace with hash -2113848269, now seen corresponding path program 1 times [2024-09-13 05:39:50,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:39:50,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965068832] [2024-09-13 05:39:50,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:39:50,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:39:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:39:51,043 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 05:39:51,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:39:51,046 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:39:51,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:39:51,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 05:39:51,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:39:51,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965068832] [2024-09-13 05:39:51,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965068832] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:39:51,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:39:51,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:39:51,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589325559] [2024-09-13 05:39:51,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:39:51,050 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:39:51,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:39:51,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:39:51,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:39:51,052 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 05:39:51,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:39:51,060 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-09-13 05:39:51,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:39:51,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-09-13 05:39:51,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:39:51,062 INFO L225 Difference]: With dead ends: 31 [2024-09-13 05:39:51,062 INFO L226 Difference]: Without dead ends: 31 [2024-09-13 05:39:51,062 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-13 05:39:51,063 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:39:51,063 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:39:51,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-13 05:39:51,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-13 05:39:51,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 24 states have internal predecessors, (25), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 05:39:51,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-09-13 05:39:51,067 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 20 [2024-09-13 05:39:51,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:39:51,067 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-09-13 05:39:51,067 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 05:39:51,067 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-09-13 05:39:51,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-13 05:39:51,068 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:39:51,068 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:39:51,068 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-13 05:39:51,068 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 7 more)] === [2024-09-13 05:39:51,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:39:51,069 INFO L85 PathProgramCache]: Analyzing trace with hash -2113848108, now seen corresponding path program 1 times [2024-09-13 05:39:51,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:39:51,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874543787] [2024-09-13 05:39:51,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:39:51,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:39:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:39:51,089 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 05:39:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:39:51,091 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:39:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:39:51,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 05:39:51,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:39:51,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874543787] [2024-09-13 05:39:51,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874543787] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:39:51,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:39:51,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 05:39:51,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579665029] [2024-09-13 05:39:51,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:39:51,094 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:39:51,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:39:51,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:39:51,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:39:51,095 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 05:39:51,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:39:51,110 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-09-13 05:39:51,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:39:51,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-09-13 05:39:51,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:39:51,112 INFO L225 Difference]: With dead ends: 30 [2024-09-13 05:39:51,112 INFO L226 Difference]: Without dead ends: 30 [2024-09-13 05:39:51,112 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-13 05:39:51,113 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:39:51,113 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 43 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:39:51,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-13 05:39:51,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-13 05:39:51,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 05:39:51,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-09-13 05:39:51,116 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2024-09-13 05:39:51,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:39:51,117 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-09-13 05:39:51,117 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 05:39:51,117 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-09-13 05:39:51,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-13 05:39:51,118 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:39:51,118 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:39:51,118 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-13 05:39:51,118 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 7 more)] === [2024-09-13 05:39:51,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:39:51,119 INFO L85 PathProgramCache]: Analyzing trace with hash -838455040, now seen corresponding path program 1 times [2024-09-13 05:39:51,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:39:51,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079073519] [2024-09-13 05:39:51,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:39:51,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:39:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 05:39:51,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1112767476] [2024-09-13 05:39:51,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:39:51,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:39:51,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:39:51,149 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:39:51,152 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-13 05:39:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:39:51,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-09-13 05:39:51,219 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:39:51,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 05:39:51,452 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:40:05,259 WARN L293 SmtUtils]: Spent 6.79s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 05:40:23,960 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:40:30,092 WARN L293 SmtUtils]: Spent 6.13s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:40:42,557 WARN L293 SmtUtils]: Spent 12.47s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:41:45,017 WARN L293 SmtUtils]: Spent 13.64s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:42:01,790 WARN L293 SmtUtils]: Spent 6.47s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:42:09,797 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:42:24,035 WARN L293 SmtUtils]: Spent 10.08s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:42:32,122 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:42:42,939 WARN L293 SmtUtils]: Spent 6.15s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:42:57,187 WARN L293 SmtUtils]: Spent 5.43s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:43:10,355 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:43:23,061 WARN L293 SmtUtils]: Spent 8.43s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:46:48,689 WARN L293 SmtUtils]: Spent 3.09m on a formula simplification that was a NOOP. DAG size: 100 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 05:47:07,815 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification. DAG size of input: 30 DAG size of output: 25 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 05:47:27,383 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 05:47:35,437 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 05:47:35,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:47:35,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079073519] [2024-09-13 05:47:35,437 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 05:47:35,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112767476] [2024-09-13 05:47:35,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112767476] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:47:35,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 05:47:35,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2024-09-13 05:47:35,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064036649] [2024-09-13 05:47:35,438 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 05:47:35,438 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-13 05:47:35,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:47:35,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-13 05:47:35,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=172, Unknown=4, NotChecked=0, Total=240 [2024-09-13 05:47:35,439 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 16 states, 14 states have (on average 2.0) internal successors, (28), 15 states have internal predecessors, (28), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-13 05:47:39,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-09-13 05:47:43,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:47:47,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:47:51,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:47:55,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:48:00,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:48:04,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:48:08,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:48:12,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:48:15,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:48:20,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:48:41,283 WARN L293 SmtUtils]: Spent 19.50s on a formula simplification. DAG size of input: 119 DAG size of output: 46 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 05:48:45,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:48:49,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:48:53,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:48:57,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:49:01,542 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse22 (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (.cse10 (= c_~counter~0 1))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_old_~counter~0#1| 0))) (.cse3 (mod |c_ULTIMATE.start_main_~z~0#1| 18446744073709551616)) (.cse5 (not .cse10)) (.cse1 (< |c_ULTIMATE.start_main_~z~0#1| 1)) (.cse4 (mod .cse22 18446744073709551616)) (.cse2 (mod (+ |c_ULTIMATE.start_main_~z~0#1| 1) 18446744073709551616))) (and (or .cse0 .cse1 (not (= .cse2 1)) (not (= .cse3 .cse4)) .cse5) (let ((.cse12 (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (.cse20 (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (.cse18 (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (let ((.cse7 (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (.cse8 (+ .cse22 |c_ULTIMATE.start_main_~z~0#1| .cse12 .cse20 .cse18 1)) (.cse11 (+ .cse22 |c_ULTIMATE.start_main_~z~0#1| 1)) (.cse13 (= c_~counter~0 0)) (.cse21 (+ .cse22 |c_ULTIMATE.start_main_~z~0#1| .cse12 .cse18 1)) (.cse19 (= 3 c_~counter~0)) (.cse6 (mod (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~z~0#1|) 18446744073709551616)) (.cse17 (+ .cse22 |c_ULTIMATE.start_main_~z~0#1| .cse12 1)) (.cse9 (mod (+ (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|) 1) 18446744073709551616)) (.cse16 (= 2 c_~counter~0))) (or .cse0 (and (<= 4 c_~counter~0) (= .cse6 .cse7) (= .cse8 .cse9)) (and .cse10 (= .cse11 .cse9) (= .cse6 .cse12)) (let ((.cse15 (mod |c_ULTIMATE.start_main_~y~0#1| 18446744073709551616)) (.cse14 (mod |c_ULTIMATE.start_main_~x~0#1| 18446744073709551616))) (and (or (not .cse13) (not (= .cse14 1)) .cse1 (not (= .cse3 .cse15))) (or (not (= .cse15 .cse4)) .cse1 (not (= .cse14 .cse2)) .cse5) (or (not (= .cse7 .cse15)) (< c_~counter~0 5) (not (= .cse14 .cse8)) .cse1) (or (not (= .cse12 .cse15)) (not .cse16) (not (= .cse14 .cse11))) (or (not (= .cse14 .cse17)) (not (= .cse15 .cse18)) .cse1 (not .cse19)) (or (not (= c_~counter~0 4)) (not (= .cse20 .cse15)) (not (= .cse21 .cse14))))) (< (mod |c_ULTIMATE.start_main_~k~0#1| 18446744073709551616) (+ (mod |c_ULTIMATE.start_main_~c~0#1| 18446744073709551616) 1)) (and (= .cse6 .cse4) .cse13 (= .cse9 .cse2)) (and (= .cse21 .cse9) (= .cse6 .cse20) .cse19) (and (= .cse6 .cse18) (= .cse17 .cse9) .cse16))))))) is different from true [2024-09-13 05:49:05,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:49:09,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:49:13,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:49:17,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:49:22,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:49:26,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:49:30,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:49:34,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:49:34,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:49:34,511 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2024-09-13 05:49:34,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-13 05:49:34,511 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 15 states have internal predecessors, (28), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 23 [2024-09-13 05:49:34,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:49:34,512 INFO L225 Difference]: With dead ends: 44 [2024-09-13 05:49:34,512 INFO L226 Difference]: Without dead ends: 44 [2024-09-13 05:49:34,512 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 264.3s TimeCoverageRelationStatistics Valid=74, Invalid=197, Unknown=5, NotChecked=30, Total=306 [2024-09-13 05:49:34,513 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 7 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 94.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 94.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:49:34,513 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 93 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 179 Invalid, 22 Unknown, 28 Unchecked, 94.1s Time] [2024-09-13 05:49:34,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-09-13 05:49:34,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2024-09-13 05:49:34,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-13 05:49:34,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-09-13 05:49:34,518 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 23 [2024-09-13 05:49:34,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:49:34,518 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-09-13 05:49:34,518 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 15 states have internal predecessors, (28), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-13 05:49:34,518 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-09-13 05:49:34,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-13 05:49:34,519 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:49:34,520 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:49:34,536 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-13 05:49:34,724 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-13 05:49:34,725 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 7 more)] === [2024-09-13 05:49:34,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:49:34,725 INFO L85 PathProgramCache]: Analyzing trace with hash -222303701, now seen corresponding path program 1 times [2024-09-13 05:49:34,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:49:34,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087125364] [2024-09-13 05:49:34,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:49:34,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:49:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:34,826 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 05:49:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:34,829 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:49:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:34,832 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 05:49:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:34,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 05:49:34,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:49:34,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087125364] [2024-09-13 05:49:34,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087125364] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:49:34,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:49:34,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 05:49:34,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143129764] [2024-09-13 05:49:34,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:49:34,854 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:49:34,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:49:34,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:49:34,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:49:34,855 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 05:49:38,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:49:43,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:49:43,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:49:43,056 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2024-09-13 05:49:43,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:49:43,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-09-13 05:49:43,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:49:43,057 INFO L225 Difference]: With dead ends: 41 [2024-09-13 05:49:43,057 INFO L226 Difference]: Without dead ends: 41 [2024-09-13 05:49:43,058 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:49:43,058 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-09-13 05:49:43,058 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 64 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2024-09-13 05:49:43,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-13 05:49:43,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2024-09-13 05:49:43,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 31 states have internal predecessors, (32), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-13 05:49:43,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2024-09-13 05:49:43,062 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 24 [2024-09-13 05:49:43,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:49:43,062 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2024-09-13 05:49:43,063 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 05:49:43,063 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2024-09-13 05:49:43,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-13 05:49:43,063 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:49:43,064 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:49:43,064 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-13 05:49:43,064 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 7 more)] === [2024-09-13 05:49:43,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:49:43,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1115742737, now seen corresponding path program 1 times [2024-09-13 05:49:43,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:49:43,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955861673] [2024-09-13 05:49:43,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:49:43,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:49:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 05:49:43,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [894854143] [2024-09-13 05:49:43,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:49:43,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:49:43,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:49:43,136 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:49:43,143 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-13 05:49:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:49:43,190 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-13 05:49:43,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:49:43,280 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 05:49:43,281 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:50:04,462 WARN L293 SmtUtils]: Spent 8.77s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:50:16,666 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:50:23,636 WARN L293 SmtUtils]: Spent 6.97s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:50:31,648 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:50:37,974 WARN L293 SmtUtils]: Spent 6.32s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:50:45,984 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:51:02,368 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:51:07,983 WARN L293 SmtUtils]: Spent 5.61s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:51:15,990 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:51:32,577 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:51:45,419 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:51:57,878 WARN L876 $PredicateComparison]: unable to prove that (or (let ((.cse6 (< |c_ULTIMATE.start_main_~z~0#1| 1)) (.cse4 (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (.cse0 (mod |c_ULTIMATE.start_main_~y~0#1| 18446744073709551616)) (.cse2 (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (.cse3 (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (.cse5 (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (.cse1 (mod |c_ULTIMATE.start_main_~x~0#1| 18446744073709551616))) (and (or (not (= (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) .cse0)) (< c_~counter~0 5) (not (= .cse1 (+ .cse2 |c_ULTIMATE.start_main_~z~0#1| .cse3 .cse4 .cse5 1)))) (or (not (= c_~counter~0 0)) (not (= .cse1 1)) .cse6 (not (= (mod |c_ULTIMATE.start_main_~z~0#1| 18446744073709551616) .cse0))) (or (not (= .cse1 (+ .cse2 |c_ULTIMATE.start_main_~z~0#1| .cse3 1))) (not (= .cse0 .cse5)) (not (= 3 c_~counter~0))) (or (not (= .cse0 (mod .cse2 18446744073709551616))) .cse6 (not (= .cse1 (mod (+ |c_ULTIMATE.start_main_~z~0#1| 1) 18446744073709551616))) (not (= c_~counter~0 1))) (or (not (= .cse3 .cse0)) (not (= 2 c_~counter~0)) (not (= .cse1 (+ .cse2 |c_ULTIMATE.start_main_~z~0#1| 1)))) (or (not (= c_~counter~0 4)) (not (= .cse4 .cse0)) (not (= (+ .cse2 |c_ULTIMATE.start_main_~z~0#1| .cse3 .cse5 1) .cse1))))) (= (mod (+ (* 18446744073709551615 |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|) (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~y~0#1| 18446744073709551615 |c_ULTIMATE.start_main_~z~0#1|)) 18446744073709551616) 0)) is different from true [2024-09-13 05:51:57,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 3 times theorem prover too weak. 4 trivial. 1 not checked. [2024-09-13 05:51:57,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:51:57,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955861673] [2024-09-13 05:51:57,899 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 05:51:57,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894854143] [2024-09-13 05:51:57,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894854143] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:51:57,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 05:51:57,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2024-09-13 05:51:57,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851958544] [2024-09-13 05:51:57,900 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 05:51:57,900 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-13 05:51:57,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:51:57,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-13 05:51:57,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=36, Unknown=2, NotChecked=12, Total=72 [2024-09-13 05:51:57,901 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-13 05:52:06,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:52:10,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:52:14,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:52:18,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:52:22,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:52:26,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:52:30,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:52:34,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:52:38,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:52:42,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:52:46,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:52:46,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:52:46,380 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2024-09-13 05:52:46,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-13 05:52:46,380 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 26 [2024-09-13 05:52:46,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:52:46,381 INFO L225 Difference]: With dead ends: 60 [2024-09-13 05:52:46,382 INFO L226 Difference]: Without dead ends: 60 [2024-09-13 05:52:46,382 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=37, Invalid=55, Unknown=2, NotChecked=16, Total=110 [2024-09-13 05:52:46,382 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 13 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 44.4s IncrementalHoareTripleChecker+Time [2024-09-13 05:52:46,382 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 102 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 11 Unknown, 65 Unchecked, 44.4s Time] [2024-09-13 05:52:46,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-13 05:52:46,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2024-09-13 05:52:46,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 42 states have internal predecessors, (49), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 05:52:46,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2024-09-13 05:52:46,388 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 69 transitions. Word has length 26 [2024-09-13 05:52:46,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:52:46,389 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 69 transitions. [2024-09-13 05:52:46,389 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-13 05:52:46,389 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2024-09-13 05:52:46,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-13 05:52:46,389 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:52:46,389 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:52:46,402 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-13 05:52:46,590 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:52:46,590 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 7 more)] === [2024-09-13 05:52:46,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:52:46,590 INFO L85 PathProgramCache]: Analyzing trace with hash 228284870, now seen corresponding path program 1 times [2024-09-13 05:52:46,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:52:46,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315287131] [2024-09-13 05:52:46,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:52:46,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:52:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:52:46,657 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 05:52:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:52:46,662 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:52:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:52:46,666 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 05:52:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:52:46,676 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 05:52:46,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:52:46,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315287131] [2024-09-13 05:52:46,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315287131] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:52:46,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082156689] [2024-09-13 05:52:46,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:52:46,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:52:46,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:52:46,680 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:52:46,682 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-13 05:52:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:52:46,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-13 05:52:46,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:52:46,764 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 05:52:46,764 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:52:46,797 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 05:52:46,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082156689] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:52:46,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 05:52:46,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 9 [2024-09-13 05:52:46,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546472214] [2024-09-13 05:52:46,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 05:52:46,797 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-13 05:52:46,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:52:46,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-13 05:52:46,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-09-13 05:52:46,798 INFO L87 Difference]: Start difference. First operand 53 states and 69 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 5 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-09-13 05:52:46,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:52:46,886 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2024-09-13 05:52:46,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-13 05:52:46,887 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 5 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 27 [2024-09-13 05:52:46,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:52:46,888 INFO L225 Difference]: With dead ends: 76 [2024-09-13 05:52:46,888 INFO L226 Difference]: Without dead ends: 76 [2024-09-13 05:52:46,888 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-09-13 05:52:46,888 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 41 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:52:46,889 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 87 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 05:52:46,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-09-13 05:52:46,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2024-09-13 05:52:46,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.173913043478261) internal successors, (54), 52 states have internal predecessors, (54), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 7 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-13 05:52:46,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2024-09-13 05:52:46,900 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 27 [2024-09-13 05:52:46,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:52:46,900 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2024-09-13 05:52:46,900 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 5 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-09-13 05:52:46,901 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2024-09-13 05:52:46,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-13 05:52:46,901 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:52:46,901 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:52:46,914 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-13 05:52:47,102 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-13 05:52:47,102 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 7 more)] === [2024-09-13 05:52:47,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:52:47,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1183758774, now seen corresponding path program 1 times [2024-09-13 05:52:47,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:52:47,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159829080] [2024-09-13 05:52:47,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:52:47,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:52:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:52:47,131 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 05:52:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:52:47,134 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:52:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:52:47,136 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 05:52:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:52:47,139 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 05:52:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:52:47,142 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-13 05:52:47,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:52:47,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159829080] [2024-09-13 05:52:47,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159829080] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:52:47,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:52:47,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 05:52:47,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554077607] [2024-09-13 05:52:47,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:52:47,144 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:52:47,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:52:47,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:52:47,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:52:47,144 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 05:52:47,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:52:47,167 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2024-09-13 05:52:47,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:52:47,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 30 [2024-09-13 05:52:47,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:52:47,169 INFO L225 Difference]: With dead ends: 64 [2024-09-13 05:52:47,169 INFO L226 Difference]: Without dead ends: 54 [2024-09-13 05:52:47,169 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-13 05:52:47,170 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:52:47,170 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 31 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:52:47,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-13 05:52:47,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-09-13 05:52:47,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.1) internal successors, (44), 42 states have internal predecessors, (44), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-13 05:52:47,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2024-09-13 05:52:47,174 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 30 [2024-09-13 05:52:47,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:52:47,174 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2024-09-13 05:52:47,174 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 05:52:47,175 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2024-09-13 05:52:47,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-13 05:52:47,175 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:52:47,175 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:52:47,175 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-13 05:52:47,176 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 7 more)] === [2024-09-13 05:52:47,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:52:47,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1085389180, now seen corresponding path program 2 times [2024-09-13 05:52:47,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:52:47,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113654248] [2024-09-13 05:52:47,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:52:47,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:52:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 05:52:47,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1204817057] [2024-09-13 05:52:47,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 05:52:47,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:52:47,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:52:47,239 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:52:47,247 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-13 05:52:47,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 05:52:47,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-09-13 05:52:47,606 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-13 05:52:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-13 05:52:47,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-13 05:52:47,664 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-13 05:52:47,665 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 10 remaining) [2024-09-13 05:52:47,666 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION (8 of 10 remaining) [2024-09-13 05:52:47,666 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION (7 of 10 remaining) [2024-09-13 05:52:47,666 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (6 of 10 remaining) [2024-09-13 05:52:47,667 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONPRE_CONDITION (5 of 10 remaining) [2024-09-13 05:52:47,667 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION (4 of 10 remaining) [2024-09-13 05:52:47,667 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONPOST_CONDITION (3 of 10 remaining) [2024-09-13 05:52:47,667 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION (2 of 10 remaining) [2024-09-13 05:52:47,667 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 10 remaining) [2024-09-13 05:52:47,667 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION (0 of 10 remaining) [2024-09-13 05:52:47,685 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-13 05:52:47,868 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-13 05:52:47,870 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:52:47,881 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-09-13 05:52:47,882 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-09-13 05:52:47,883 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-09-13 05:52:47,883 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-09-13 05:52:47,884 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-09-13 05:52:47,885 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-09-13 05:52:47,890 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 05:52:47,892 INFO L469 ceAbstractionStarter]: Automizer considered 1 witness invariants [2024-09-13 05:52:47,892 INFO L470 ceAbstractionStarter]: WitnessConsidered=1 [2024-09-13 05:52:47,892 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 05:52:47 BoogieIcfgContainer [2024-09-13 05:52:47,893 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 05:52:47,893 INFO L158 Benchmark]: Toolchain (without parser) took 806376.89ms. Allocated memory was 134.2MB in the beginning and 213.9MB in the end (delta: 79.7MB). Free memory was 63.0MB in the beginning and 114.6MB in the end (delta: -51.6MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2024-09-13 05:52:47,893 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 134.2MB. Free memory is still 94.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 05:52:47,893 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 134.2MB. Free memory is still 65.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 05:52:47,894 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.19ms. Allocated memory was 134.2MB in the beginning and 178.3MB in the end (delta: 44.0MB). Free memory was 62.8MB in the beginning and 146.3MB in the end (delta: -83.5MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2024-09-13 05:52:47,894 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.03ms. Allocated memory is still 178.3MB. Free memory was 146.3MB in the beginning and 144.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 05:52:47,894 INFO L158 Benchmark]: Boogie Preprocessor took 25.63ms. Allocated memory is still 178.3MB. Free memory was 144.2MB in the beginning and 142.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 05:52:47,897 INFO L158 Benchmark]: RCFGBuilder took 353.09ms. Allocated memory is still 178.3MB. Free memory was 142.1MB in the beginning and 126.5MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-13 05:52:47,901 INFO L158 Benchmark]: TraceAbstraction took 805655.78ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 125.3MB in the beginning and 114.6MB in the end (delta: 10.7MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. [2024-09-13 05:52:47,902 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 134.2MB. Free memory is still 94.9MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.16ms. Allocated memory is still 134.2MB. Free memory is still 65.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.19ms. Allocated memory was 134.2MB in the beginning and 178.3MB in the end (delta: 44.0MB). Free memory was 62.8MB in the beginning and 146.3MB in the end (delta: -83.5MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.03ms. Allocated memory is still 178.3MB. Free memory was 146.3MB in the beginning and 144.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.63ms. Allocated memory is still 178.3MB. Free memory was 144.2MB in the beginning and 142.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 353.09ms. Allocated memory is still 178.3MB. Free memory was 142.1MB in the beginning and 126.5MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 805655.78ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 125.3MB in the beginning and 114.6MB in the end (delta: 10.7MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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: Expected StepInfo for loop construct to contain Condition, but it did not - 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: 35]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L22] int counter = 0; [L23] Requires[BinaryExpression[COMPEQ,IdentifierExpression[counter],IntegerLiteral[0]]] [L24] int z, k; [L25] unsigned long long x, y, c; [L26] z = __VERIFIER_nondet_int() [L27] k = __VERIFIER_nondet_int() [L28] CALL assume_abort_if_not(z >= 1) VAL [\old(cond)=1, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L28] RET assume_abort_if_not(z >= 1) VAL [counter=0, k=3, z=8388608] [L29] CALL assume_abort_if_not(k >= 1) VAL [\old(cond)=1, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L29] RET assume_abort_if_not(k >= 1) VAL [counter=0, k=3, z=8388608] [L31] x = 1 [L32] y = z [L33] c = 1 VAL [c=1, counter=0, k=3, x=1, y=8388608, z=8388608] [L35] EXPR counter++ VAL [c=1, counter=1, k=3, x=1, y=8388608, z=8388608] [L35] COND TRUE counter++<5 [L36] CALL __VERIFIER_assert(x*z - x - y + 1 == 0) VAL [\old(cond)=1, counter=1] [L15] Requires[BinaryExpression[COMPLEQ,IntegerLiteral[1],OldValueExpression[IdentifierExpression[cond]]]] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L36] RET __VERIFIER_assert(x*z - x - y + 1 == 0) VAL [c=1, counter=1, k=3, x=1, y=8388608, z=8388608] [L38] COND FALSE !(!(c < k)) [L41] c = c + 1 [L42] x = x * z + 1 [L43] y = y * z VAL [c=2, counter=1, k=3, x=8388609, y=70368744177664, z=8388608] [L35] EXPR counter++ VAL [c=2, counter=2, k=3, x=8388609, y=70368744177664, z=8388608] [L35] COND TRUE counter++<5 [L36] CALL __VERIFIER_assert(x*z - x - y + 1 == 0) VAL [\old(cond)=1, counter=2] [L15] Requires[BinaryExpression[COMPLEQ,IntegerLiteral[1],OldValueExpression[IdentifierExpression[cond]]]] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L36] RET __VERIFIER_assert(x*z - x - y + 1 == 0) VAL [c=2, counter=2, k=3, x=8388609, y=70368744177664, z=8388608] [L38] COND FALSE !(!(c < k)) [L41] c = c + 1 [L42] x = x * z + 1 [L43] y = y * z VAL [c=3, counter=2, k=3, x=70368752566273, y=((unsigned __int128) 32 << 64), z=8388608] - UnprovableResult [Line: 23]: Unable to prove that procedure precondition always holds Unable to prove that procedure precondition always holds Reason: Not analyzed. - UnprovableResult [Line: 12]: Unable to prove that procedure precondition always holds Unable to prove that procedure precondition always holds Reason: Not analyzed. - UnprovableResult [Line: 12]: Unable to prove that procedure precondition always holds Unable to prove that procedure precondition always holds Reason: Not analyzed. - UnprovableResult [Line: 15]: Unable to prove that procedure precondition always holds Unable to prove that procedure precondition always holds Reason: Not analyzed. - UnprovableResult [Line: 15]: Unable to prove that procedure precondition always holds Unable to prove that procedure precondition always holds Reason: Not analyzed. - UnprovableResult [Line: 23]: Unable to prove that procedure postcondition always holds Unable to prove that procedure postcondition always holds Reason: Not analyzed. - UnprovableResult [Line: 12]: Unable to prove that procedure postcondition always holds Unable to prove that procedure postcondition always holds Reason: Not analyzed. - UnprovableResult [Line: 18]: 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: 15]: 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, 34 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 805.6s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 176.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 35 mSolverCounterUnknown, 118 SdHoareTripleChecker+Valid, 147.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 111 mSDsluCounter, 761 SdHoareTripleChecker+Invalid, 147.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 93 IncrementalHoareTripleChecker+Unchecked, 491 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 601 IncrementalHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 270 mSDtfsCounter, 601 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 258 GetRequests, 198 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 286.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=11, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 34 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 626.3s InterpolantComputationTime, 398 NumberOfCodeBlocks, 398 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 340 ConstructedInterpolants, 0 QuantifiedInterpolants, 3269 SizeOfPredicates, 10 NumberOfNonLiveVariables, 421 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 18 InterpolantComputations, 8 PerfectInterpolantSequences, 63/87 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-13 05:52:48,119 WARN L435 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-09-13 05:52:48,145 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...