This is Ultimate 0.2.4-tmp.dk.referee-eval-f1d7dc9-m [2024-09-20 13:37:56,592 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 13:37:56,703 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 13:37:56,711 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 13:37:56,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 13:37:56,742 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 13:37:56,745 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 13:37:56,745 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 13:37:56,746 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 13:37:56,749 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 13:37:56,750 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 13:37:56,750 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 13:37:56,750 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 13:37:56,751 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 13:37:56,751 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 13:37:56,751 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 13:37:56,751 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 13:37:56,752 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 13:37:56,752 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 13:37:56,752 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 13:37:56,752 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 13:37:56,755 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 13:37:56,755 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 13:37:56,755 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 13:37:56,756 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 13:37:56,756 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 13:37:56,756 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 13:37:56,756 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 13:37:56,757 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 13:37:56,757 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 13:37:56,757 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 13:37:56,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 13:37:56,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 13:37:56,758 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 13:37:56,758 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 13:37:56,758 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 13:37:56,759 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 13:37:56,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 13:37:56,760 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 13:37:56,760 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 13:37:56,760 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 13:37:56,760 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 13:37:56,760 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-20 13:37:56,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 13:37:57,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 13:37:57,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 13:37:57,021 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 13:37:57,021 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 13:37:57,022 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound100.c [2024-09-20 13:37:58,409 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 13:37:58,581 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 13:37:58,581 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound100.c [2024-09-20 13:37:58,587 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/208567907/d5ff76bdf5114e358948fac23223b8f6/FLAG1644731c4 [2024-09-20 13:37:58,599 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/208567907/d5ff76bdf5114e358948fac23223b8f6 [2024-09-20 13:37:58,601 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-20 13:37:58,602 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-20 13:37:58,602 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/hard-u_valuebound100.yml/witness-2.1.yml [2024-09-20 13:37:58,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 13:37:58,656 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-20 13:37:58,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 13:37:58,659 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 13:37:58,663 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 13:37:58,664 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:37:58" (1/2) ... [2024-09-20 13:37:58,667 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a53b197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:37:58, skipping insertion in model container [2024-09-20 13:37:58,667 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:37:58" (1/2) ... [2024-09-20 13:37:58,668 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7c3664d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:37:58, skipping insertion in model container [2024-09-20 13:37:58,668 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.09 01:37:58" (2/2) ... [2024-09-20 13:37:58,669 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a53b197 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:37:58, skipping insertion in model container [2024-09-20 13:37:58,669 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.09 01:37:58" (2/2) ... [2024-09-20 13:37:58,678 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-20 13:37:58,680 INFO L1541 ArrayList]: Loop invariant at [L36-L44] (((((((A <= 100) && (r == A)) && (1 <= B)) && (A <= ((long long) A + r))) && (q == 0)) && (B <= 100)) && (d == (((unsigned long long) B * p) % 4294967296))) [2024-09-20 13:37:58,680 INFO L1541 ArrayList]: Loop invariant at [L46-L58] ((((((A <= 100) && (r == A)) && (1 <= B)) && (q == 0)) && (B <= 100)) && (d == (((unsigned long long) B * p) % 4294967296))) [2024-09-20 13:37:58,680 INFO L1541 ArrayList]: Function contract at [L14]: requires (1 <= \old(cond)), ensures (1 <= \old(cond)) [2024-09-20 13:37:58,681 INFO L1541 ArrayList]: Function contract at [L11]: requires null, ensures (\old(cond) != 0) [2024-09-20 13:37:58,698 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 13:37:58,891 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound100.c[537,550] [2024-09-20 13:37:58,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 13:37:58,918 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global Start Parsing Global [2024-09-20 13:37:58,957 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound100.c[537,550] Start Parsing Local Start Parsing Local [2024-09-20 13:37:58,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 13:37:58,996 INFO L204 MainTranslator]: Completed translation [2024-09-20 13:37:58,997 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:37:58 WrapperNode [2024-09-20 13:37:58,998 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 13:37:58,999 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 13:37:58,999 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 13:37:58,999 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 13:37:59,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:37:58" (1/1) ... [2024-09-20 13:37:59,011 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:37:58" (1/1) ... [2024-09-20 13:37:59,031 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-09-20 13:37:59,033 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 13:37:59,034 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 13:37:59,034 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 13:37:59,034 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 13:37:59,044 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:37:58" (1/1) ... [2024-09-20 13:37:59,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:37:58" (1/1) ... [2024-09-20 13:37:59,051 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:37:58" (1/1) ... [2024-09-20 13:37:59,060 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-20 13:37:59,060 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:37:58" (1/1) ... [2024-09-20 13:37:59,060 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:37:58" (1/1) ... [2024-09-20 13:37:59,063 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:37:58" (1/1) ... [2024-09-20 13:37:59,070 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:37:58" (1/1) ... [2024-09-20 13:37:59,071 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:37:58" (1/1) ... [2024-09-20 13:37:59,071 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:37:58" (1/1) ... [2024-09-20 13:37:59,075 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 13:37:59,076 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 13:37:59,079 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 13:37:59,079 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 13:37:59,080 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:37:58" (1/1) ... [2024-09-20 13:37:59,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 13:37:59,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:37:59,108 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-20 13:37:59,109 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-20 13:37:59,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 13:37:59,146 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-20 13:37:59,147 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-20 13:37:59,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-20 13:37:59,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 13:37:59,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 13:37:59,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 13:37:59,147 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 13:37:59,204 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 13:37:59,205 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 13:37:59,380 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-20 13:37:59,414 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-09-20 13:37:59,415 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 13:37:59,439 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 13:37:59,439 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-20 13:37:59,439 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:37:59 BoogieIcfgContainer [2024-09-20 13:37:59,440 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 13:37:59,441 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 13:37:59,441 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 13:37:59,444 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 13:37:59,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:37:58" (1/4) ... [2024-09-20 13:37:59,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a83b04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:37:59, skipping insertion in model container [2024-09-20 13:37:59,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.09 01:37:58" (2/4) ... [2024-09-20 13:37:59,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a83b04 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.09 01:37:59, skipping insertion in model container [2024-09-20 13:37:59,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:37:58" (3/4) ... [2024-09-20 13:37:59,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a83b04 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.09 01:37:59, skipping insertion in model container [2024-09-20 13:37:59,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:37:59" (4/4) ... [2024-09-20 13:37:59,447 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-u_valuebound100.c [2024-09-20 13:37:59,462 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 13:37:59,462 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-09-20 13:37:59,501 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 13:37:59,508 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;@7291fb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 13:37:59,509 INFO L337 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-09-20 13:37:59,512 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 25 states have (on average 1.56) internal successors, (39), 30 states have internal predecessors, (39), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-20 13:37:59,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-20 13:37:59,522 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:37:59,523 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-20 13:37:59,524 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-20 13:37:59,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:37:59,530 INFO L85 PathProgramCache]: Analyzing trace with hash 134843102, now seen corresponding path program 1 times [2024-09-20 13:37:59,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:37:59,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343493090] [2024-09-20 13:37:59,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:37:59,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:37:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:37:59,652 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-20 13:37:59,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:37:59,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343493090] [2024-09-20 13:37:59,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343493090] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:37:59,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:37:59,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-20 13:37:59,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961170385] [2024-09-20 13:37:59,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:37:59,659 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-20 13:37:59,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:37:59,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-20 13:37:59,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-20 13:37:59,683 INFO L87 Difference]: Start difference. First operand has 43 states, 25 states have (on average 1.56) internal successors, (39), 30 states have internal predecessors, (39), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:37:59,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:37:59,705 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-09-20 13:37:59,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-20 13:37:59,710 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-09-20 13:37:59,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:37:59,719 INFO L225 Difference]: With dead ends: 43 [2024-09-20 13:37:59,719 INFO L226 Difference]: Without dead ends: 41 [2024-09-20 13:37:59,722 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-20 13:37:59,725 INFO L434 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:37:59,729 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:37:59,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-20 13:37:59,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-09-20 13:37:59,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 29 states have internal predecessors, (32), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-20 13:37:59,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2024-09-20 13:37:59,765 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 5 [2024-09-20 13:37:59,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:37:59,766 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2024-09-20 13:37:59,766 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:37:59,766 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2024-09-20 13:37:59,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-20 13:37:59,767 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:37:59,767 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-20 13:37:59,768 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 13:37:59,768 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-20 13:37:59,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:37:59,769 INFO L85 PathProgramCache]: Analyzing trace with hash 134843164, now seen corresponding path program 1 times [2024-09-20 13:37:59,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:37:59,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747240633] [2024-09-20 13:37:59,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:37:59,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:37:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:37:59,874 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-20 13:37:59,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:37:59,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747240633] [2024-09-20 13:37:59,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747240633] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:37:59,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:37:59,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 13:37:59,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709387210] [2024-09-20 13:37:59,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:37:59,877 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-20 13:37:59,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:37:59,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-20 13:37:59,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-20 13:37:59,878 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:37:59,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:37:59,923 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2024-09-20 13:37:59,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-20 13:37:59,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-09-20 13:37:59,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:37:59,925 INFO L225 Difference]: With dead ends: 40 [2024-09-20 13:37:59,925 INFO L226 Difference]: Without dead ends: 40 [2024-09-20 13:37:59,925 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-20 13:37:59,927 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:37:59,927 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 121 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:37:59,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-09-20 13:37:59,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-09-20 13:37:59,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 28 states have internal predecessors, (31), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-20 13:37:59,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2024-09-20 13:37:59,934 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 5 [2024-09-20 13:37:59,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:37:59,934 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2024-09-20 13:37:59,935 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:37:59,935 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2024-09-20 13:37:59,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-20 13:37:59,936 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:37:59,936 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:37:59,936 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-20 13:37:59,936 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-20 13:37:59,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:37:59,937 INFO L85 PathProgramCache]: Analyzing trace with hash 363565673, now seen corresponding path program 1 times [2024-09-20 13:37:59,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:37:59,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107044043] [2024-09-20 13:37:59,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:37:59,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:38:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 13:38:00,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [925849165] [2024-09-20 13:38:00,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:38:00,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:38:00,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:38:00,036 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-20 13:38:00,037 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-20 13:38:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:38:00,098 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-20 13:38:00,104 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:38:00,329 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-20 13:38:00,330 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 13:38:00,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:38:00,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107044043] [2024-09-20 13:38:00,331 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-20 13:38:00,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925849165] [2024-09-20 13:38:00,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925849165] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:38:00,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:38:00,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-20 13:38:00,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130657814] [2024-09-20 13:38:00,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:38:00,334 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-20 13:38:00,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:38:00,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-20 13:38:00,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-20 13:38:00,335 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 7 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-20 13:38:00,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:38:00,556 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2024-09-20 13:38:00,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-20 13:38:00,558 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 19 [2024-09-20 13:38:00,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:38:00,559 INFO L225 Difference]: With dead ends: 51 [2024-09-20 13:38:00,559 INFO L226 Difference]: Without dead ends: 51 [2024-09-20 13:38:00,559 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-20 13:38:00,560 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 21 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-20 13:38:00,561 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 113 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-20 13:38:00,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-20 13:38:00,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-09-20 13:38:00,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 34 states have internal predecessors, (38), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-20 13:38:00,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2024-09-20 13:38:00,577 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 19 [2024-09-20 13:38:00,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:38:00,578 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2024-09-20 13:38:00,578 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-20 13:38:00,578 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2024-09-20 13:38:00,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-20 13:38:00,580 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:38:00,580 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:38:00,599 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-20 13:38:00,781 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-20 13:38:00,782 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-20 13:38:00,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:38:00,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1764960997, now seen corresponding path program 1 times [2024-09-20 13:38:00,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:38:00,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363449775] [2024-09-20 13:38:00,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:38:00,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:38:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:38:00,964 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 13:38:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:38:00,970 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-20 13:38:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:38:00,977 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-20 13:38:00,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:38:00,985 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-20 13:38:00,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:38:00,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363449775] [2024-09-20 13:38:00,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363449775] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:38:00,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:38:00,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 13:38:00,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480085837] [2024-09-20 13:38:00,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:38:00,988 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 13:38:00,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:38:00,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 13:38:00,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 13:38:00,989 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-20 13:38:01,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:38:01,179 INFO L93 Difference]: Finished difference Result 50 states and 67 transitions. [2024-09-20 13:38:01,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 13:38:01,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-09-20 13:38:01,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:38:01,180 INFO L225 Difference]: With dead ends: 50 [2024-09-20 13:38:01,180 INFO L226 Difference]: Without dead ends: 50 [2024-09-20 13:38:01,181 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-20 13:38:01,181 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 15 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-20 13:38:01,182 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 97 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-20 13:38:01,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-09-20 13:38:01,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2024-09-20 13:38:01,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.25) internal successors, (35), 31 states have internal predecessors, (35), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-20 13:38:01,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2024-09-20 13:38:01,188 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 24 [2024-09-20 13:38:01,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:38:01,189 INFO L474 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2024-09-20 13:38:01,189 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-20 13:38:01,189 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2024-09-20 13:38:01,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-20 13:38:01,189 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:38:01,190 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:38:01,190 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-20 13:38:01,190 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-20 13:38:01,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:38:01,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1764960836, now seen corresponding path program 1 times [2024-09-20 13:38:01,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:38:01,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228833549] [2024-09-20 13:38:01,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:38:01,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:38:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:38:01,226 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 13:38:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:38:01,231 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-20 13:38:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:38:01,238 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-20 13:38:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:38:01,244 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-20 13:38:01,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:38:01,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228833549] [2024-09-20 13:38:01,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228833549] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:38:01,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:38:01,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-20 13:38:01,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164841200] [2024-09-20 13:38:01,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:38:01,245 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 13:38:01,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:38:01,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 13:38:01,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 13:38:01,249 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-20 13:38:01,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:38:01,288 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2024-09-20 13:38:01,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 13:38:01,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-09-20 13:38:01,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:38:01,289 INFO L225 Difference]: With dead ends: 47 [2024-09-20 13:38:01,289 INFO L226 Difference]: Without dead ends: 47 [2024-09-20 13:38:01,289 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 13:38:01,290 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:38:01,290 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 66 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:38:01,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-20 13:38:01,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-09-20 13:38:01,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-20 13:38:01,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2024-09-20 13:38:01,295 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 24 [2024-09-20 13:38:01,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:38:01,296 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2024-09-20 13:38:01,296 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-20 13:38:01,296 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2024-09-20 13:38:01,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-20 13:38:01,297 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:38:01,297 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:38:01,297 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-20 13:38:01,297 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-20 13:38:01,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:38:01,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1154352905, now seen corresponding path program 1 times [2024-09-20 13:38:01,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:38:01,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142022292] [2024-09-20 13:38:01,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:38:01,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:38:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 13:38:01,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1735838091] [2024-09-20 13:38:01,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:38:01,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:38:01,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:38:01,327 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-20 13:38:01,344 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-20 13:38:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:38:01,457 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-20 13:38:01,459 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:38:01,775 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-20 13:38:01,777 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 13:38:10,330 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-20 13:38:10,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:38:10,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142022292] [2024-09-20 13:38:10,331 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-20 13:38:10,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735838091] [2024-09-20 13:38:10,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735838091] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 13:38:10,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-20 13:38:10,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-09-20 13:38:10,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038686207] [2024-09-20 13:38:10,332 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-20 13:38:10,333 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-20 13:38:10,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:38:10,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-20 13:38:10,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=32, Unknown=2, NotChecked=0, Total=56 [2024-09-20 13:38:10,334 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-20 13:38:14,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-20 13:38:20,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-20 13:38:24,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-20 13:38:28,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-20 13:38:34,241 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-20 13:38:38,246 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-20 13:38:42,267 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-20 13:38:46,272 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-20 13:38:50,277 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-20 13:38:54,291 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-20 13:38:58,302 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-20 13:39:02,310 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-20 13:39:06,336 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-20 13:39:10,340 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-20 13:39:14,359 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-20 13:39:16,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-20 13:39:20,822 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-20 13:39:24,827 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-20 13:39:28,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-20 13:39:32,850 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-20 13:39:36,856 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-20 13:39:40,862 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-20 13:39:44,869 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-20 13:39:48,878 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-20 13:39:52,883 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-20 13:39:56,887 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-20 13:40:00,892 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-20 13:40:04,897 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-20 13:40:08,902 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-20 13:40:12,915 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-20 13:40:16,938 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-20 13:40:20,951 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-20 13:40:24,954 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-20 13:40:28,966 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-20 13:40:32,981 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-20 13:40:36,988 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-20 13:40:40,992 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-20 13:40:41,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:40:41,215 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2024-09-20 13:40:41,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-20 13:40:41,216 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 37 [2024-09-20 13:40:41,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:40:41,217 INFO L225 Difference]: With dead ends: 61 [2024-09-20 13:40:41,217 INFO L226 Difference]: Without dead ends: 61 [2024-09-20 13:40:41,217 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=29, Invalid=41, Unknown=2, NotChecked=0, Total=72 [2024-09-20 13:40:41,218 INFO L434 NwaCegarLoop]: 41 mSDtfsCounter, 39 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 42 mSolverCounterUnsat, 35 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 146.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 35 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 146.8s IncrementalHoareTripleChecker+Time [2024-09-20 13:40:41,218 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 91 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 61 Invalid, 35 Unknown, 0 Unchecked, 146.8s Time] [2024-09-20 13:40:41,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-09-20 13:40:41,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2024-09-20 13:40:41,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 34 states have internal predecessors, (40), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-09-20 13:40:41,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2024-09-20 13:40:41,225 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 37 [2024-09-20 13:40:41,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:40:41,226 INFO L474 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2024-09-20 13:40:41,226 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-20 13:40:41,226 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2024-09-20 13:40:41,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-20 13:40:41,227 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:40:41,228 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:40:41,235 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-20 13:40:41,428 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-20 13:40:41,429 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-20 13:40:41,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:40:41,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1515868503, now seen corresponding path program 1 times [2024-09-20 13:40:41,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:40:41,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206526091] [2024-09-20 13:40:41,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:40:41,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:40:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 13:40:41,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1978847236] [2024-09-20 13:40:41,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:40:41,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:40:41,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:40:41,466 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-20 13:40:41,467 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-20 13:40:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:40:41,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-20 13:40:41,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:40:41,594 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-09-20 13:40:41,594 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 13:40:41,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:40:41,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206526091] [2024-09-20 13:40:41,598 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-20 13:40:41,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978847236] [2024-09-20 13:40:41,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978847236] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:40:41,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:40:41,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-20 13:40:41,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416680314] [2024-09-20 13:40:41,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:40:41,599 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 13:40:41,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:40:41,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 13:40:41,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 13:40:41,600 INFO L87 Difference]: Start difference. First operand 56 states and 78 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-20 13:40:41,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:40:41,640 INFO L93 Difference]: Finished difference Result 65 states and 92 transitions. [2024-09-20 13:40:41,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 13:40:41,641 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), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 50 [2024-09-20 13:40:41,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:40:41,644 INFO L225 Difference]: With dead ends: 65 [2024-09-20 13:40:41,644 INFO L226 Difference]: Without dead ends: 65 [2024-09-20 13:40:41,644 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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-20 13:40:41,645 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:40:41,645 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 58 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:40:41,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-09-20 13:40:41,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2024-09-20 13:40:41,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 39 states have internal predecessors, (47), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-09-20 13:40:41,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 91 transitions. [2024-09-20 13:40:41,658 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 91 transitions. Word has length 50 [2024-09-20 13:40:41,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:40:41,661 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 91 transitions. [2024-09-20 13:40:41,661 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), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-20 13:40:41,661 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 91 transitions. [2024-09-20 13:40:41,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-20 13:40:41,662 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:40:41,662 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:40:41,677 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-20 13:40:41,863 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-20 13:40:41,863 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-20 13:40:41,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:40:41,864 INFO L85 PathProgramCache]: Analyzing trace with hash 2018739730, now seen corresponding path program 1 times [2024-09-20 13:40:41,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:40:41,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96830994] [2024-09-20 13:40:41,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:40:41,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:40:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:40:42,375 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 13:40:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:40:42,380 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-20 13:40:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:40:42,383 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-20 13:40:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:40:42,387 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-20 13:40:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:40:42,413 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-20 13:40:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:40:42,439 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-20 13:40:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:40:42,467 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-20 13:40:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:40:42,474 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-20 13:40:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:40:42,481 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-20 13:40:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:40:42,487 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-09-20 13:40:42,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:40:42,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96830994] [2024-09-20 13:40:42,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96830994] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:40:42,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:40:42,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 13:40:42,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762738245] [2024-09-20 13:40:42,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:40:42,488 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-20 13:40:42,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:40:42,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-20 13:40:42,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-09-20 13:40:42,489 INFO L87 Difference]: Start difference. First operand 63 states and 91 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-20 13:40:42,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:40:42,700 INFO L93 Difference]: Finished difference Result 65 states and 93 transitions. [2024-09-20 13:40:42,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 13:40:42,701 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 55 [2024-09-20 13:40:42,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:40:42,703 INFO L225 Difference]: With dead ends: 65 [2024-09-20 13:40:42,704 INFO L226 Difference]: Without dead ends: 58 [2024-09-20 13:40:42,704 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-09-20 13:40:42,705 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-20 13:40:42,706 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 113 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-20 13:40:42,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-20 13:40:42,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-09-20 13:40:42,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 36 states have internal predecessors, (43), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-09-20 13:40:42,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 83 transitions. [2024-09-20 13:40:42,713 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 83 transitions. Word has length 55 [2024-09-20 13:40:42,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:40:42,716 INFO L474 AbstractCegarLoop]: Abstraction has 58 states and 83 transitions. [2024-09-20 13:40:42,716 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-20 13:40:42,716 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 83 transitions. [2024-09-20 13:40:42,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-09-20 13:40:42,717 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:40:42,719 INFO L216 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:40:42,719 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-20 13:40:42,719 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-20 13:40:42,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:40:42,720 INFO L85 PathProgramCache]: Analyzing trace with hash -550970448, now seen corresponding path program 1 times [2024-09-20 13:40:42,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:40:42,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801748066] [2024-09-20 13:40:42,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:40:42,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:40:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 13:40:42,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [383354434] [2024-09-20 13:40:42,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:40:42,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:40:42,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:40:42,767 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-20 13:40:42,769 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-20 13:40:42,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-20 13:40:42,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-20 13:40:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-20 13:40:42,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-20 13:40:42,929 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-20 13:40:42,933 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 12 remaining) [2024-09-20 13:40:42,935 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 12 remaining) [2024-09-20 13:40:42,935 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION (9 of 12 remaining) [2024-09-20 13:40:42,936 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (8 of 12 remaining) [2024-09-20 13:40:42,936 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONPRE_CONDITION (7 of 12 remaining) [2024-09-20 13:40:42,936 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION (6 of 12 remaining) [2024-09-20 13:40:42,936 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONPRE_CONDITION (5 of 12 remaining) [2024-09-20 13:40:42,937 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONPRE_CONDITION (4 of 12 remaining) [2024-09-20 13:40:42,937 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONPRE_CONDITION (3 of 12 remaining) [2024-09-20 13:40:42,937 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION (2 of 12 remaining) [2024-09-20 13:40:42,938 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 12 remaining) [2024-09-20 13:40:42,938 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION (0 of 12 remaining) [2024-09-20 13:40:42,948 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-20 13:40:43,139 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:40:43,142 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:40:43,157 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-09-20 13:40:43,159 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-09-20 13:40:43,160 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-09-20 13:40:43,162 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-09-20 13:40:43,163 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-09-20 13:40:43,168 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-20 13:40:43,170 INFO L469 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-09-20 13:40:43,170 INFO L470 ceAbstractionStarter]: WitnessConsidered=2 [2024-09-20 13:40:43,171 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:40:43 BoogieIcfgContainer [2024-09-20 13:40:43,171 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-20 13:40:43,171 INFO L158 Benchmark]: Toolchain (without parser) took 164515.23ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 101.9MB in the beginning and 62.7MB in the end (delta: 39.1MB). Peak memory consumption was 72.1MB. Max. memory is 16.1GB. [2024-09-20 13:40:43,171 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 96.5MB. Free memory is still 52.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 13:40:43,172 INFO L158 Benchmark]: Witness Parser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 104.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 13:40:43,172 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.27ms. Allocated memory is still 167.8MB. Free memory was 101.4MB in the beginning and 133.0MB in the end (delta: -31.5MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2024-09-20 13:40:43,172 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.38ms. Allocated memory is still 167.8MB. Free memory was 133.0MB in the beginning and 131.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 13:40:43,172 INFO L158 Benchmark]: Boogie Preprocessor took 41.45ms. Allocated memory is still 167.8MB. Free memory was 131.1MB in the beginning and 129.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 13:40:43,173 INFO L158 Benchmark]: RCFGBuilder took 363.97ms. Allocated memory is still 167.8MB. Free memory was 129.7MB in the beginning and 113.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-09-20 13:40:43,173 INFO L158 Benchmark]: TraceAbstraction took 163729.65ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 112.4MB in the beginning and 62.7MB in the end (delta: 49.7MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. [2024-09-20 13:40:43,174 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 96.5MB. Free memory is still 52.0MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 104.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 339.27ms. Allocated memory is still 167.8MB. Free memory was 101.4MB in the beginning and 133.0MB in the end (delta: -31.5MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.38ms. Allocated memory is still 167.8MB. Free memory was 133.0MB in the beginning and 131.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.45ms. Allocated memory is still 167.8MB. Free memory was 131.1MB in the beginning and 129.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 363.97ms. Allocated memory is still 167.8MB. Free memory was 129.7MB in the beginning and 113.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 163729.65ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 112.4MB in the beginning and 62.7MB in the end (delta: 49.7MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 46]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L23] unsigned int A, B; [L24] unsigned int r, d, p, q; [L25] A = __VERIFIER_nondet_uint() [L26] CALL assume_abort_if_not(A>=0 && A<=100) VAL [\old(cond)=1] [L12] COND FALSE !(!cond) VAL [\old(cond)=1] [L26] RET assume_abort_if_not(A>=0 && A<=100) VAL [A=1] [L27] B = __VERIFIER_nondet_uint() [L28] CALL assume_abort_if_not(B>=0 && B<=100) VAL [\old(cond)=1] [L12] COND FALSE !(!cond) VAL [\old(cond)=1] [L28] RET assume_abort_if_not(B>=0 && B<=100) VAL [A=1, B=-4294967295] [L29] CALL assume_abort_if_not(B >= 1) VAL [\old(cond)=1] [L12] COND FALSE !(!cond) VAL [\old(cond)=1] [L29] RET assume_abort_if_not(B >= 1) VAL [A=1, B=-4294967295] [L31] r = A [L32] d = B [L33] p = 1 [L34] q = 0 VAL [A=1, B=-4294967295, d=-4294967295, p=1, q=0, r=1] [L36] COND TRUE 1 VAL [A=1, B=-4294967295, d=-4294967295, p=1, q=0, r=1] [L37] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1] [L14] Requires[BinaryExpression[COMPLEQ,IntegerLiteral[1],OldValueExpression[IdentifierExpression[cond]]]] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L37] RET __VERIFIER_assert(q == 0) VAL [A=1, B=-4294967295, d=-4294967295, p=1, q=0, r=1] [L38] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1] [L14] Requires[BinaryExpression[COMPLEQ,IntegerLiteral[1],OldValueExpression[IdentifierExpression[cond]]]] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L38] RET __VERIFIER_assert(r == A) VAL [A=1, B=-4294967295, d=-4294967295, p=1, q=0, r=1] [L39] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1] [L14] Requires[BinaryExpression[COMPLEQ,IntegerLiteral[1],OldValueExpression[IdentifierExpression[cond]]]] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L39] RET __VERIFIER_assert(d == B * p) VAL [A=1, B=-4294967295, d=-4294967295, p=1, q=0, r=1] [L40] COND FALSE !(!(r >= d)) [L42] d = 2 * d [L43] p = 2 * p VAL [A=1, B=-4294967295, d=-8589934590, p=2, q=0, r=1] [L36] COND TRUE 1 VAL [A=1, B=-4294967295, d=-8589934590, p=2, q=0, r=1] [L37] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1] [L14] Requires[BinaryExpression[COMPLEQ,IntegerLiteral[1],OldValueExpression[IdentifierExpression[cond]]]] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L37] RET __VERIFIER_assert(q == 0) VAL [A=1, B=-4294967295, d=-8589934590, p=2, q=0, r=1] [L38] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1] [L14] Requires[BinaryExpression[COMPLEQ,IntegerLiteral[1],OldValueExpression[IdentifierExpression[cond]]]] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L38] RET __VERIFIER_assert(r == A) VAL [A=1, B=-4294967295, d=-8589934590, p=2, q=0, r=1] [L39] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1] [L14] Requires[BinaryExpression[COMPLEQ,IntegerLiteral[1],OldValueExpression[IdentifierExpression[cond]]]] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L39] RET __VERIFIER_assert(d == B * p) VAL [A=1, B=-4294967295, d=-8589934590, p=2, q=0, r=1] [L40] COND TRUE !(r >= d) VAL [A=1, B=-4294967295, d=-8589934590, p=2, q=0, r=1] [L46] COND TRUE 1 VAL [A=1, B=-4294967295, d=-8589934590, p=2, q=0, r=1] [L47] CALL __VERIFIER_assert(A == q*B + r) VAL [\old(cond)=1] [L14] Requires[BinaryExpression[COMPLEQ,IntegerLiteral[1],OldValueExpression[IdentifierExpression[cond]]]] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L47] RET __VERIFIER_assert(A == q*B + r) VAL [A=1, B=-4294967295, d=-8589934590, p=2, q=0, r=1] [L48] CALL __VERIFIER_assert(d == B*p) VAL [\old(cond)=1] [L14] Requires[BinaryExpression[COMPLEQ,IntegerLiteral[1],OldValueExpression[IdentifierExpression[cond]]]] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L48] RET __VERIFIER_assert(d == B*p) VAL [A=1, B=-4294967295, d=-8589934590, p=2, q=0, r=1] [L50] COND FALSE !(!(p != 1)) [L52] d = d / 2 [L53] p = p / 2 VAL [A=1, B=-4294967295, d=1, p=1, q=0, r=1] [L54] COND TRUE r >= d [L55] r = r - d [L56] q = q + p VAL [A=1, B=-4294967295, d=1, p=1, q=1, r=0] - UnprovableResult [Line: 36]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that procedure precondition always holds Unable to prove that procedure precondition always holds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that procedure precondition always holds Unable to prove that procedure precondition always holds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that procedure precondition always holds Unable to prove that procedure precondition always holds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that procedure precondition always holds Unable to prove that procedure precondition always holds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that procedure precondition always holds Unable to prove that procedure precondition always holds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that procedure precondition always holds Unable to prove that procedure precondition always holds Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that procedure precondition always holds Unable to prove that procedure precondition always holds Reason: Not analyzed. - UnprovableResult [Line: 11]: Unable to prove that procedure postcondition always holds Unable to prove that procedure postcondition always holds Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that procedure postcondition always holds Unable to prove that procedure postcondition always holds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 43 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 163.7s, OverallIterations: 9, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 151.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 35 mSolverCounterUnknown, 118 SdHoareTripleChecker+Valid, 147.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 87 mSDsluCounter, 709 SdHoareTripleChecker+Invalid, 147.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 410 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 340 IncrementalHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 299 mSDtfsCounter, 340 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 12.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=7, InterpolantAutomatonStates: 35, 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, 8 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 463 NumberOfCodeBlocks, 463 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 247 ConstructedInterpolants, 0 QuantifiedInterpolants, 1389 SizeOfPredicates, 3 NumberOfNonLiveVariables, 292 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 208/210 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-09-20 13:40:43,266 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...