This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-13 05:39:09,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 05:39:09,576 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 05:39:09,581 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 05:39:09,581 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 05:39:09,610 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 05:39:09,610 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 05:39:09,611 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 05:39:09,612 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 05:39:09,613 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 05:39:09,613 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 05:39:09,613 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 05:39:09,614 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 05:39:09,614 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 05:39:09,616 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 05:39:09,616 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 05:39:09,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 05:39:09,617 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 05:39:09,617 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 05:39:09,617 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 05:39:09,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 05:39:09,621 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 05:39:09,621 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 05:39:09,621 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 05:39:09,621 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 05:39:09,622 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 05:39:09,622 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 05:39:09,622 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 05:39:09,622 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 05:39:09,622 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 05:39:09,623 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 05:39:09,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 05:39:09,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 05:39:09,623 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 05:39:09,623 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 05:39:09,623 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 05:39:09,624 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 05:39:09,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 05:39:09,624 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 05:39:09,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 05:39:09,626 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 05:39:09,626 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 05:39:09,626 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:09,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 05:39:09,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 05:39:09,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 05:39:09,932 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-13 05:39:09,932 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-13 05:39:09,933 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_unwindbound1.yml/witness-2.1.yml [2024-09-13 05:39:09,983 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 05:39:09,983 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 05:39:09,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound1.c [2024-09-13 05:39:11,300 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 05:39:11,470 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 05:39:11,470 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound1.c [2024-09-13 05:39:11,475 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/d22279d83/ee6445652a2347149c83ab2a44eaa83b/FLAG200c571ae [2024-09-13 05:39:11,873 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/d22279d83/ee6445652a2347149c83ab2a44eaa83b [2024-09-13 05:39:11,874 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 05:39:11,875 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-13 05:39:11,877 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 05:39:11,877 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 05:39:11,881 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 05:39:11,882 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:09" (1/2) ... [2024-09-13 05:39:11,883 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6225a232 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:39:11, skipping insertion in model container [2024-09-13 05:39:11,883 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:09" (1/2) ... [2024-09-13 05:39:11,884 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4c88f88c and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:39:11, skipping insertion in model container [2024-09-13 05:39:11,885 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 05:39:11" (2/2) ... [2024-09-13 05:39:11,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6225a232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:39:11, skipping insertion in model container [2024-09-13 05:39:11,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 05:39:11" (2/2) ... [2024-09-13 05:39:11,894 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-13 05:39:11,894 INFO L1541 ArrayList]: Loop invariant at [L35-L45] (((((z == y) && (x == 1)) && (counter == 0)) || (((((unsigned __int128) 1 << 64) * ((((((__int128) z * x) + ((unsigned __int128) 18446744073709551615U * x)) + ((unsigned __int128) 18446744073709551615U * y)) + 1) / ((unsigned __int128) 1 << 64))) == (((((__int128) z * x) + ((unsigned __int128) 18446744073709551615U * x)) + ((unsigned __int128) 18446744073709551615U * y)) + 1)) && (1 <= counter))) && (\old(counter) == 0)) [2024-09-13 05:39:11,894 INFO L1541 ArrayList]: Function contract at [L12]: requires (counter == 0), ensures (counter == 0) [2024-09-13 05:39:11,895 INFO L1541 ArrayList]: Function contract at [L23]: requires (counter == 0), ensures (\old(counter) == 0) [2024-09-13 05:39:11,895 INFO L1541 ArrayList]: Function contract at [L15]: requires (\old(cond) == 1), ensures (\old(cond) == 1) [2024-09-13 05:39:11,910 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 05:39:12,045 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_unwindbound1.c[546,559] [2024-09-13 05:39:12,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 05:39:12,074 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global Start Parsing Global Start Parsing Global [2024-09-13 05:39:12,113 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_unwindbound1.c[546,559] Start Parsing Global Start Parsing Global Start Parsing Local [2024-09-13 05:39:12,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 05:39:12,146 INFO L204 MainTranslator]: Completed translation [2024-09-13 05:39:12,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:39:12 WrapperNode [2024-09-13 05:39:12,147 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 05:39:12,148 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 05:39:12,148 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 05:39:12,149 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 05:39:12,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:39:12" (1/1) ... [2024-09-13 05:39:12,162 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:39:12" (1/1) ... [2024-09-13 05:39:12,193 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2024-09-13 05:39:12,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 05:39:12,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 05:39:12,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 05:39:12,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 05:39:12,204 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:39:12" (1/1) ... [2024-09-13 05:39:12,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:39:12" (1/1) ... [2024-09-13 05:39:12,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:39:12" (1/1) ... [2024-09-13 05:39:12,214 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:12,217 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:39:12" (1/1) ... [2024-09-13 05:39:12,217 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:39:12" (1/1) ... [2024-09-13 05:39:12,220 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:39:12" (1/1) ... [2024-09-13 05:39:12,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:39:12" (1/1) ... [2024-09-13 05:39:12,232 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:39:12" (1/1) ... [2024-09-13 05:39:12,233 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:39:12" (1/1) ... [2024-09-13 05:39:12,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 05:39:12,237 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 05:39:12,237 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 05:39:12,237 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 05:39:12,238 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:39:12" (1/1) ... [2024-09-13 05:39:12,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 05:39:12,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:39:12,282 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:12,290 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:12,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 05:39:12,367 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 05:39:12,367 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 05:39:12,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-13 05:39:12,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 05:39:12,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 05:39:12,368 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 05:39:12,368 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 05:39:12,476 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 05:39:12,478 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 05:39:12,651 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-13 05:39:12,657 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-13 05:39:12,678 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-09-13 05:39:12,678 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 05:39:12,701 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 05:39:12,701 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-13 05:39:12,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 05:39:12 BoogieIcfgContainer [2024-09-13 05:39:12,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 05:39:12,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 05:39:12,704 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 05:39:12,708 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 05:39:12,708 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:09" (1/4) ... [2024-09-13 05:39:12,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c5274f and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 05:39:12, skipping insertion in model container [2024-09-13 05:39:12,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 05:39:11" (2/4) ... [2024-09-13 05:39:12,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c5274f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 05:39:12, skipping insertion in model container [2024-09-13 05:39:12,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:39:12" (3/4) ... [2024-09-13 05:39:12,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c5274f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 05:39:12, skipping insertion in model container [2024-09-13 05:39:12,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 05:39:12" (4/4) ... [2024-09-13 05:39:12,713 INFO L112 eAbstractionObserver]: Analyzing ICFG geo1-ll_unwindbound1.c [2024-09-13 05:39:12,732 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 05:39:12,732 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-09-13 05:39:12,772 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 05:39:12,779 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;@503a5db4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 05:39:12,779 INFO L337 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-09-13 05:39:12,783 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:12,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-09-13 05:39:12,789 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:39:12,789 INFO L216 NwaCegarLoop]: trace histogram [1, 1] [2024-09-13 05:39:12,790 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:12,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:39:12,798 INFO L85 PathProgramCache]: Analyzing trace with hash 3165, now seen corresponding path program 1 times [2024-09-13 05:39:12,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:39:12,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292221043] [2024-09-13 05:39:12,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:39:12,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:39:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:39:12,938 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:12,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:39:12,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292221043] [2024-09-13 05:39:12,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292221043] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:39:12,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:39:12,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-09-13 05:39:12,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208192309] [2024-09-13 05:39:12,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:39:12,954 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:39:12,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:39:12,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:39:12,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:39:12,995 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:13,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:39:13,048 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2024-09-13 05:39:13,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:39:13,050 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:13,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:39:13,054 INFO L225 Difference]: With dead ends: 33 [2024-09-13 05:39:13,055 INFO L226 Difference]: Without dead ends: 32 [2024-09-13 05:39:13,056 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:13,060 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:39:13,060 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 42 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:39:13,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-13 05:39:13,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2024-09-13 05:39:13,082 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:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2024-09-13 05:39:13,084 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 2 [2024-09-13 05:39:13,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:39:13,084 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-09-13 05:39:13,085 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:13,085 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2024-09-13 05:39:13,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-13 05:39:13,086 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:39:13,086 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:39:13,086 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 05:39:13,086 INFO L399 AbstractCegarLoop]: === Iteration 2 === 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:13,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:39:13,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1437512956, now seen corresponding path program 1 times [2024-09-13 05:39:13,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:39:13,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494912899] [2024-09-13 05:39:13,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:39:13,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:39:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:39:13,667 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 05:39:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:39:13,688 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:39:13,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:39:13,699 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:13,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:39:13,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494912899] [2024-09-13 05:39:13,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494912899] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:39:13,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:39:13,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 05:39:13,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280597263] [2024-09-13 05:39:13,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:39:13,702 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:39:13,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:39:13,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:39:13,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:39:13,704 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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:13,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:39:13,760 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2024-09-13 05:39:13,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:39:13,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 14 [2024-09-13 05:39:13,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:39:13,762 INFO L225 Difference]: With dead ends: 31 [2024-09-13 05:39:13,762 INFO L226 Difference]: Without dead ends: 31 [2024-09-13 05:39:13,763 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:39:13,764 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:39:13,765 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 56 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:39:13,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-13 05:39:13,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2024-09-13 05:39:13,771 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:13,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-09-13 05:39:13,773 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 14 [2024-09-13 05:39:13,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:39:13,774 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-09-13 05:39:13,775 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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:13,775 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-09-13 05:39:13,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-13 05:39:13,777 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:39:13,777 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:39:13,777 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 05:39:13,778 INFO L399 AbstractCegarLoop]: === Iteration 3 === 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:13,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:39:13,778 INFO L85 PathProgramCache]: Analyzing trace with hash 170482061, now seen corresponding path program 1 times [2024-09-13 05:39:13,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:39:13,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747594990] [2024-09-13 05:39:13,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:39:13,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:39:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 05:39:13,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1105159526] [2024-09-13 05:39:13,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:39:13,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:39:13,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:39:13,809 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:13,811 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:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:39:13,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-13 05:39:13,881 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:39:13,925 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:13,925 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 05:39:13,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:39:13,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747594990] [2024-09-13 05:39:13,926 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 05:39:13,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105159526] [2024-09-13 05:39:13,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105159526] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:39:13,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:39:13,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 05:39:13,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653806305] [2024-09-13 05:39:13,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:39:13,928 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:39:13,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:39:13,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:39:13,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:39:13,931 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:13,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:39:13,963 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2024-09-13 05:39:13,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:39:13,964 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:13,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:39:13,965 INFO L225 Difference]: With dead ends: 35 [2024-09-13 05:39:13,965 INFO L226 Difference]: Without dead ends: 35 [2024-09-13 05:39:13,966 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:13,967 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:13,968 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:13,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-13 05:39:13,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-09-13 05:39:13,974 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:13,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-09-13 05:39:13,976 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 17 [2024-09-13 05:39:13,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:39:13,977 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-09-13 05:39:13,977 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:13,977 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-09-13 05:39:13,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-13 05:39:13,978 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:39:13,978 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:13,996 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-13 05:39:14,182 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:14,184 INFO L399 AbstractCegarLoop]: === Iteration 4 === 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:14,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:39:14,185 INFO L85 PathProgramCache]: Analyzing trace with hash 989974986, now seen corresponding path program 1 times [2024-09-13 05:39:14,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:39:14,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816012094] [2024-09-13 05:39:14,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:39:14,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:39:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:39:14,264 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 05:39:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:39:14,273 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:39:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:39:14,282 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:14,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:39:14,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816012094] [2024-09-13 05:39:14,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816012094] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:39:14,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:39:14,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 05:39:14,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489921684] [2024-09-13 05:39:14,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:39:14,286 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 05:39:14,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:39:14,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 05:39:14,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 05:39:14,287 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:14,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:39:14,324 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-09-13 05:39:14,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 05:39:14,325 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:14,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:39:14,329 INFO L225 Difference]: With dead ends: 33 [2024-09-13 05:39:14,329 INFO L226 Difference]: Without dead ends: 33 [2024-09-13 05:39:14,330 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:14,331 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:14,332 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:14,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-13 05:39:14,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-09-13 05:39:14,338 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:14,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-09-13 05:39:14,339 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 18 [2024-09-13 05:39:14,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:39:14,340 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-09-13 05:39:14,340 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:14,340 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-09-13 05:39:14,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-13 05:39:14,341 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:39:14,342 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:14,342 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-13 05:39:14,342 INFO L399 AbstractCegarLoop]: === Iteration 5 === 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:14,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:39:14,342 INFO L85 PathProgramCache]: Analyzing trace with hash -2113848269, now seen corresponding path program 1 times [2024-09-13 05:39:14,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:39:14,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238013800] [2024-09-13 05:39:14,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:39:14,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:39:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:39:14,395 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 05:39:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:39:14,398 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:39:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:39:14,401 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:14,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:39:14,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238013800] [2024-09-13 05:39:14,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238013800] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:39:14,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:39:14,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:39:14,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645638808] [2024-09-13 05:39:14,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:39:14,402 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:39:14,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:39:14,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:39:14,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:39:14,406 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:14,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:39:14,417 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-09-13 05:39:14,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:39:14,418 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:14,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:39:14,419 INFO L225 Difference]: With dead ends: 31 [2024-09-13 05:39:14,420 INFO L226 Difference]: Without dead ends: 31 [2024-09-13 05:39:14,420 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:14,421 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:14,422 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:14,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-13 05:39:14,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-13 05:39:14,428 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:14,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-09-13 05:39:14,428 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 20 [2024-09-13 05:39:14,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:39:14,429 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-09-13 05:39:14,429 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:14,429 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-09-13 05:39:14,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-13 05:39:14,432 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:39:14,432 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:14,432 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-13 05:39:14,432 INFO L399 AbstractCegarLoop]: === Iteration 6 === 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:14,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:39:14,433 INFO L85 PathProgramCache]: Analyzing trace with hash -2113848108, now seen corresponding path program 1 times [2024-09-13 05:39:14,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:39:14,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9624492] [2024-09-13 05:39:14,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:39:14,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:39:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:39:14,470 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 05:39:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:39:14,474 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:39:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:39:14,477 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:14,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:39:14,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9624492] [2024-09-13 05:39:14,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9624492] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:39:14,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:39:14,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 05:39:14,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240246941] [2024-09-13 05:39:14,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:39:14,479 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:39:14,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:39:14,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:39:14,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:39:14,480 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:14,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:39:14,502 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-09-13 05:39:14,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:39:14,502 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:14,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:39:14,503 INFO L225 Difference]: With dead ends: 30 [2024-09-13 05:39:14,503 INFO L226 Difference]: Without dead ends: 30 [2024-09-13 05:39:14,504 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:14,505 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:14,506 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:14,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-13 05:39:14,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-13 05:39:14,511 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:14,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-09-13 05:39:14,512 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2024-09-13 05:39:14,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:39:14,512 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-09-13 05:39:14,512 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:14,512 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-09-13 05:39:14,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-13 05:39:14,514 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:39:14,514 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:14,514 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-13 05:39:14,514 INFO L399 AbstractCegarLoop]: === Iteration 7 === 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:14,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:39:14,515 INFO L85 PathProgramCache]: Analyzing trace with hash -838455040, now seen corresponding path program 1 times [2024-09-13 05:39:14,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:39:14,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696150649] [2024-09-13 05:39:14,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:39:14,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:39:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 05:39:14,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1859062866] [2024-09-13 05:39:14,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:39:14,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:39:14,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:39:14,576 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:14,579 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:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:39:15,386 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-09-13 05:39:15,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:39:15,772 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-13 05:39:15,773 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:39:45,009 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:40:02,203 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification. DAG size of input: 19 DAG size of output: 18 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:40:16,889 WARN L293 SmtUtils]: Spent 10.25s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:40:21,125 WARN L876 $PredicateComparison]: unable to prove that (or (let ((.cse1 (mod |c_ULTIMATE.start_main_~y~0#1| 18446744073709551616)) (.cse0 (mod |c_ULTIMATE.start_main_~x~0#1| 18446744073709551616))) (and (or (not (= c_~counter~0 0)) (not (= .cse0 1)) (not (= (mod |c_ULTIMATE.start_main_~z~0#1| 18446744073709551616) .cse1))) (or (< c_~counter~0 1) (not (let ((.cse2 (mod (+ (* 18446744073709551615 .cse0) (* 18446744073709551615 .cse1) (* .cse0 |c_ULTIMATE.start_main_~z~0#1|) 1) 340282366920938463463374607431768211456))) (= (* 18446744073709551616 (div .cse2 18446744073709551616)) .cse2)))))) (let ((.cse3 (mod (let ((.cse4 (mod (+ (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|) 1) 18446744073709551616))) (+ (* |c_ULTIMATE.start_main_~z~0#1| .cse4) (* 18446744073709551615 .cse4) (* 18446744073709551615 (mod (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~z~0#1|) 18446744073709551616)) 1)) 340282366920938463463374607431768211456))) (= (* 18446744073709551616 (div .cse3 18446744073709551616)) .cse3))) is different from true [2024-09-13 05:40:29,164 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:40:37,176 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:40:45,248 WARN L876 $PredicateComparison]: unable to prove that (or (let ((.cse0 (mod (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~z~0#1| 1) 18446744073709551616))) (+ (* |c_ULTIMATE.start_main_~z~0#1| .cse1) (* 18446744073709551615 (mod (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) 18446744073709551616)) (* 18446744073709551615 .cse1) 1)) 340282366920938463463374607431768211456))) (= .cse0 (* 18446744073709551616 (div .cse0 18446744073709551616)))) (and (not (= c_~counter~0 0)) (<= c_~counter~0 0))) is different from true [2024-09-13 05:40:53,265 WARN L293 SmtUtils]: Spent 8.00s 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:41:01,270 WARN L293 SmtUtils]: Spent 8.00s 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:41:06,653 WARN L293 SmtUtils]: Spent 5.38s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:41:14,682 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:41:22,751 WARN L293 SmtUtils]: Spent 8.07s 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:41:30,763 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:41:38,812 WARN L876 $PredicateComparison]: unable to prove that (or (let ((.cse0 (mod (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~z~0#1| 1) 18446744073709551616))) (+ (* |c_ULTIMATE.start_main_~z~0#1| .cse1) (* 18446744073709551615 (mod (* |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~z~0#1|) 18446744073709551616)) (* 18446744073709551615 .cse1) 1)) 340282366920938463463374607431768211456))) (= .cse0 (* 18446744073709551616 (div .cse0 18446744073709551616)))) (< |c_ULTIMATE.start_main_~z~0#1| 1) (and (not (= c_~counter~0 0)) (<= c_~counter~0 0))) is different from true [2024-09-13 05:41:43,109 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2024-09-13 05:41:43,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:41:43,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696150649] [2024-09-13 05:41:43,109 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 05:41:43,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859062866] [2024-09-13 05:41:43,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859062866] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:41:43,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 05:41:43,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 17 [2024-09-13 05:41:43,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633947741] [2024-09-13 05:41:43,110 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 05:41:43,110 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-13 05:41:43,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:41:43,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-13 05:41:43,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=161, Unknown=5, NotChecked=84, Total=306 [2024-09-13 05:41:43,111 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 18 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-13 05:41:51,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:41:54,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:42:00,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:42:04,301 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:42:16,438 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:42:20,443 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:42:24,457 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:42:28,467 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:42:32,492 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:42:36,522 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:42:40,544 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:42:44,551 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:42:48,561 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:42:52,573 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:42:56,576 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:43:00,580 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:43:04,593 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:43:08,598 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:43:12,616 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:43:16,622 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:43:20,626 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:43:24,629 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:43:28,647 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:43:32,651 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:43:36,654 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:43:40,662 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:43:44,668 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:43:48,677 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:43:52,692 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:43:56,696 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:44:00,699 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:44:04,718 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:44:08,731 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:44:12,736 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:44:12,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:44:12,748 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2024-09-13 05:44:12,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-13 05:44:12,749 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Word has length 23 [2024-09-13 05:44:12,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:44:12,749 INFO L225 Difference]: With dead ends: 39 [2024-09-13 05:44:12,749 INFO L226 Difference]: Without dead ends: 39 [2024-09-13 05:44:12,749 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 46.5s TimeCoverageRelationStatistics Valid=62, Invalid=183, Unknown=7, NotChecked=90, Total=342 [2024-09-13 05:44:12,750 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 31 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 8 mSolverCounterUnsat, 32 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 134.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 32 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 134.4s IncrementalHoareTripleChecker+Time [2024-09-13 05:44:12,750 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 51 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 170 Invalid, 32 Unknown, 137 Unchecked, 134.4s Time] [2024-09-13 05:44:12,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-09-13 05:44:12,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-09-13 05:44:12,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 28 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-13 05:44:12,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2024-09-13 05:44:12,755 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 23 [2024-09-13 05:44:12,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:44:12,755 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2024-09-13 05:44:12,755 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-13 05:44:12,755 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2024-09-13 05:44:12,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-13 05:44:12,756 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:44:12,756 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:44:12,763 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:44:12,956 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-13 05:44:12,957 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 7 more)] === [2024-09-13 05:44:12,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:44:12,957 INFO L85 PathProgramCache]: Analyzing trace with hash -222303701, now seen corresponding path program 1 times [2024-09-13 05:44:12,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:44:12,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276954267] [2024-09-13 05:44:12,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:44:12,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:44:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:44:13,096 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 05:44:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:44:13,101 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:44:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:44:13,103 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 05:44:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:44:13,122 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:44:13,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:44:13,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276954267] [2024-09-13 05:44:13,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276954267] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:44:13,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:44:13,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 05:44:13,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427029329] [2024-09-13 05:44:13,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:44:13,124 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 05:44:13,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:44:13,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 05:44:13,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 05:44:13,126 INFO L87 Difference]: Start difference. First operand 37 states and 45 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:44:17,172 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:44:21,222 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:44:21,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:44:21,251 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2024-09-13 05:44:21,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:44:21,252 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:44:21,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:44:21,252 INFO L225 Difference]: With dead ends: 40 [2024-09-13 05:44:21,252 INFO L226 Difference]: Without dead ends: 40 [2024-09-13 05:44:21,252 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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:44:21,253 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:44:21,253 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 64 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2024-09-13 05:44:21,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-09-13 05:44:21,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2024-09-13 05:44:21,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-13 05:44:21,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2024-09-13 05:44:21,257 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 24 [2024-09-13 05:44:21,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:44:21,257 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2024-09-13 05:44:21,258 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:44:21,258 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2024-09-13 05:44:21,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-13 05:44:21,259 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:44:21,259 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:44:21,259 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-13 05:44:21,259 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:44:21,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:44:21,260 INFO L85 PathProgramCache]: Analyzing trace with hash 228284870, now seen corresponding path program 1 times [2024-09-13 05:44:21,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:44:21,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624464817] [2024-09-13 05:44:21,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:44:21,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:44:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:44:21,839 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 05:44:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:44:21,850 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:44:21,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:44:21,855 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 05:44:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:44:21,859 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:44:21,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:44:21,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624464817] [2024-09-13 05:44:21,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624464817] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:44:21,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132527693] [2024-09-13 05:44:21,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:44:21,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:44:21,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:44:21,862 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:44:21,863 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:44:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:44:21,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-13 05:44:21,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:44:25,750 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-13 05:44:25,750 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:44:38,731 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 3 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 05:44:38,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132527693] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:44:38,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 05:44:38,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 4] total 13 [2024-09-13 05:44:38,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193589887] [2024-09-13 05:44:38,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 05:44:38,733 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-13 05:44:38,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:44:38,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-13 05:44:38,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=144, Unknown=3, NotChecked=0, Total=182 [2024-09-13 05:44:38,733 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 6 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-09-13 05:44:43,627 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:45:08,832 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:45:12,884 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:45:15,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:45:38,867 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:45:43,039 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:45:47,044 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:45:51,048 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:45:55,063 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:45:59,074 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:46:03,083 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:46:07,087 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:46:11,095 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:46:15,114 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:46:15,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:46:15,114 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2024-09-13 05:46:15,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-13 05:46:15,118 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 6 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 27 [2024-09-13 05:46:15,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:46:15,119 INFO L225 Difference]: With dead ends: 52 [2024-09-13 05:46:15,119 INFO L226 Difference]: Without dead ends: 52 [2024-09-13 05:46:15,119 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 57.7s TimeCoverageRelationStatistics Valid=118, Invalid=523, Unknown=9, NotChecked=0, Total=650 [2024-09-13 05:46:15,120 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 55 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 22 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.7s IncrementalHoareTripleChecker+Time [2024-09-13 05:46:15,120 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 152 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 209 Invalid, 13 Unknown, 0 Unchecked, 55.7s Time] [2024-09-13 05:46:15,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-09-13 05:46:15,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 35. [2024-09-13 05:46:15,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-13 05:46:15,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2024-09-13 05:46:15,125 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 27 [2024-09-13 05:46:15,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:46:15,125 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2024-09-13 05:46:15,126 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 6 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-09-13 05:46:15,126 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2024-09-13 05:46:15,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-13 05:46:15,127 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:46:15,128 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:46:15,145 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-13 05:46:15,329 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-09-13 05:46:15,329 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 7 more)] === [2024-09-13 05:46:15,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:46:15,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1183758774, now seen corresponding path program 1 times [2024-09-13 05:46:15,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:46:15,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901297803] [2024-09-13 05:46:15,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:46:15,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:46:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:46:15,373 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 05:46:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:46:15,376 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:46:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:46:15,379 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 05:46:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:46:15,382 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 05:46:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:46:15,387 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:46:15,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:46:15,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901297803] [2024-09-13 05:46:15,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901297803] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:46:15,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:46:15,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 05:46:15,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060107477] [2024-09-13 05:46:15,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:46:15,388 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:46:15,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:46:15,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:46:15,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:46:15,390 INFO L87 Difference]: Start difference. First operand 35 states and 43 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:46:15,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:46:15,407 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2024-09-13 05:46:15,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:46:15,407 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:46:15,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:46:15,408 INFO L225 Difference]: With dead ends: 34 [2024-09-13 05:46:15,408 INFO L226 Difference]: Without dead ends: 30 [2024-09-13 05:46:15,408 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:46:15,408 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 29 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:46:15,409 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 29 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:46:15,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-13 05:46:15,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-13 05:46:15,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 05:46:15,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-09-13 05:46:15,411 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 30 [2024-09-13 05:46:15,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:46:15,413 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-09-13 05:46:15,413 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:46:15,414 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-09-13 05:46:15,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-13 05:46:15,416 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:46:15,416 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:46:15,416 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-13 05:46:15,416 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 7 more)] === [2024-09-13 05:46:15,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:46:15,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1154734720, now seen corresponding path program 2 times [2024-09-13 05:46:15,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:46:15,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211394451] [2024-09-13 05:46:15,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:46:15,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:46:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:46:15,533 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 05:46:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:46:15,539 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:46:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:46:15,542 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 05:46:15,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:46:15,547 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 05:46:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:46:15,552 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-13 05:46:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:46:15,554 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-09-13 05:46:15,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:46:15,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211394451] [2024-09-13 05:46:15,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211394451] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:46:15,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324814100] [2024-09-13 05:46:15,555 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 05:46:15,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:46:15,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:46:15,557 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:46:15,558 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:46:15,608 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 05:46:15,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 05:46:15,609 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-13 05:46:15,610 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:46:15,663 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-09-13 05:46:15,663 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:46:15,713 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-09-13 05:46:15,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324814100] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:46:15,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 05:46:15,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 6 [2024-09-13 05:46:15,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125293534] [2024-09-13 05:46:15,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 05:46:15,714 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 05:46:15,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:46:15,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 05:46:15,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 05:46:15,714 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 4 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-09-13 05:46:15,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:46:15,741 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2024-09-13 05:46:15,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 05:46:15,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 4 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 41 [2024-09-13 05:46:15,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:46:15,742 INFO L225 Difference]: With dead ends: 21 [2024-09-13 05:46:15,742 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 05:46:15,742 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-09-13 05:46:15,743 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:46:15,743 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 29 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:46:15,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 05:46:15,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 05:46:15,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:46:15,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 05:46:15,743 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2024-09-13 05:46:15,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:46:15,744 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 05:46:15,744 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 4 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-09-13 05:46:15,744 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 05:46:15,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 05:46:15,747 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITION (9 of 10 remaining) [2024-09-13 05:46:15,747 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION (8 of 10 remaining) [2024-09-13 05:46:15,747 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (7 of 10 remaining) [2024-09-13 05:46:15,747 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 10 remaining) [2024-09-13 05:46:15,747 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONPRE_CONDITION (5 of 10 remaining) [2024-09-13 05:46:15,748 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION (4 of 10 remaining) [2024-09-13 05:46:15,748 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONPOST_CONDITION (3 of 10 remaining) [2024-09-13 05:46:15,748 INFO L785 garLoopResultBuilder]: Registering result SAFE for location assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION (2 of 10 remaining) [2024-09-13 05:46:15,748 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 10 remaining) [2024-09-13 05:46:15,748 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION (0 of 10 remaining) [2024-09-13 05:46:15,762 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:46:15,949 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:46:15,951 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:46:15,953 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 05:46:15,955 INFO L469 ceAbstractionStarter]: Automizer considered 1 witness invariants [2024-09-13 05:46:15,955 INFO L470 ceAbstractionStarter]: WitnessConsidered=1 [2024-09-13 05:46:15,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 05:46:15 BoogieIcfgContainer [2024-09-13 05:46:15,956 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 05:46:15,956 INFO L158 Benchmark]: Toolchain (without parser) took 424081.38ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 98.1MB in the beginning and 138.6MB in the end (delta: -40.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 05:46:15,957 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 96.5MB. Free memory was 58.0MB in the beginning and 57.9MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 05:46:15,957 INFO L158 Benchmark]: CDTParser took 0.72ms. Allocated memory is still 96.5MB. Free memory was 55.9MB in the beginning and 55.9MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 05:46:15,957 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.01ms. Allocated memory is still 151.0MB. Free memory was 98.1MB in the beginning and 84.2MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-13 05:46:15,957 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.38ms. Allocated memory is still 151.0MB. Free memory was 84.2MB in the beginning and 122.3MB in the end (delta: -38.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-13 05:46:15,958 INFO L158 Benchmark]: Boogie Preprocessor took 40.88ms. Allocated memory is still 151.0MB. Free memory was 122.3MB in the beginning and 120.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 05:46:15,958 INFO L158 Benchmark]: RCFGBuilder took 465.01ms. Allocated memory is still 151.0MB. Free memory was 120.6MB in the beginning and 110.2MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-09-13 05:46:15,958 INFO L158 Benchmark]: TraceAbstraction took 423252.54ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 109.3MB in the beginning and 138.6MB in the end (delta: -29.3MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. [2024-09-13 05:46:15,959 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.15ms. Allocated memory is still 96.5MB. Free memory was 58.0MB in the beginning and 57.9MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.72ms. Allocated memory is still 96.5MB. Free memory was 55.9MB in the beginning and 55.9MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.01ms. Allocated memory is still 151.0MB. Free memory was 98.1MB in the beginning and 84.2MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.38ms. Allocated memory is still 151.0MB. Free memory was 84.2MB in the beginning and 122.3MB in the end (delta: -38.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.88ms. Allocated memory is still 151.0MB. Free memory was 122.3MB in the beginning and 120.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 465.01ms. Allocated memory is still 151.0MB. Free memory was 120.6MB in the beginning and 110.2MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 423252.54ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 109.3MB in the beginning and 138.6MB in the end (delta: -29.3MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. * 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 - PositiveResult [Line: 23]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 12]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 12]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 35]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 15]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 15]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 23]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - PositiveResult [Line: 12]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 15]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 34 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 423.2s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 254.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 47 mSolverCounterUnknown, 115 SdHoareTripleChecker+Valid, 198.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 112 mSDsluCounter, 629 SdHoareTripleChecker+Invalid, 198.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 137 IncrementalHoareTripleChecker+Unchecked, 397 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 566 IncrementalHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 232 mSDtfsCounter, 566 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 214 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 104.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=8, InterpolantAutomatonStates: 63, 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, 11 MinimizatonAttempts, 26 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 166.4s InterpolantComputationTime, 344 NumberOfCodeBlocks, 344 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 379 ConstructedInterpolants, 1 QuantifiedInterpolants, 2364 SizeOfPredicates, 3 NumberOfNonLiveVariables, 401 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 143/165 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 - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-09-13 05:46:16,173 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...