./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound1.c --full-output --witness-type correctness_witness --validate ../results/automizer-verification-files/SV-COMP24_unreach-call/prodbin-ll_valuebound1.yml/witness-2.1.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 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/nla-digbench-scaling/prodbin-ll_valuebound1.c ../results/automizer-verification-files/SV-COMP24_unreach-call/prodbin-ll_valuebound1.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-5189fb6-m [2024-09-13 06:21:24,302 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 06:21:24,355 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 06:21:24,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 06:21:24,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 06:21:24,399 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 06:21:24,401 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 06:21:24,401 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 06:21:24,402 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 06:21:24,403 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 06:21:24,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 06:21:24,418 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 06:21:24,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 06:21:24,419 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 06:21:24,419 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 06:21:24,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 06:21:24,422 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 06:21:24,422 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 06:21:24,422 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 06:21:24,422 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 06:21:24,422 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 06:21:24,423 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 06:21:24,423 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 06:21:24,423 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 06:21:24,423 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 06:21:24,423 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 06:21:24,423 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 06:21:24,424 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 06:21:24,424 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 06:21:24,424 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 06:21:24,424 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 06:21:24,424 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 06:21:24,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 06:21:24,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 06:21:24,424 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 06:21:24,425 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 06:21:24,425 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 06:21:24,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 06:21:24,425 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 06:21:24,425 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 06:21:24,425 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 06:21:24,426 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 06:21:24,426 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 06:21:24,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 06:21:24,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 06:21:24,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 06:21:24,665 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-13 06:21:24,666 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-13 06:21:24,667 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/prodbin-ll_valuebound1.yml/witness-2.1.yml [2024-09-13 06:21:24,736 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 06:21:24,737 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 06:21:24,737 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound1.c [2024-09-13 06:21:26,054 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 06:21:26,211 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 06:21:26,212 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound1.c [2024-09-13 06:21:26,219 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/81cade291/0500bc511f0b4586aac785a58945ed4e/FLAGb660e363c [2024-09-13 06:21:26,232 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/81cade291/0500bc511f0b4586aac785a58945ed4e [2024-09-13 06:21:26,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 06:21:26,234 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-13 06:21:26,237 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 06:21:26,237 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 06:21:26,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 06:21:26,242 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 06:21:24" (1/2) ... [2024-09-13 06:21:26,244 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12bda788 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 06:21:26, skipping insertion in model container [2024-09-13 06:21:26,245 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 06:21:24" (1/2) ... [2024-09-13 06:21:26,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@662db096 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 06:21:26, skipping insertion in model container [2024-09-13 06:21:26,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 06:21:26" (2/2) ... [2024-09-13 06:21:26,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12bda788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:21:26, skipping insertion in model container [2024-09-13 06:21:26,246 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 06:21:26" (2/2) ... [2024-09-13 06:21:26,253 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-13 06:21:26,253 INFO L1541 ArrayList]: Loop invariant at [L34-L45] (((((z == 0) && (b == 1)) && (y == 1)) && (a == x)) || (((b == 1) && (a == z)) && (y == 0))) [2024-09-13 06:21:26,253 INFO L1541 ArrayList]: Function contract at [L9]: requires null, ensures (\old(cond) != 0) [2024-09-13 06:21:26,253 INFO L1541 ArrayList]: Function contract at [L12]: requires (1 <= \old(cond)), ensures (1 <= \old(cond)) [2024-09-13 06:21:26,273 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 06:21:26,404 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound1.c[537,550] [2024-09-13 06:21:26,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 06:21:26,430 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global Start Parsing Global [2024-09-13 06:21:26,484 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound1.c[537,550] Start Parsing Local [2024-09-13 06:21:26,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 06:21:26,517 INFO L204 MainTranslator]: Completed translation [2024-09-13 06:21:26,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:21:26 WrapperNode [2024-09-13 06:21:26,518 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 06:21:26,519 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 06:21:26,520 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 06:21:26,520 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 06:21:26,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:21:26" (1/1) ... [2024-09-13 06:21:26,531 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:21:26" (1/1) ... [2024-09-13 06:21:26,551 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 43 [2024-09-13 06:21:26,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 06:21:26,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 06:21:26,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 06:21:26,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 06:21:26,561 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:21:26" (1/1) ... [2024-09-13 06:21:26,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:21:26" (1/1) ... [2024-09-13 06:21:26,562 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:21:26" (1/1) ... [2024-09-13 06:21:26,570 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Procedure assume_abort_if_not is not part of the Ultimate memory model but has specification other that is not a ModifiesSpecification [2024-09-13 06:21:26,571 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:21:26" (1/1) ... [2024-09-13 06:21:26,571 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:21:26" (1/1) ... [2024-09-13 06:21:26,585 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:21:26" (1/1) ... [2024-09-13 06:21:26,587 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:21:26" (1/1) ... [2024-09-13 06:21:26,589 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:21:26" (1/1) ... [2024-09-13 06:21:26,590 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:21:26" (1/1) ... [2024-09-13 06:21:26,591 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 06:21:26,592 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 06:21:26,592 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 06:21:26,593 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 06:21:26,593 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:21:26" (1/1) ... [2024-09-13 06:21:26,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 06:21:26,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 06:21:26,617 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 06:21:26,619 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 06:21:26,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 06:21:26,670 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 06:21:26,670 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 06:21:26,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-13 06:21:26,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 06:21:26,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 06:21:26,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 06:21:26,671 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 06:21:26,725 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 06:21:26,727 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 06:21:26,823 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-13 06:21:26,840 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-09-13 06:21:26,841 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 06:21:26,865 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 06:21:26,866 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-13 06:21:26,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 06:21:26 BoogieIcfgContainer [2024-09-13 06:21:26,866 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 06:21:26,868 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 06:21:26,868 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 06:21:26,871 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 06:21:26,872 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 06:21:24" (1/4) ... [2024-09-13 06:21:26,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0b5e00 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 06:21:26, skipping insertion in model container [2024-09-13 06:21:26,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 06:21:26" (2/4) ... [2024-09-13 06:21:26,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0b5e00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 06:21:26, skipping insertion in model container [2024-09-13 06:21:26,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 06:21:26" (3/4) ... [2024-09-13 06:21:26,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0b5e00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 06:21:26, skipping insertion in model container [2024-09-13 06:21:26,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 06:21:26" (4/4) ... [2024-09-13 06:21:26,875 INFO L112 eAbstractionObserver]: Analyzing ICFG prodbin-ll_valuebound1.c [2024-09-13 06:21:26,892 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 06:21:26,893 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-09-13 06:21:26,933 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 06:21:26,938 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;@63c26f88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 06:21:26,939 INFO L337 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-09-13 06:21:26,942 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 22 states have internal predecessors, (28), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 06:21:26,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-13 06:21:26,949 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 06:21:26,949 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-13 06:21:26,950 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-13 06:21:26,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 06:21:26,955 INFO L85 PathProgramCache]: Analyzing trace with hash 99841657, now seen corresponding path program 1 times [2024-09-13 06:21:26,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 06:21:26,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202481496] [2024-09-13 06:21:26,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 06:21:26,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 06:21:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:27,089 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 06:21:27,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 06:21:27,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202481496] [2024-09-13 06:21:27,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202481496] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 06:21:27,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 06:21:27,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 06:21:27,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442664723] [2024-09-13 06:21:27,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 06:21:27,097 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-13 06:21:27,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 06:21:27,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-13 06:21:27,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 06:21:27,129 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 22 states have internal predecessors, (28), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 06:21:27,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 06:21:27,150 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-09-13 06:21:27,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-13 06:21:27,153 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-09-13 06:21:27,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 06:21:27,159 INFO L225 Difference]: With dead ends: 30 [2024-09-13 06:21:27,159 INFO L226 Difference]: Without dead ends: 28 [2024-09-13 06:21:27,161 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 06:21:27,164 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 06:21:27,165 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 06:21:27,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-13 06:21:27,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-09-13 06:21:27,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-13 06:21:27,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-09-13 06:21:27,206 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 5 [2024-09-13 06:21:27,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 06:21:27,207 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-09-13 06:21:27,207 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 06:21:27,207 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-09-13 06:21:27,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-13 06:21:27,208 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 06:21:27,208 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-13 06:21:27,209 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 06:21:27,210 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-13 06:21:27,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 06:21:27,211 INFO L85 PathProgramCache]: Analyzing trace with hash 99841719, now seen corresponding path program 1 times [2024-09-13 06:21:27,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 06:21:27,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750879783] [2024-09-13 06:21:27,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 06:21:27,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 06:21:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:27,323 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 06:21:27,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 06:21:27,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750879783] [2024-09-13 06:21:27,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750879783] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 06:21:27,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 06:21:27,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 06:21:27,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076175518] [2024-09-13 06:21:27,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 06:21:27,325 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 06:21:27,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 06:21:27,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 06:21:27,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 06:21:27,326 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 06:21:27,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 06:21:27,365 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2024-09-13 06:21:27,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 06:21:27,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-09-13 06:21:27,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 06:21:27,366 INFO L225 Difference]: With dead ends: 27 [2024-09-13 06:21:27,366 INFO L226 Difference]: Without dead ends: 27 [2024-09-13 06:21:27,367 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 06:21:27,368 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 06:21:27,368 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 64 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 06:21:27,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-13 06:21:27,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-09-13 06:21:27,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-13 06:21:27,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-09-13 06:21:27,371 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 5 [2024-09-13 06:21:27,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 06:21:27,371 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-09-13 06:21:27,371 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 06:21:27,372 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-09-13 06:21:27,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-13 06:21:27,372 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 06:21:27,372 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 06:21:27,372 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 06:21:27,372 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-13 06:21:27,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 06:21:27,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1683842591, now seen corresponding path program 1 times [2024-09-13 06:21:27,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 06:21:27,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515302756] [2024-09-13 06:21:27,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 06:21:27,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 06:21:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:27,642 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 06:21:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:27,653 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 06:21:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:27,687 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 06:21:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:27,722 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-13 06:21:27,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 06:21:27,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515302756] [2024-09-13 06:21:27,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515302756] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 06:21:27,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 06:21:27,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-13 06:21:27,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427668509] [2024-09-13 06:21:27,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 06:21:27,726 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 06:21:27,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 06:21:27,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 06:21:27,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-13 06:21:27,729 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 06:21:27,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 06:21:27,826 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2024-09-13 06:21:27,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 06:21:27,827 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-09-13 06:21:27,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 06:21:27,828 INFO L225 Difference]: With dead ends: 32 [2024-09-13 06:21:27,829 INFO L226 Difference]: Without dead ends: 32 [2024-09-13 06:21:27,829 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-13 06:21:27,830 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 06:21:27,832 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 55 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 06:21:27,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-13 06:21:27,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-13 06:21:27,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 06:21:27,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2024-09-13 06:21:27,839 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 19 [2024-09-13 06:21:27,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 06:21:27,840 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2024-09-13 06:21:27,840 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 06:21:27,841 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2024-09-13 06:21:27,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-13 06:21:27,841 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 06:21:27,841 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 06:21:27,842 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 06:21:27,842 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-13 06:21:27,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 06:21:27,842 INFO L85 PathProgramCache]: Analyzing trace with hash 332140251, now seen corresponding path program 1 times [2024-09-13 06:21:27,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 06:21:27,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343944991] [2024-09-13 06:21:27,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 06:21:27,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 06:21:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:27,917 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 06:21:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:27,923 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 06:21:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:27,929 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 06:21:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:27,932 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 06:21:27,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 06:21:27,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343944991] [2024-09-13 06:21:27,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343944991] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 06:21:27,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 06:21:27,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 06:21:27,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523837815] [2024-09-13 06:21:27,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 06:21:27,934 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 06:21:27,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 06:21:27,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 06:21:27,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 06:21:27,935 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 06:21:27,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 06:21:27,943 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2024-09-13 06:21:27,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 06:21:27,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-09-13 06:21:27,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 06:21:27,945 INFO L225 Difference]: With dead ends: 30 [2024-09-13 06:21:27,945 INFO L226 Difference]: Without dead ends: 30 [2024-09-13 06:21:27,945 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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 06:21:27,946 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 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 06:21:27,947 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 06:21:27,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-13 06:21:27,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-13 06:21:27,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 06:21:27,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-09-13 06:21:27,951 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 24 [2024-09-13 06:21:27,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 06:21:27,951 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-09-13 06:21:27,951 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 06:21:27,951 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-09-13 06:21:27,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-13 06:21:27,952 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 06:21:27,952 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 06:21:27,952 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-13 06:21:27,952 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-13 06:21:27,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 06:21:27,953 INFO L85 PathProgramCache]: Analyzing trace with hash 332140412, now seen corresponding path program 1 times [2024-09-13 06:21:27,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 06:21:27,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944091866] [2024-09-13 06:21:27,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 06:21:27,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 06:21:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:27,991 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 06:21:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:27,996 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 06:21:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:28,000 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 06:21:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:28,004 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 06:21:28,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 06:21:28,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944091866] [2024-09-13 06:21:28,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944091866] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 06:21:28,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 06:21:28,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 06:21:28,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102527978] [2024-09-13 06:21:28,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 06:21:28,005 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 06:21:28,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 06:21:28,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 06:21:28,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 06:21:28,006 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 06:21:28,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 06:21:28,026 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2024-09-13 06:21:28,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 06:21:28,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-09-13 06:21:28,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 06:21:28,028 INFO L225 Difference]: With dead ends: 29 [2024-09-13 06:21:28,028 INFO L226 Difference]: Without dead ends: 29 [2024-09-13 06:21:28,029 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 06:21:28,030 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 06:21:28,030 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 45 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 06:21:28,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-13 06:21:28,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-09-13 06:21:28,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 06:21:28,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-09-13 06:21:28,039 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 24 [2024-09-13 06:21:28,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 06:21:28,040 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-09-13 06:21:28,040 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 06:21:28,041 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-09-13 06:21:28,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-13 06:21:28,041 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 06:21:28,041 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 06:21:28,042 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-13 06:21:28,042 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-13 06:21:28,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 06:21:28,045 INFO L85 PathProgramCache]: Analyzing trace with hash -633490312, now seen corresponding path program 1 times [2024-09-13 06:21:28,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 06:21:28,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119327926] [2024-09-13 06:21:28,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 06:21:28,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 06:21:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:28,449 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 06:21:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:28,452 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 06:21:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:28,456 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 06:21:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:28,459 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-13 06:21:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:28,474 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 06:21:28,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 06:21:28,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119327926] [2024-09-13 06:21:28,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119327926] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 06:21:28,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423753944] [2024-09-13 06:21:28,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 06:21:28,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 06:21:28,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 06:21:28,479 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 06:21:28,481 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 06:21:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:28,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-13 06:21:28,532 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 06:21:28,660 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 06:21:28,661 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 06:21:28,858 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 06:21:28,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423753944] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-13 06:21:28,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-13 06:21:28,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 9 [2024-09-13 06:21:28,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389746906] [2024-09-13 06:21:28,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 06:21:28,859 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 06:21:28,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 06:21:28,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 06:21:28,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-09-13 06:21:28,860 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-13 06:21:28,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 06:21:28,908 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2024-09-13 06:21:28,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 06:21:28,908 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2024-09-13 06:21:28,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 06:21:28,909 INFO L225 Difference]: With dead ends: 26 [2024-09-13 06:21:28,909 INFO L226 Difference]: Without dead ends: 26 [2024-09-13 06:21:28,909 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-09-13 06:21:28,910 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 06:21:28,910 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 51 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 06:21:28,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-13 06:21:28,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-09-13 06:21:28,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.0) internal successors, (18), 18 states have internal predecessors, (18), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 06:21:28,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-09-13 06:21:28,917 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 29 [2024-09-13 06:21:28,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 06:21:28,917 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-09-13 06:21:28,918 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-13 06:21:28,918 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2024-09-13 06:21:28,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-13 06:21:28,918 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 06:21:28,918 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 06:21:28,944 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-13 06:21:29,119 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-13 06:21:29,120 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-13 06:21:29,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 06:21:29,120 INFO L85 PathProgramCache]: Analyzing trace with hash -885297805, now seen corresponding path program 1 times [2024-09-13 06:21:29,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 06:21:29,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267239292] [2024-09-13 06:21:29,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 06:21:29,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 06:21:29,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 06:21:29,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1875089774] [2024-09-13 06:21:29,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 06:21:29,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 06:21:29,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 06:21:29,145 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 06:21:29,149 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 06:21:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 06:21:29,199 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-13 06:21:29,201 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 06:21:29,364 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-13 06:21:29,365 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 06:21:29,474 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-13 06:21:29,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 06:21:29,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267239292] [2024-09-13 06:21:29,475 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 06:21:29,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875089774] [2024-09-13 06:21:29,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875089774] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 06:21:29,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 06:21:29,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2024-09-13 06:21:29,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856790529] [2024-09-13 06:21:29,475 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 06:21:29,476 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-13 06:21:29,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 06:21:29,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-13 06:21:29,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-09-13 06:21:29,477 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-09-13 06:21:29,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 06:21:29,529 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2024-09-13 06:21:29,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-13 06:21:29,530 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 37 [2024-09-13 06:21:29,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 06:21:29,530 INFO L225 Difference]: With dead ends: 25 [2024-09-13 06:21:29,530 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 06:21:29,531 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-09-13 06:21:29,531 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 06:21:29,531 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 89 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 06:21:29,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 06:21:29,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 06:21:29,532 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 06:21:29,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 06:21:29,532 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2024-09-13 06:21:29,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 06:21:29,532 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 06:21:29,532 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-09-13 06:21:29,533 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 06:21:29,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 06:21:29,537 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 6 remaining) [2024-09-13 06:21:29,537 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION (4 of 6 remaining) [2024-09-13 06:21:29,538 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (3 of 6 remaining) [2024-09-13 06:21:29,538 INFO L785 garLoopResultBuilder]: Registering result SAFE for location assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION (2 of 6 remaining) [2024-09-13 06:21:29,539 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-09-13 06:21:29,539 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION (0 of 6 remaining) [2024-09-13 06:21:29,557 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 06:21:29,739 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-13 06:21:29,743 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-09-13 06:21:29,744 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 06:21:29,746 INFO L469 ceAbstractionStarter]: Automizer considered 1 witness invariants [2024-09-13 06:21:29,746 INFO L470 ceAbstractionStarter]: WitnessConsidered=1 [2024-09-13 06:21:29,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 06:21:29 BoogieIcfgContainer [2024-09-13 06:21:29,747 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 06:21:29,747 INFO L158 Benchmark]: Toolchain (without parser) took 3512.71ms. Allocated memory was 144.7MB in the beginning and 262.1MB in the end (delta: 117.4MB). Free memory was 73.9MB in the beginning and 189.2MB in the end (delta: -115.4MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. [2024-09-13 06:21:29,747 INFO L158 Benchmark]: Witness Parser took 0.17ms. Allocated memory is still 144.7MB. Free memory is still 110.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 06:21:29,747 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 144.7MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 06:21:29,747 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.43ms. Allocated memory was 144.7MB in the beginning and 213.9MB in the end (delta: 69.2MB). Free memory was 73.7MB in the beginning and 183.9MB in the end (delta: -110.3MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2024-09-13 06:21:29,748 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.67ms. Allocated memory is still 213.9MB. Free memory was 183.9MB in the beginning and 182.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 06:21:29,748 INFO L158 Benchmark]: Boogie Preprocessor took 39.14ms. Allocated memory is still 213.9MB. Free memory was 182.4MB in the beginning and 184.3MB in the end (delta: -1.9MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2024-09-13 06:21:29,748 INFO L158 Benchmark]: RCFGBuilder took 273.88ms. Allocated memory is still 213.9MB. Free memory was 184.3MB in the beginning and 170.6MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-13 06:21:29,748 INFO L158 Benchmark]: TraceAbstraction took 2878.60ms. Allocated memory was 213.9MB in the beginning and 262.1MB in the end (delta: 48.2MB). Free memory was 170.6MB in the beginning and 189.2MB in the end (delta: -18.6MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2024-09-13 06:21:29,749 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.17ms. Allocated memory is still 144.7MB. Free memory is still 110.0MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.15ms. Allocated memory is still 144.7MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.43ms. Allocated memory was 144.7MB in the beginning and 213.9MB in the end (delta: 69.2MB). Free memory was 73.7MB in the beginning and 183.9MB in the end (delta: -110.3MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.67ms. Allocated memory is still 213.9MB. Free memory was 183.9MB in the beginning and 182.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.14ms. Allocated memory is still 213.9MB. Free memory was 182.4MB in the beginning and 184.3MB in the end (delta: -1.9MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * RCFGBuilder took 273.88ms. Allocated memory is still 213.9MB. Free memory was 184.3MB in the beginning and 170.6MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2878.60ms. Allocated memory was 213.9MB in the beginning and 262.1MB in the end (delta: 48.2MB). Free memory was 170.6MB in the beginning and 189.2MB in the end (delta: -18.6MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 34]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 12]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 12]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 9]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - PositiveResult [Line: 15]: 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: 12]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 387 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 225 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 181 IncrementalHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 162 mSDtfsCounter, 181 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=3, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 228 ConstructedInterpolants, 0 QuantifiedInterpolants, 788 SizeOfPredicates, 3 NumberOfNonLiveVariables, 179 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 106/115 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 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-09-13 06:21:29,763 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE