./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/hh2012-ex3.i --full-output --witness-type correctness_witness --validate ../results/automizer-verification-files/SV-COMP24_unreach-call/hh2012-ex3.yml/witness-2.1.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1d5fa637 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReachWitnessValidation.xml -i ../sv-benchmarks/c/loop-lit/hh2012-ex3.i ../results/automizer-verification-files/SV-COMP24_unreach-call/hh2012-ex3.yml/witness-2.1.yml -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --- Real Ultimate output --- This is Ultimate 0.2.4-dev-1d5fa63-m [2024-09-13 10:13:05,117 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 10:13:05,179 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 10:13:05,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 10:13:05,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 10:13:05,224 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 10:13:05,225 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 10:13:05,225 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 10:13:05,225 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 10:13:05,226 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 10:13:05,227 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 10:13:05,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 10:13:05,229 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 10:13:05,232 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 10:13:05,232 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 10:13:05,232 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 10:13:05,233 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 10:13:05,233 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 10:13:05,233 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 10:13:05,233 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 10:13:05,233 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 10:13:05,235 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 10:13:05,235 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 10:13:05,235 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 10:13:05,236 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 10:13:05,236 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 10:13:05,236 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 10:13:05,236 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 10:13:05,237 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 10:13:05,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 10:13:05,238 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 10:13:05,238 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 10:13:05,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 10:13:05,238 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 10:13:05,239 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 10:13:05,239 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 10:13:05,239 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 10:13:05,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 10:13:05,239 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 10:13:05,239 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 10:13:05,240 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 10:13:05,240 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 10:13:05,240 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None [2024-09-13 10:13:05,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 10:13:05,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 10:13:05,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 10:13:05,565 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 10:13:05,566 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 10:13:05,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-lit/hh2012-ex3.i [2024-09-13 10:13:07,008 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 10:13:07,180 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 10:13:07,181 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/hh2012-ex3.i [2024-09-13 10:13:07,187 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/e33537388/5b298a58b06d4bfeaed8d98b47acf21f/FLAG7617c9e95 [2024-09-13 10:13:07,200 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/e33537388/5b298a58b06d4bfeaed8d98b47acf21f [2024-09-13 10:13:07,202 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-13 10:13:07,202 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-13 10:13:07,203 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/hh2012-ex3.yml/witness-2.1.yml [2024-09-13 10:13:07,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 10:13:07,250 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-13 10:13:07,251 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 10:13:07,251 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 10:13:07,257 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 10:13:07,258 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 10:13:07" (1/2) ... [2024-09-13 10:13:07,259 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@556a796a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:13:07, skipping insertion in model container [2024-09-13 10:13:07,259 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 10:13:07" (1/2) ... [2024-09-13 10:13:07,261 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@40625cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 10:13:07, skipping insertion in model container [2024-09-13 10:13:07,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 10:13:07" (2/2) ... [2024-09-13 10:13:07,262 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@556a796a and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:13:07, skipping insertion in model container [2024-09-13 10:13:07,262 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 10:13:07" (2/2) ... [2024-09-13 10:13:07,271 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-13 10:13:07,271 INFO L1541 ArrayList]: Loop invariant at [L16-L31] ((i <= 4) && (0 <= i)) [2024-09-13 10:13:07,272 INFO L1541 ArrayList]: Loop invariant at [L18-L25] ((((j == 0) && (0 <= i)) && (i <= 3)) || ((((i <= ((long long) j + 3)) && (1 <= j)) && (j <= i)) && (j <= 4))) [2024-09-13 10:13:07,272 INFO L1541 ArrayList]: Function contract at [L13]: requires (\old(cond) != 0), ensures (\old(cond) != 0) [2024-09-13 10:13:07,290 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 10:13:07,448 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/hh2012-ex3.i[799,812] [2024-09-13 10:13:07,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 10:13:07,477 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global [2024-09-13 10:13:07,515 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/hh2012-ex3.i[799,812] Start Parsing Local Start Parsing Local [2024-09-13 10:13:07,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 10:13:07,548 INFO L204 MainTranslator]: Completed translation [2024-09-13 10:13:07,549 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:13:07 WrapperNode [2024-09-13 10:13:07,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 10:13:07,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 10:13:07,551 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 10:13:07,551 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 10:13:07,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:13:07" (1/1) ... [2024-09-13 10:13:07,565 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:13:07" (1/1) ... [2024-09-13 10:13:07,582 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2024-09-13 10:13:07,583 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 10:13:07,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 10:13:07,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 10:13:07,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 10:13:07,595 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:13:07" (1/1) ... [2024-09-13 10:13:07,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:13:07" (1/1) ... [2024-09-13 10:13:07,596 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:13:07" (1/1) ... [2024-09-13 10:13:07,608 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Procedure __VERIFIER_assert is not part of the Ultimate memory model but has specification other that is not a ModifiesSpecification [2024-09-13 10:13:07,612 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:13:07" (1/1) ... [2024-09-13 10:13:07,613 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:13:07" (1/1) ... [2024-09-13 10:13:07,615 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:13:07" (1/1) ... [2024-09-13 10:13:07,618 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:13:07" (1/1) ... [2024-09-13 10:13:07,624 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:13:07" (1/1) ... [2024-09-13 10:13:07,624 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:13:07" (1/1) ... [2024-09-13 10:13:07,626 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 10:13:07,628 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 10:13:07,628 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 10:13:07,628 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 10:13:07,629 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:13:07" (1/1) ... [2024-09-13 10:13:07,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 10:13:07,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:13:07,662 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-13 10:13:07,669 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-13 10:13:07,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 10:13:07,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-13 10:13:07,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 10:13:07,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 10:13:07,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 10:13:07,709 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 10:13:07,778 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 10:13:07,780 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 10:13:07,913 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-13 10:13:07,931 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-09-13 10:13:07,932 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 10:13:07,953 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 10:13:07,953 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-13 10:13:07,954 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 10:13:07 BoogieIcfgContainer [2024-09-13 10:13:07,954 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 10:13:07,956 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 10:13:07,956 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 10:13:07,959 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 10:13:07,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 10:13:07" (1/4) ... [2024-09-13 10:13:07,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1692c685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 10:13:07, skipping insertion in model container [2024-09-13 10:13:07,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 10:13:07" (2/4) ... [2024-09-13 10:13:07,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1692c685 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 10:13:07, skipping insertion in model container [2024-09-13 10:13:07,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 10:13:07" (3/4) ... [2024-09-13 10:13:07,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1692c685 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 10:13:07, skipping insertion in model container [2024-09-13 10:13:07,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 10:13:07" (4/4) ... [2024-09-13 10:13:07,964 INFO L112 eAbstractionObserver]: Analyzing ICFG hh2012-ex3.i [2024-09-13 10:13:07,981 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 10:13:07,981 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-09-13 10:13:08,023 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 10:13:08,033 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;@5fe27b1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 10:13:08,034 INFO L337 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-09-13 10:13:08,040 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 24 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 10:13:08,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-09-13 10:13:08,047 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:08,047 INFO L216 NwaCegarLoop]: trace histogram [1, 1] [2024-09-13 10:13:08,048 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:13:08,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:08,056 INFO L85 PathProgramCache]: Analyzing trace with hash 3507, now seen corresponding path program 1 times [2024-09-13 10:13:08,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:08,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122136592] [2024-09-13 10:13:08,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:08,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:08,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:08,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:08,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122136592] [2024-09-13 10:13:08,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122136592] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:08,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:08,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-09-13 10:13:08,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675707470] [2024-09-13 10:13:08,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:08,209 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:13:08,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:08,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:13:08,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:13:08,242 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 24 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:08,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:08,308 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2024-09-13 10:13:08,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:13:08,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-09-13 10:13:08,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:08,318 INFO L225 Difference]: With dead ends: 44 [2024-09-13 10:13:08,318 INFO L226 Difference]: Without dead ends: 42 [2024-09-13 10:13:08,320 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:13:08,324 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:08,324 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 56 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:13:08,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-13 10:13:08,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2024-09-13 10:13:08,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.263157894736842) internal successors, (24), 23 states have internal predecessors, (24), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 10:13:08,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-09-13 10:13:08,364 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 2 [2024-09-13 10:13:08,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:08,364 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-09-13 10:13:08,364 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:08,364 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-09-13 10:13:08,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-09-13 10:13:08,366 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:08,366 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-09-13 10:13:08,366 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 10:13:08,367 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:13:08,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:08,367 INFO L85 PathProgramCache]: Analyzing trace with hash 3371606, now seen corresponding path program 1 times [2024-09-13 10:13:08,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:08,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458876955] [2024-09-13 10:13:08,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:08,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:08,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:08,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:08,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458876955] [2024-09-13 10:13:08,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458876955] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:08,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:08,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 10:13:08,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32126729] [2024-09-13 10:13:08,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:08,458 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:13:08,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:08,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:13:08,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:13:08,459 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:08,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:08,517 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-09-13 10:13:08,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:13:08,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-09-13 10:13:08,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:08,519 INFO L225 Difference]: With dead ends: 35 [2024-09-13 10:13:08,519 INFO L226 Difference]: Without dead ends: 35 [2024-09-13 10:13:08,519 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:13:08,521 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:08,521 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 59 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 10:13:08,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-13 10:13:08,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-09-13 10:13:08,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 26 states have internal predecessors, (27), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 10:13:08,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2024-09-13 10:13:08,530 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 4 [2024-09-13 10:13:08,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:08,530 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2024-09-13 10:13:08,531 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:08,531 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2024-09-13 10:13:08,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-09-13 10:13:08,531 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:08,532 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-09-13 10:13:08,532 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 10:13:08,533 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:13:08,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:08,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1054852199, now seen corresponding path program 1 times [2024-09-13 10:13:08,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:08,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288739215] [2024-09-13 10:13:08,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:08,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:08,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:08,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:08,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288739215] [2024-09-13 10:13:08,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288739215] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:08,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:08,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:08,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779810362] [2024-09-13 10:13:08,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:08,653 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:13:08,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:08,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:13:08,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:13:08,655 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:08,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:08,746 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2024-09-13 10:13:08,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:13:08,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-09-13 10:13:08,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:08,749 INFO L225 Difference]: With dead ends: 35 [2024-09-13 10:13:08,749 INFO L226 Difference]: Without dead ends: 35 [2024-09-13 10:13:08,749 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-13 10:13:08,750 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:08,751 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 54 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 10:13:08,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-13 10:13:08,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2024-09-13 10:13:08,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 24 states have internal predecessors, (27), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 10:13:08,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2024-09-13 10:13:08,757 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 6 [2024-09-13 10:13:08,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:08,757 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-09-13 10:13:08,758 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:08,758 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2024-09-13 10:13:08,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-13 10:13:08,760 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:08,760 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:08,760 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 10:13:08,760 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:13:08,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:08,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1175088790, now seen corresponding path program 1 times [2024-09-13 10:13:08,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:08,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167295653] [2024-09-13 10:13:08,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:08,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:08,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:08,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:08,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:08,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167295653] [2024-09-13 10:13:08,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167295653] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:08,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:08,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:08,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495590272] [2024-09-13 10:13:08,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:08,819 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:13:08,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:08,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:13:08,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:13:08,821 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:08,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:08,829 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2024-09-13 10:13:08,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:13:08,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2024-09-13 10:13:08,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:08,831 INFO L225 Difference]: With dead ends: 32 [2024-09-13 10:13:08,831 INFO L226 Difference]: Without dead ends: 32 [2024-09-13 10:13:08,832 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:13:08,833 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:08,833 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:13:08,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-13 10:13:08,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-13 10:13:08,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 10:13:08,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2024-09-13 10:13:08,838 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 9 [2024-09-13 10:13:08,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:08,839 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2024-09-13 10:13:08,839 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:08,839 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2024-09-13 10:13:08,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-13 10:13:08,840 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:08,840 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:08,840 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-13 10:13:08,840 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:13:08,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:08,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1175088951, now seen corresponding path program 1 times [2024-09-13 10:13:08,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:08,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853463556] [2024-09-13 10:13:08,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:08,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:08,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:08,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:08,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853463556] [2024-09-13 10:13:08,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853463556] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:08,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:08,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 10:13:08,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222939171] [2024-09-13 10:13:08,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:08,872 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 10:13:08,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:08,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 10:13:08,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:13:08,874 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:08,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:08,912 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2024-09-13 10:13:08,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 10:13:08,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2024-09-13 10:13:08,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:08,914 INFO L225 Difference]: With dead ends: 31 [2024-09-13 10:13:08,914 INFO L226 Difference]: Without dead ends: 31 [2024-09-13 10:13:08,914 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 10:13:08,915 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:08,916 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 37 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:13:08,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-13 10:13:08,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-13 10:13:08,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 10:13:08,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2024-09-13 10:13:08,920 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 9 [2024-09-13 10:13:08,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:08,920 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2024-09-13 10:13:08,921 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:08,921 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2024-09-13 10:13:08,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-13 10:13:08,921 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:08,922 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:08,922 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-13 10:13:08,922 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:13:08,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:08,923 INFO L85 PathProgramCache]: Analyzing trace with hash -315915824, now seen corresponding path program 1 times [2024-09-13 10:13:08,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:08,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003932784] [2024-09-13 10:13:08,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:08,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:09,043 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 10:13:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:09,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 10:13:09,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:09,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003932784] [2024-09-13 10:13:09,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003932784] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:09,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:09,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 10:13:09,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442980516] [2024-09-13 10:13:09,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:09,059 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:09,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:09,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:09,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:09,064 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 10:13:09,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:09,146 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2024-09-13 10:13:09,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:09,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-13 10:13:09,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:09,147 INFO L225 Difference]: With dead ends: 30 [2024-09-13 10:13:09,148 INFO L226 Difference]: Without dead ends: 30 [2024-09-13 10:13:09,149 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:09,150 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:09,151 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 39 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 10:13:09,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-13 10:13:09,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2024-09-13 10:13:09,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 10:13:09,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2024-09-13 10:13:09,159 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 11 [2024-09-13 10:13:09,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:09,160 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-09-13 10:13:09,160 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 10:13:09,160 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2024-09-13 10:13:09,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-13 10:13:09,162 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:09,162 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:09,162 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-13 10:13:09,162 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:13:09,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:09,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1628866105, now seen corresponding path program 1 times [2024-09-13 10:13:09,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:09,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894814319] [2024-09-13 10:13:09,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:09,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:09,278 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 10:13:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:09,287 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-13 10:13:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:09,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 10:13:09,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:09,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894814319] [2024-09-13 10:13:09,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894814319] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:09,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:09,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 10:13:09,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420165109] [2024-09-13 10:13:09,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:09,301 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 10:13:09,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:09,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 10:13:09,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:09,305 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 10:13:09,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:09,368 INFO L93 Difference]: Finished difference Result 41 states and 62 transitions. [2024-09-13 10:13:09,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 10:13:09,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-13 10:13:09,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:09,372 INFO L225 Difference]: With dead ends: 41 [2024-09-13 10:13:09,372 INFO L226 Difference]: Without dead ends: 41 [2024-09-13 10:13:09,372 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 10:13:09,373 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:09,373 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 49 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 10:13:09,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-13 10:13:09,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2024-09-13 10:13:09,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-09-13 10:13:09,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 58 transitions. [2024-09-13 10:13:09,388 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 58 transitions. Word has length 16 [2024-09-13 10:13:09,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:09,389 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 58 transitions. [2024-09-13 10:13:09,389 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 10:13:09,389 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 58 transitions. [2024-09-13 10:13:09,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-13 10:13:09,390 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:09,390 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:09,390 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-13 10:13:09,390 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:13:09,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:09,391 INFO L85 PathProgramCache]: Analyzing trace with hash 781900720, now seen corresponding path program 1 times [2024-09-13 10:13:09,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:09,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664135829] [2024-09-13 10:13:09,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:09,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:09,452 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 10:13:09,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:09,459 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-13 10:13:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:09,468 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-13 10:13:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:09,476 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-13 10:13:09,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:09,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664135829] [2024-09-13 10:13:09,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664135829] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:09,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:09,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:09,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206323786] [2024-09-13 10:13:09,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:09,479 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:13:09,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:09,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:13:09,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:13:09,481 INFO L87 Difference]: Start difference. First operand 39 states and 58 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 10:13:09,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:09,520 INFO L93 Difference]: Finished difference Result 51 states and 81 transitions. [2024-09-13 10:13:09,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:13:09,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2024-09-13 10:13:09,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:09,522 INFO L225 Difference]: With dead ends: 51 [2024-09-13 10:13:09,523 INFO L226 Difference]: Without dead ends: 51 [2024-09-13 10:13:09,523 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:13:09,524 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:09,526 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 46 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:13:09,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-13 10:13:09,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-09-13 10:13:09,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-13 10:13:09,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 81 transitions. [2024-09-13 10:13:09,539 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 81 transitions. Word has length 21 [2024-09-13 10:13:09,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:09,540 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 81 transitions. [2024-09-13 10:13:09,540 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 10:13:09,541 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 81 transitions. [2024-09-13 10:13:09,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-13 10:13:09,542 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:09,542 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:09,542 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-13 10:13:09,542 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:13:09,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:09,546 INFO L85 PathProgramCache]: Analyzing trace with hash 177494214, now seen corresponding path program 1 times [2024-09-13 10:13:09,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:09,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746759942] [2024-09-13 10:13:09,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:09,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:09,630 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 10:13:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:09,635 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-13 10:13:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:09,639 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-13 10:13:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:09,644 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:13:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:09,649 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-13 10:13:09,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:09,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746759942] [2024-09-13 10:13:09,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746759942] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:13:09,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617293535] [2024-09-13 10:13:09,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:09,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:13:09,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:13:09,652 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:13:09,653 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-13 10:13:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:09,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-13 10:13:09,708 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:13:09,774 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-13 10:13:09,775 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:13:09,912 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-13 10:13:09,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617293535] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 10:13:09,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 10:13:09,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-13 10:13:09,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588125781] [2024-09-13 10:13:09,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 10:13:09,913 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-13 10:13:09,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:09,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-13 10:13:09,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-09-13 10:13:09,914 INFO L87 Difference]: Start difference. First operand 51 states and 81 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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-13 10:13:10,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:10,047 INFO L93 Difference]: Finished difference Result 59 states and 91 transitions. [2024-09-13 10:13:10,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 10:13:10,048 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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 26 [2024-09-13 10:13:10,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:10,049 INFO L225 Difference]: With dead ends: 59 [2024-09-13 10:13:10,049 INFO L226 Difference]: Without dead ends: 59 [2024-09-13 10:13:10,050 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-09-13 10:13:10,050 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:10,052 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 74 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 10:13:10,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-13 10:13:10,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2024-09-13 10:13:10,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 29 states have internal predecessors, (34), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-09-13 10:13:10,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 90 transitions. [2024-09-13 10:13:10,063 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 90 transitions. Word has length 26 [2024-09-13 10:13:10,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:10,063 INFO L474 AbstractCegarLoop]: Abstraction has 58 states and 90 transitions. [2024-09-13 10:13:10,064 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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-13 10:13:10,064 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 90 transitions. [2024-09-13 10:13:10,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-09-13 10:13:10,068 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:10,068 INFO L216 NwaCegarLoop]: trace histogram [16, 16, 16, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:10,084 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-13 10:13:10,272 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:13:10,273 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:13:10,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:10,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1814981713, now seen corresponding path program 1 times [2024-09-13 10:13:10,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:10,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829350178] [2024-09-13 10:13:10,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:10,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:10,401 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 10:13:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:10,406 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-13 10:13:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:10,412 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-13 10:13:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:10,418 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:13:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:10,424 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-13 10:13:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:10,429 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-13 10:13:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:10,434 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-13 10:13:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:10,443 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-13 10:13:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:10,448 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-13 10:13:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:10,452 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-13 10:13:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:10,457 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-13 10:13:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:10,462 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-13 10:13:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:10,466 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-09-13 10:13:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:10,469 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-09-13 10:13:10,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:10,474 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-13 10:13:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:10,481 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-09-13 10:13:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:10,488 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-09-13 10:13:10,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:10,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829350178] [2024-09-13 10:13:10,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829350178] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:13:10,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241455436] [2024-09-13 10:13:10,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:10,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:13:10,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:13:10,493 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:13:10,495 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-13 10:13:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:10,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-13 10:13:10,563 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:13:10,623 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 193 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-09-13 10:13:10,623 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:13:10,742 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-09-13 10:13:10,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241455436] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 10:13:10,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 10:13:10,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2024-09-13 10:13:10,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374556064] [2024-09-13 10:13:10,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 10:13:10,744 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 10:13:10,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:10,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 10:13:10,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-13 10:13:10,747 INFO L87 Difference]: Start difference. First operand 58 states and 90 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 4 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2024-09-13 10:13:10,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:10,804 INFO L93 Difference]: Finished difference Result 76 states and 124 transitions. [2024-09-13 10:13:10,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-13 10:13:10,805 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 4 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 93 [2024-09-13 10:13:10,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:10,807 INFO L225 Difference]: With dead ends: 76 [2024-09-13 10:13:10,807 INFO L226 Difference]: Without dead ends: 76 [2024-09-13 10:13:10,807 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 213 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-13 10:13:10,807 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:10,808 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:13:10,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-09-13 10:13:10,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-09-13 10:13:10,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 35 states have internal predecessors, (44), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-09-13 10:13:10,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 124 transitions. [2024-09-13 10:13:10,820 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 124 transitions. Word has length 93 [2024-09-13 10:13:10,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:10,820 INFO L474 AbstractCegarLoop]: Abstraction has 76 states and 124 transitions. [2024-09-13 10:13:10,822 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 4 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2024-09-13 10:13:10,822 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 124 transitions. [2024-09-13 10:13:10,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-09-13 10:13:10,824 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:10,824 INFO L216 NwaCegarLoop]: trace histogram [20, 20, 20, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:10,841 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-13 10:13:11,028 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-13 10:13:11,029 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:13:11,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:11,030 INFO L85 PathProgramCache]: Analyzing trace with hash -743486657, now seen corresponding path program 2 times [2024-09-13 10:13:11,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:11,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780582194] [2024-09-13 10:13:11,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:11,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:11,308 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 10:13:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:11,311 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-13 10:13:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:11,315 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-13 10:13:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:11,319 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:13:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:11,323 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-13 10:13:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:11,328 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-13 10:13:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:11,332 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-13 10:13:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:11,335 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-13 10:13:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:11,341 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-13 10:13:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:11,347 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-13 10:13:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:11,351 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-13 10:13:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:11,359 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-13 10:13:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:11,366 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-09-13 10:13:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:11,370 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-09-13 10:13:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:11,375 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-13 10:13:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:11,380 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-09-13 10:13:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:11,386 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-09-13 10:13:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:11,392 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-09-13 10:13:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:11,396 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-09-13 10:13:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:11,399 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-09-13 10:13:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:11,402 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-09-13 10:13:11,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:11,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780582194] [2024-09-13 10:13:11,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780582194] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:13:11,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687349769] [2024-09-13 10:13:11,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 10:13:11,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:13:11,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:13:11,405 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:13:11,406 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-13 10:13:11,477 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 10:13:11,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 10:13:11,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-13 10:13:11,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:13:11,710 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-09-13 10:13:11,710 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:13:12,261 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-09-13 10:13:12,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687349769] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 10:13:12,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 10:13:12,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2024-09-13 10:13:12,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9428427] [2024-09-13 10:13:12,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 10:13:12,264 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-13 10:13:12,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:12,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-13 10:13:12,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2024-09-13 10:13:12,267 INFO L87 Difference]: Start difference. First operand 76 states and 124 transitions. Second operand has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 23 states have internal predecessors, (45), 15 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 15 states have call predecessors, (60), 15 states have call successors, (60) [2024-09-13 10:13:12,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:12,745 INFO L93 Difference]: Finished difference Result 118 states and 200 transitions. [2024-09-13 10:13:12,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-13 10:13:12,746 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 23 states have internal predecessors, (45), 15 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 15 states have call predecessors, (60), 15 states have call successors, (60) Word has length 115 [2024-09-13 10:13:12,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:12,748 INFO L225 Difference]: With dead ends: 118 [2024-09-13 10:13:12,748 INFO L226 Difference]: Without dead ends: 118 [2024-09-13 10:13:12,749 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=303, Invalid=887, Unknown=0, NotChecked=0, Total=1190 [2024-09-13 10:13:12,751 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 27 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:12,751 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 196 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 10:13:12,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-09-13 10:13:12,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 95. [2024-09-13 10:13:12,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-09-13 10:13:12,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 153 transitions. [2024-09-13 10:13:12,769 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 153 transitions. Word has length 115 [2024-09-13 10:13:12,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:12,769 INFO L474 AbstractCegarLoop]: Abstraction has 95 states and 153 transitions. [2024-09-13 10:13:12,769 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 23 states have internal predecessors, (45), 15 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 15 states have call predecessors, (60), 15 states have call successors, (60) [2024-09-13 10:13:12,770 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 153 transitions. [2024-09-13 10:13:12,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-09-13 10:13:12,771 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:12,772 INFO L216 NwaCegarLoop]: trace histogram [20, 20, 20, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:12,785 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-13 10:13:12,972 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-13 10:13:12,973 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:13:12,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:12,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1526104862, now seen corresponding path program 1 times [2024-09-13 10:13:12,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:12,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331109923] [2024-09-13 10:13:12,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:12,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,034 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 10:13:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,037 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-13 10:13:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,038 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-13 10:13:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,040 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:13:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,041 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-13 10:13:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,043 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-13 10:13:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,045 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-13 10:13:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,047 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-13 10:13:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,048 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-13 10:13:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,054 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-13 10:13:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,059 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-13 10:13:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,062 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-13 10:13:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,064 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-09-13 10:13:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,065 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-09-13 10:13:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,069 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-13 10:13:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,071 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-09-13 10:13:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,074 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-09-13 10:13:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,077 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-09-13 10:13:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,079 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-09-13 10:13:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,081 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-09-13 10:13:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,083 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-09-13 10:13:13,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:13,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331109923] [2024-09-13 10:13:13,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331109923] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 10:13:13,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 10:13:13,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 10:13:13,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674065845] [2024-09-13 10:13:13,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 10:13:13,085 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 10:13:13,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:13,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 10:13:13,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:13:13,086 INFO L87 Difference]: Start difference. First operand 95 states and 153 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-09-13 10:13:13,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:13,123 INFO L93 Difference]: Finished difference Result 95 states and 151 transitions. [2024-09-13 10:13:13,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 10:13:13,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 117 [2024-09-13 10:13:13,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:13,125 INFO L225 Difference]: With dead ends: 95 [2024-09-13 10:13:13,125 INFO L226 Difference]: Without dead ends: 95 [2024-09-13 10:13:13,125 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 10:13:13,126 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:13,126 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 31 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 10:13:13,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-09-13 10:13:13,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-09-13 10:13:13,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-09-13 10:13:13,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 151 transitions. [2024-09-13 10:13:13,144 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 151 transitions. Word has length 117 [2024-09-13 10:13:13,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:13,145 INFO L474 AbstractCegarLoop]: Abstraction has 95 states and 151 transitions. [2024-09-13 10:13:13,145 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-09-13 10:13:13,146 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 151 transitions. [2024-09-13 10:13:13,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-09-13 10:13:13,147 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:13,148 INFO L216 NwaCegarLoop]: trace histogram [24, 24, 24, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:13,148 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-13 10:13:13,148 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:13:13,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:13,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1309061714, now seen corresponding path program 2 times [2024-09-13 10:13:13,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:13,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297771491] [2024-09-13 10:13:13,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:13,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,467 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 10:13:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,470 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-13 10:13:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,473 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-13 10:13:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,475 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:13:13,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,477 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-13 10:13:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,480 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-13 10:13:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,482 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-13 10:13:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,484 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-13 10:13:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,487 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-13 10:13:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,489 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-13 10:13:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,491 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-13 10:13:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,493 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-13 10:13:13,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,495 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-09-13 10:13:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,497 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-09-13 10:13:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,500 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-13 10:13:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,502 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-09-13 10:13:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,504 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-09-13 10:13:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,506 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-09-13 10:13:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,509 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-09-13 10:13:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,511 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-09-13 10:13:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,513 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-09-13 10:13:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,516 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-09-13 10:13:13,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,519 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-09-13 10:13:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,521 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-09-13 10:13:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:13,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1182 backedges. 8 proven. 70 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-09-13 10:13:13,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:13,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297771491] [2024-09-13 10:13:13,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297771491] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:13:13,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126343640] [2024-09-13 10:13:13,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 10:13:13,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:13:13,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:13:13,527 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:13:13,530 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-13 10:13:13,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 10:13:13,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 10:13:13,608 INFO L262 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-13 10:13:13,611 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:13:13,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1182 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-09-13 10:13:13,819 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:13:14,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1182 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1148 trivial. 0 not checked. [2024-09-13 10:13:14,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126343640] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 10:13:14,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 10:13:14,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 6] total 20 [2024-09-13 10:13:14,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054792502] [2024-09-13 10:13:14,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 10:13:14,153 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-13 10:13:14,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:14,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-13 10:13:14,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2024-09-13 10:13:14,155 INFO L87 Difference]: Start difference. First operand 95 states and 151 transitions. Second operand has 21 states, 20 states have (on average 2.3) internal successors, (46), 21 states have internal predecessors, (46), 12 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 12 states have call predecessors, (56), 12 states have call successors, (56) [2024-09-13 10:13:14,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:14,531 INFO L93 Difference]: Finished difference Result 140 states and 225 transitions. [2024-09-13 10:13:14,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-13 10:13:14,532 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.3) internal successors, (46), 21 states have internal predecessors, (46), 12 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 12 states have call predecessors, (56), 12 states have call successors, (56) Word has length 139 [2024-09-13 10:13:14,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:14,534 INFO L225 Difference]: With dead ends: 140 [2024-09-13 10:13:14,534 INFO L226 Difference]: Without dead ends: 140 [2024-09-13 10:13:14,535 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2024-09-13 10:13:14,535 INFO L434 NwaCegarLoop]: 53 mSDtfsCounter, 16 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:14,537 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 275 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 10:13:14,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-09-13 10:13:14,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2024-09-13 10:13:14,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 58 states have internal predecessors, (64), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2024-09-13 10:13:14,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 224 transitions. [2024-09-13 10:13:14,549 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 224 transitions. Word has length 139 [2024-09-13 10:13:14,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:14,550 INFO L474 AbstractCegarLoop]: Abstraction has 139 states and 224 transitions. [2024-09-13 10:13:14,550 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.3) internal successors, (46), 21 states have internal predecessors, (46), 12 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 12 states have call predecessors, (56), 12 states have call successors, (56) [2024-09-13 10:13:14,550 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 224 transitions. [2024-09-13 10:13:14,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2024-09-13 10:13:14,556 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 10:13:14,556 INFO L216 NwaCegarLoop]: trace histogram [64, 64, 64, 16, 13, 13, 13, 13, 13, 13, 13, 13, 13, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1] [2024-09-13 10:13:14,573 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-13 10:13:14,760 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:13:14,761 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 9 more)] === [2024-09-13 10:13:14,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 10:13:14,761 INFO L85 PathProgramCache]: Analyzing trace with hash 362318034, now seen corresponding path program 3 times [2024-09-13 10:13:14,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 10:13:14,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635775610] [2024-09-13 10:13:14,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 10:13:14,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 10:13:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,774 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 10:13:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,777 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-13 10:13:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,780 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-13 10:13:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,783 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 10:13:15,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,785 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-13 10:13:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,787 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-13 10:13:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,789 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-13 10:13:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,792 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-13 10:13:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,794 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-13 10:13:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,797 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-13 10:13:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,799 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-13 10:13:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,802 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-13 10:13:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,804 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-09-13 10:13:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,806 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-09-13 10:13:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,808 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-13 10:13:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,811 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-09-13 10:13:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,813 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-09-13 10:13:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,815 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-09-13 10:13:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,817 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-09-13 10:13:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,820 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-09-13 10:13:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,823 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-09-13 10:13:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,825 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-09-13 10:13:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,828 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-09-13 10:13:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,830 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-09-13 10:13:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,832 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-09-13 10:13:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,834 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-09-13 10:13:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,837 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-09-13 10:13:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,839 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-09-13 10:13:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,841 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-09-13 10:13:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,843 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-09-13 10:13:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,845 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-09-13 10:13:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,848 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-09-13 10:13:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,850 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-09-13 10:13:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,852 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-09-13 10:13:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,855 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-09-13 10:13:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,858 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-09-13 10:13:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,860 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-09-13 10:13:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,862 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-09-13 10:13:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,865 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-09-13 10:13:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,867 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-09-13 10:13:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,870 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-09-13 10:13:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,872 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-09-13 10:13:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,875 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-09-13 10:13:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,878 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-09-13 10:13:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,880 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-09-13 10:13:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,882 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-09-13 10:13:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,885 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-09-13 10:13:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,887 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-09-13 10:13:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,889 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-09-13 10:13:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,891 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-09-13 10:13:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,894 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-09-13 10:13:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,897 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2024-09-13 10:13:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,899 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2024-09-13 10:13:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,901 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2024-09-13 10:13:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,904 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2024-09-13 10:13:15,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,906 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2024-09-13 10:13:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,909 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2024-09-13 10:13:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,911 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2024-09-13 10:13:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,914 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2024-09-13 10:13:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,916 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2024-09-13 10:13:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,919 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2024-09-13 10:13:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,921 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2024-09-13 10:13:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,924 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2024-09-13 10:13:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,929 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2024-09-13 10:13:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 10:13:15,935 INFO L134 CoverageAnalysis]: Checked inductivity of 8659 backedges. 24 proven. 520 refuted. 0 times theorem prover too weak. 8115 trivial. 0 not checked. [2024-09-13 10:13:15,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 10:13:15,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635775610] [2024-09-13 10:13:15,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635775610] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 10:13:15,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873347604] [2024-09-13 10:13:15,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-13 10:13:15,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 10:13:15,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 10:13:15,937 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 10:13:15,939 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-13 10:13:15,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-13 10:13:15,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 10:13:16,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-13 10:13:16,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 10:13:16,117 INFO L134 CoverageAnalysis]: Checked inductivity of 8659 backedges. 96 proven. 1 refuted. 0 times theorem prover too weak. 8562 trivial. 0 not checked. [2024-09-13 10:13:16,117 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 10:13:16,435 INFO L134 CoverageAnalysis]: Checked inductivity of 8659 backedges. 96 proven. 1 refuted. 0 times theorem prover too weak. 8562 trivial. 0 not checked. [2024-09-13 10:13:16,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873347604] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 10:13:16,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 10:13:16,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 4, 4] total 21 [2024-09-13 10:13:16,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467841137] [2024-09-13 10:13:16,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 10:13:16,437 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-13 10:13:16,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 10:13:16,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-13 10:13:16,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2024-09-13 10:13:16,440 INFO L87 Difference]: Start difference. First operand 139 states and 224 transitions. Second operand has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 22 states have internal predecessors, (52), 13 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 13 states have call predecessors, (56), 13 states have call successors, (56) [2024-09-13 10:13:17,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 10:13:17,344 INFO L93 Difference]: Finished difference Result 159 states and 251 transitions. [2024-09-13 10:13:17,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-13 10:13:17,345 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 22 states have internal predecessors, (52), 13 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 13 states have call predecessors, (56), 13 states have call successors, (56) Word has length 365 [2024-09-13 10:13:17,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 10:13:17,346 INFO L225 Difference]: With dead ends: 159 [2024-09-13 10:13:17,346 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 10:13:17,346 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 898 GetRequests, 859 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=241, Invalid=1319, Unknown=0, NotChecked=0, Total=1560 [2024-09-13 10:13:17,347 INFO L434 NwaCegarLoop]: 130 mSDtfsCounter, 66 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-13 10:13:17,347 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1054 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-13 10:13:17,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 10:13:17,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 10:13:17,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 10:13:17,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 10:13:17,348 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 365 [2024-09-13 10:13:17,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 10:13:17,348 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 10:13:17,348 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 22 states have internal predecessors, (52), 13 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 13 states have call predecessors, (56), 13 states have call successors, (56) [2024-09-13 10:13:17,349 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 10:13:17,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 10:13:17,351 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 12 remaining) [2024-09-13 10:13:17,351 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 12 remaining) [2024-09-13 10:13:17,352 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (9 of 12 remaining) [2024-09-13 10:13:17,352 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONPRE_CONDITION (8 of 12 remaining) [2024-09-13 10:13:17,352 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONPRE_CONDITION (7 of 12 remaining) [2024-09-13 10:13:17,352 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION (6 of 12 remaining) [2024-09-13 10:13:17,352 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONPRE_CONDITION (5 of 12 remaining) [2024-09-13 10:13:17,352 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONPRE_CONDITION (4 of 12 remaining) [2024-09-13 10:13:17,353 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONPRE_CONDITION (3 of 12 remaining) [2024-09-13 10:13:17,353 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONPRE_CONDITION (2 of 12 remaining) [2024-09-13 10:13:17,353 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 12 remaining) [2024-09-13 10:13:17,353 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION (0 of 12 remaining) [2024-09-13 10:13:17,369 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-13 10:13:17,553 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-09-13 10:13:17,557 INFO L408 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 10:13:17,559 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 10:13:17,561 INFO L469 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-09-13 10:13:17,561 INFO L470 ceAbstractionStarter]: WitnessConsidered=2 [2024-09-13 10:13:17,561 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 10:13:17 BoogieIcfgContainer [2024-09-13 10:13:17,561 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 10:13:17,562 INFO L158 Benchmark]: Toolchain (without parser) took 10312.44ms. Allocated memory was 165.7MB in the beginning and 287.3MB in the end (delta: 121.6MB). Free memory was 128.1MB in the beginning and 165.0MB in the end (delta: -36.9MB). Peak memory consumption was 84.7MB. Max. memory is 16.1GB. [2024-09-13 10:13:17,562 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 165.7MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:13:17,562 INFO L158 Benchmark]: Witness Parser took 0.13ms. Allocated memory is still 165.7MB. Free memory is still 130.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:13:17,563 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.19ms. Allocated memory is still 165.7MB. Free memory was 128.1MB in the beginning and 114.0MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-13 10:13:17,563 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.37ms. Allocated memory is still 165.7MB. Free memory was 114.0MB in the beginning and 112.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 10:13:17,563 INFO L158 Benchmark]: Boogie Preprocessor took 42.02ms. Allocated memory is still 165.7MB. Free memory was 112.8MB in the beginning and 111.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 10:13:17,564 INFO L158 Benchmark]: RCFGBuilder took 326.00ms. Allocated memory is still 165.7MB. Free memory was 110.7MB in the beginning and 128.3MB in the end (delta: -17.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-09-13 10:13:17,564 INFO L158 Benchmark]: TraceAbstraction took 9605.73ms. Allocated memory was 165.7MB in the beginning and 287.3MB in the end (delta: 121.6MB). Free memory was 127.3MB in the beginning and 165.0MB in the end (delta: -37.7MB). Peak memory consumption was 86.6MB. Max. memory is 16.1GB. [2024-09-13 10:13:17,565 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.21ms. Allocated memory is still 165.7MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.13ms. Allocated memory is still 165.7MB. Free memory is still 130.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.19ms. Allocated memory is still 165.7MB. Free memory was 128.1MB in the beginning and 114.0MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.37ms. Allocated memory is still 165.7MB. Free memory was 114.0MB in the beginning and 112.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.02ms. Allocated memory is still 165.7MB. Free memory was 112.8MB in the beginning and 111.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 326.00ms. Allocated memory is still 165.7MB. Free memory was 110.7MB in the beginning and 128.3MB in the end (delta: -17.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9605.73ms. Allocated memory was 165.7MB in the beginning and 287.3MB in the end (delta: 121.6MB). Free memory was 127.3MB in the beginning and 165.0MB in the end (delta: -37.7MB). Peak memory consumption was 86.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 18]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 13]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 13]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 13]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 13]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 13]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 13]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 13]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 13]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 13]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 13]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 14, TraceHistogramMax: 64, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 190 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 136 mSDsluCounter, 2080 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1576 mSDsCounter, 409 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2394 IncrementalHoareTripleChecker+Invalid, 2803 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 409 mSolverCounterUnsat, 504 mSDtfsCounter, 2394 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1884 GetRequests, 1755 SyntacticMatches, 5 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=13, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 39 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 1671 NumberOfCodeBlocks, 1327 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2385 ConstructedInterpolants, 0 QuantifiedInterpolants, 4798 SizeOfPredicates, 0 NumberOfNonLiveVariables, 898 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 24 InterpolantComputations, 9 PerfectInterpolantSequences, 33441/34355 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-09-13 10:13:17,593 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE