./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_valuebound10.c --full-output --witness-type correctness_witness --validate ../results/automizer-verification-files/SV-COMP24_unreach-call/egcd-ll_valuebound10.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/egcd-ll_valuebound10.c ../results/automizer-verification-files/SV-COMP24_unreach-call/egcd-ll_valuebound10.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 05:35:17,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 05:35:17,625 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 05:35:17,631 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 05:35:17,634 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 05:35:17,666 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 05:35:17,666 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 05:35:17,667 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 05:35:17,667 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 05:35:17,671 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 05:35:17,671 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 05:35:17,671 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 05:35:17,672 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 05:35:17,672 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 05:35:17,672 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 05:35:17,673 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 05:35:17,673 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 05:35:17,673 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 05:35:17,675 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 05:35:17,675 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 05:35:17,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 05:35:17,676 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 05:35:17,676 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 05:35:17,676 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 05:35:17,676 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 05:35:17,677 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 05:35:17,678 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 05:35:17,678 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 05:35:17,678 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 05:35:17,679 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 05:35:17,679 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 05:35:17,679 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 05:35:17,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 05:35:17,680 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 05:35:17,680 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 05:35:17,681 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 05:35:17,681 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 05:35:17,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 05:35:17,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 05:35:17,689 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 05:35:17,690 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 05:35:17,690 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 05:35:17,690 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None [2024-09-13 05:35:17,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 05:35:17,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 05:35:17,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 05:35:17,926 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-13 05:35:17,926 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-13 05:35:17,927 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/egcd-ll_valuebound10.yml/witness-2.1.yml [2024-09-13 05:35:17,984 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 05:35:17,984 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 05:35:17,985 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_valuebound10.c [2024-09-13 05:35:19,350 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 05:35:19,515 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 05:35:19,516 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_valuebound10.c [2024-09-13 05:35:19,522 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/7bb9b8a66/27dbb612cd874139b68440154796afd3/FLAG5f3ec6b89 [2024-09-13 05:35:19,922 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/7bb9b8a66/27dbb612cd874139b68440154796afd3 [2024-09-13 05:35:19,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 05:35:19,924 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-13 05:35:19,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 05:35:19,926 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 05:35:19,930 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 05:35:19,931 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 05:35:17" (1/2) ... [2024-09-13 05:35:19,931 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b2f7966 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:35:19, skipping insertion in model container [2024-09-13 05:35:19,931 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 05:35:17" (1/2) ... [2024-09-13 05:35:19,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@57794618 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:35:19, skipping insertion in model container [2024-09-13 05:35:19,933 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 05:35:19" (2/2) ... [2024-09-13 05:35:19,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b2f7966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:35:19, skipping insertion in model container [2024-09-13 05:35:19,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 05:35:19" (2/2) ... [2024-09-13 05:35:19,944 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-13 05:35:19,945 INFO L1541 ArrayList]: Loop invariant at [L35-L52] (((((b == (((__int128) q * x) + ((__int128) y * s))) && (1 <= x)) && (a == (((__int128) y * r) + ((__int128) p * x)))) && (1 <= y)) && (((__int128) p * s) == (((__int128) q * r) + 1))) [2024-09-13 05:35:19,945 INFO L1541 ArrayList]: Function contract at [L10]: requires (1 <= \old(cond)), ensures (1 <= \old(cond)) [2024-09-13 05:35:19,945 INFO L1541 ArrayList]: Function contract at [L7]: requires null, ensures (\old(cond) != 0) [2024-09-13 05:35:19,966 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 05:35:20,110 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/egcd-ll_valuebound10.c[489,502] [2024-09-13 05:35:20,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 05:35:20,136 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global Start Parsing Global [2024-09-13 05:35:20,167 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/egcd-ll_valuebound10.c[489,502] Start Parsing Local [2024-09-13 05:35:20,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 05:35:20,196 INFO L204 MainTranslator]: Completed translation [2024-09-13 05:35:20,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:35:20 WrapperNode [2024-09-13 05:35:20,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 05:35:20,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 05:35:20,198 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 05:35:20,198 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 05:35:20,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:35:20" (1/1) ... [2024-09-13 05:35:20,210 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:35:20" (1/1) ... [2024-09-13 05:35:20,227 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 57 [2024-09-13 05:35:20,228 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 05:35:20,228 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 05:35:20,229 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 05:35:20,229 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 05:35:20,235 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:35:20" (1/1) ... [2024-09-13 05:35:20,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:35:20" (1/1) ... [2024-09-13 05:35:20,237 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:35:20" (1/1) ... [2024-09-13 05:35:20,242 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Procedure assume_abort_if_not is not part of the Ultimate memory model but has specification other that is not a ModifiesSpecification [2024-09-13 05:35:20,243 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:35:20" (1/1) ... [2024-09-13 05:35:20,243 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:35:20" (1/1) ... [2024-09-13 05:35:20,245 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:35:20" (1/1) ... [2024-09-13 05:35:20,248 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:35:20" (1/1) ... [2024-09-13 05:35:20,249 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:35:20" (1/1) ... [2024-09-13 05:35:20,250 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:35:20" (1/1) ... [2024-09-13 05:35:20,251 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 05:35:20,252 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 05:35:20,252 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 05:35:20,253 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 05:35:20,253 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:35:20" (1/1) ... [2024-09-13 05:35:20,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 05:35:20,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:35:20,275 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-13 05:35:20,277 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-13 05:35:20,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 05:35:20,315 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 05:35:20,315 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 05:35:20,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-13 05:35:20,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 05:35:20,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 05:35:20,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 05:35:20,316 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 05:35:20,367 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 05:35:20,369 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 05:35:20,542 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-13 05:35:20,566 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-09-13 05:35:20,566 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 05:35:20,588 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 05:35:20,588 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-13 05:35:20,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 05:35:20 BoogieIcfgContainer [2024-09-13 05:35:20,589 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 05:35:20,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 05:35:20,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 05:35:20,599 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 05:35:20,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 05:35:17" (1/4) ... [2024-09-13 05:35:20,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a46a921 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 05:35:20, skipping insertion in model container [2024-09-13 05:35:20,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 05:35:19" (2/4) ... [2024-09-13 05:35:20,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a46a921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 05:35:20, skipping insertion in model container [2024-09-13 05:35:20,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:35:20" (3/4) ... [2024-09-13 05:35:20,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a46a921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 05:35:20, skipping insertion in model container [2024-09-13 05:35:20,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 05:35:20" (4/4) ... [2024-09-13 05:35:20,603 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd-ll_valuebound10.c [2024-09-13 05:35:20,622 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 05:35:20,623 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-09-13 05:35:20,665 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 05:35:20,674 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;@4ff7b8b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 05:35:20,674 INFO L337 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-09-13 05:35:20,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 26 states have internal predecessors, (32), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-13 05:35:20,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-13 05:35:20,688 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:35:20,688 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-13 05:35:20,689 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 8 more)] === [2024-09-13 05:35:20,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:35:20,697 INFO L85 PathProgramCache]: Analyzing trace with hash 120466959, now seen corresponding path program 1 times [2024-09-13 05:35:20,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:35:20,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927871568] [2024-09-13 05:35:20,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:35:20,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:35:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:20,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:35:20,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:35:20,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927871568] [2024-09-13 05:35:20,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927871568] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:35:20,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:35:20,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 05:35:20,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764866898] [2024-09-13 05:35:20,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:35:20,848 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-13 05:35:20,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:35:20,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-13 05:35:20,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 05:35:20,876 INFO L87 Difference]: Start difference. First operand has 40 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 26 states have internal predecessors, (32), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) 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 05:35:20,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:35:20,905 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2024-09-13 05:35:20,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-13 05:35:20,907 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 05:35:20,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:35:20,913 INFO L225 Difference]: With dead ends: 40 [2024-09-13 05:35:20,913 INFO L226 Difference]: Without dead ends: 38 [2024-09-13 05:35:20,914 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 05:35:20,917 INFO L434 NwaCegarLoop]: 47 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, 47 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 05:35:20,918 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:35:20,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-13 05:35:20,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-13 05:35:20,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 25 states have internal predecessors, (27), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 05:35:20,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2024-09-13 05:35:20,946 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 5 [2024-09-13 05:35:20,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:35:20,947 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2024-09-13 05:35:20,947 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 05:35:20,947 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2024-09-13 05:35:20,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-13 05:35:20,948 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:35:20,948 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-13 05:35:20,948 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 05:35:20,949 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 8 more)] === [2024-09-13 05:35:20,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:35:20,950 INFO L85 PathProgramCache]: Analyzing trace with hash 120467021, now seen corresponding path program 1 times [2024-09-13 05:35:20,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:35:20,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43697921] [2024-09-13 05:35:20,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:35:20,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:35:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:21,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:35:21,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:35:21,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43697921] [2024-09-13 05:35:21,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43697921] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:35:21,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:35:21,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:35:21,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191131215] [2024-09-13 05:35:21,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:35:21,019 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 05:35:21,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:35:21,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 05:35:21,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 05:35:21,020 INFO L87 Difference]: Start difference. First operand 38 states and 48 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 05:35:21,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:35:21,059 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2024-09-13 05:35:21,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 05:35:21,059 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 05:35:21,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:35:21,060 INFO L225 Difference]: With dead ends: 37 [2024-09-13 05:35:21,060 INFO L226 Difference]: Without dead ends: 37 [2024-09-13 05:35:21,060 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 05:35:21,061 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:35:21,062 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 107 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:35:21,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-13 05:35:21,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-09-13 05:35:21,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 24 states have internal predecessors, (26), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 05:35:21,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2024-09-13 05:35:21,073 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 5 [2024-09-13 05:35:21,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:35:21,074 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2024-09-13 05:35:21,075 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 05:35:21,075 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2024-09-13 05:35:21,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-13 05:35:21,077 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:35:21,077 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:35:21,077 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 05:35:21,078 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 8 more)] === [2024-09-13 05:35:21,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:35:21,078 INFO L85 PathProgramCache]: Analyzing trace with hash -194771932, now seen corresponding path program 1 times [2024-09-13 05:35:21,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:35:21,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850033784] [2024-09-13 05:35:21,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:35:21,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:35:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 05:35:21,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [289729984] [2024-09-13 05:35:21,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:35:21,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:35:21,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:35:21,121 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:35:21,123 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-13 05:35:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:21,190 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-13 05:35:21,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:35:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-09-13 05:35:21,386 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:35:21,717 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-09-13 05:35:21,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:35:21,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850033784] [2024-09-13 05:35:21,718 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 05:35:21,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289729984] [2024-09-13 05:35:21,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289729984] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:35:21,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 05:35:21,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-09-13 05:35:21,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497011242] [2024-09-13 05:35:21,719 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 05:35:21,720 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-13 05:35:21,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:35:21,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-13 05:35:21,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-13 05:35:21,723 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-13 05:35:22,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:35:22,202 INFO L93 Difference]: Finished difference Result 42 states and 62 transitions. [2024-09-13 05:35:22,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-13 05:35:22,203 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 24 [2024-09-13 05:35:22,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:35:22,205 INFO L225 Difference]: With dead ends: 42 [2024-09-13 05:35:22,205 INFO L226 Difference]: Without dead ends: 42 [2024-09-13 05:35:22,205 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-13 05:35:22,206 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-13 05:35:22,207 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 155 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-13 05:35:22,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-13 05:35:22,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2024-09-13 05:35:22,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 05:35:22,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2024-09-13 05:35:22,220 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 24 [2024-09-13 05:35:22,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:35:22,221 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-09-13 05:35:22,221 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-13 05:35:22,221 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2024-09-13 05:35:22,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-13 05:35:22,222 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:35:22,222 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:35:22,235 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-13 05:35:22,423 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:35:22,424 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 8 more)] === [2024-09-13 05:35:22,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:35:22,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1037323201, now seen corresponding path program 1 times [2024-09-13 05:35:22,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:35:22,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49003030] [2024-09-13 05:35:22,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:35:22,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:35:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:22,566 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:35:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:22,573 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:35:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:22,580 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:35:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:22,589 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-13 05:35:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:22,595 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 05:35:22,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:35:22,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49003030] [2024-09-13 05:35:22,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49003030] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:35:22,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:35:22,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:35:22,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433099133] [2024-09-13 05:35:22,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:35:22,599 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:35:22,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:35:22,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:35:22,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:35:22,603 INFO L87 Difference]: Start difference. First operand 31 states and 41 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, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 05:35:22,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:35:22,612 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2024-09-13 05:35:22,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:35:22,613 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, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2024-09-13 05:35:22,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:35:22,614 INFO L225 Difference]: With dead ends: 29 [2024-09-13 05:35:22,615 INFO L226 Difference]: Without dead ends: 29 [2024-09-13 05:35:22,615 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:35:22,616 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 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 05:35:22,617 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:35:22,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-13 05:35:22,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-09-13 05:35:22,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 05:35:22,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2024-09-13 05:35:22,627 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 29 [2024-09-13 05:35:22,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:35:22,627 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2024-09-13 05:35:22,628 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, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 05:35:22,628 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2024-09-13 05:35:22,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-13 05:35:22,628 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:35:22,629 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:35:22,629 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-13 05:35:22,629 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 8 more)] === [2024-09-13 05:35:22,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:35:22,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1037323362, now seen corresponding path program 1 times [2024-09-13 05:35:22,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:35:22,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467250910] [2024-09-13 05:35:22,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:35:22,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:35:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:22,693 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:35:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:22,698 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:35:22,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:22,702 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:35:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:22,707 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-13 05:35:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:22,710 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 05:35:22,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:35:22,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467250910] [2024-09-13 05:35:22,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467250910] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:35:22,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:35:22,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 05:35:22,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747856797] [2024-09-13 05:35:22,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:35:22,712 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:35:22,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:35:22,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:35:22,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:35:22,713 INFO L87 Difference]: Start difference. First operand 29 states and 39 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, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 05:35:22,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:35:22,752 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2024-09-13 05:35:22,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:35:22,753 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, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2024-09-13 05:35:22,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:35:22,754 INFO L225 Difference]: With dead ends: 28 [2024-09-13 05:35:22,754 INFO L226 Difference]: Without dead ends: 26 [2024-09-13 05:35:22,755 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:35:22,757 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:35:22,757 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 50 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:35:22,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-13 05:35:22,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-09-13 05:35:22,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 05:35:22,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-09-13 05:35:22,763 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 29 [2024-09-13 05:35:22,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:35:22,763 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-09-13 05:35:22,763 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, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 05:35:22,764 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-09-13 05:35:22,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-13 05:35:22,766 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:35:22,766 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:35:22,766 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-13 05:35:22,767 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 8 more)] === [2024-09-13 05:35:22,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:35:22,767 INFO L85 PathProgramCache]: Analyzing trace with hash 639845667, now seen corresponding path program 1 times [2024-09-13 05:35:22,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:35:22,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494231900] [2024-09-13 05:35:22,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:35:22,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:35:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:22,825 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:35:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:22,828 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:35:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:22,831 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:35:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:22,834 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-13 05:35:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:22,836 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 05:35:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:22,839 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 05:35:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:22,842 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-13 05:35:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:22,846 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-13 05:35:22,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:35:22,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494231900] [2024-09-13 05:35:22,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494231900] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:35:22,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:35:22,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 05:35:22,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789342768] [2024-09-13 05:35:22,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:35:22,848 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:35:22,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:35:22,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:35:22,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:35:22,849 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-09-13 05:35:22,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:35:22,865 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2024-09-13 05:35:22,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:35:22,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 42 [2024-09-13 05:35:22,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:35:22,867 INFO L225 Difference]: With dead ends: 25 [2024-09-13 05:35:22,867 INFO L226 Difference]: Without dead ends: 25 [2024-09-13 05:35:22,867 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:35:22,868 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:35:22,868 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 51 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:35:22,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-09-13 05:35:22,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-09-13 05:35:22,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 05:35:22,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2024-09-13 05:35:22,871 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 42 [2024-09-13 05:35:22,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:35:22,872 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2024-09-13 05:35:22,872 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-09-13 05:35:22,873 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2024-09-13 05:35:22,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-09-13 05:35:22,874 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:35:22,874 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:35:22,874 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-13 05:35:22,874 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 8 more)] === [2024-09-13 05:35:22,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:35:22,874 INFO L85 PathProgramCache]: Analyzing trace with hash -2019475451, now seen corresponding path program 1 times [2024-09-13 05:35:22,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:35:22,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917728842] [2024-09-13 05:35:22,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:35:22,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:35:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:23,011 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:35:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:23,015 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:35:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:23,020 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:35:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:23,026 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-13 05:35:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:23,029 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-13 05:35:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:23,052 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-13 05:35:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:23,074 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-13 05:35:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:23,098 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-13 05:35:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:23,108 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-09-13 05:35:23,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:35:23,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917728842] [2024-09-13 05:35:23,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917728842] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:35:23,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:35:23,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:35:23,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246606188] [2024-09-13 05:35:23,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:35:23,109 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 05:35:23,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:35:23,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 05:35:23,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 05:35:23,109 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-13 05:35:23,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:35:23,153 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2024-09-13 05:35:23,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 05:35:23,153 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), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 47 [2024-09-13 05:35:23,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:35:23,154 INFO L225 Difference]: With dead ends: 25 [2024-09-13 05:35:23,154 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 05:35:23,154 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 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 05:35:23,155 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:35:23,156 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:35:23,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 05:35:23,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 05:35:23,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:35:23,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 05:35:23,158 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2024-09-13 05:35:23,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:35:23,158 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 05:35:23,158 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), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-13 05:35:23,159 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 05:35:23,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 05:35:23,162 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 11 remaining) [2024-09-13 05:35:23,165 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION (9 of 11 remaining) [2024-09-13 05:35:23,166 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (8 of 11 remaining) [2024-09-13 05:35:23,166 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONPRE_CONDITION (7 of 11 remaining) [2024-09-13 05:35:23,166 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONPRE_CONDITION (6 of 11 remaining) [2024-09-13 05:35:23,166 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION (5 of 11 remaining) [2024-09-13 05:35:23,166 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONPRE_CONDITION (4 of 11 remaining) [2024-09-13 05:35:23,166 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONPRE_CONDITION (3 of 11 remaining) [2024-09-13 05:35:23,166 INFO L785 garLoopResultBuilder]: Registering result SAFE for location assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION (2 of 11 remaining) [2024-09-13 05:35:23,166 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 11 remaining) [2024-09-13 05:35:23,167 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION (0 of 11 remaining) [2024-09-13 05:35:23,167 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-13 05:35:23,174 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:35:23,177 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 05:35:23,180 INFO L469 ceAbstractionStarter]: Automizer considered 1 witness invariants [2024-09-13 05:35:23,180 INFO L470 ceAbstractionStarter]: WitnessConsidered=1 [2024-09-13 05:35:23,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 05:35:23 BoogieIcfgContainer [2024-09-13 05:35:23,181 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 05:35:23,184 INFO L158 Benchmark]: Toolchain (without parser) took 3256.89ms. Allocated memory was 184.5MB in the beginning and 230.7MB in the end (delta: 46.1MB). Free memory was 124.6MB in the beginning and 88.7MB in the end (delta: 35.9MB). Peak memory consumption was 83.5MB. Max. memory is 16.1GB. [2024-09-13 05:35:23,184 INFO L158 Benchmark]: Witness Parser took 0.60ms. Allocated memory is still 184.5MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 05:35:23,184 INFO L158 Benchmark]: CDTParser took 1.46ms. Allocated memory is still 184.5MB. Free memory is still 146.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 05:35:23,185 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.10ms. Allocated memory is still 184.5MB. Free memory was 124.2MB in the beginning and 110.4MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-13 05:35:23,185 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.78ms. Allocated memory is still 184.5MB. Free memory was 110.4MB in the beginning and 108.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 05:35:23,185 INFO L158 Benchmark]: Boogie Preprocessor took 23.21ms. Allocated memory is still 184.5MB. Free memory was 108.7MB in the beginning and 107.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 05:35:23,185 INFO L158 Benchmark]: RCFGBuilder took 336.46ms. Allocated memory is still 184.5MB. Free memory was 107.0MB in the beginning and 91.5MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-13 05:35:23,186 INFO L158 Benchmark]: TraceAbstraction took 2585.10ms. Allocated memory was 184.5MB in the beginning and 230.7MB in the end (delta: 46.1MB). Free memory was 90.7MB in the beginning and 88.7MB in the end (delta: 1.9MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. [2024-09-13 05:35:23,188 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.60ms. Allocated memory is still 184.5MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 1.46ms. Allocated memory is still 184.5MB. Free memory is still 146.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.10ms. Allocated memory is still 184.5MB. Free memory was 124.2MB in the beginning and 110.4MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.78ms. Allocated memory is still 184.5MB. Free memory was 110.4MB in the beginning and 108.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.21ms. Allocated memory is still 184.5MB. Free memory was 108.7MB in the beginning and 107.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 336.46ms. Allocated memory is still 184.5MB. Free memory was 107.0MB in the beginning and 91.5MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2585.10ms. Allocated memory was 184.5MB in the beginning and 230.7MB in the end (delta: 46.1MB). Free memory was 90.7MB in the beginning and 88.7MB in the end (delta: 1.9MB). Peak memory consumption was 50.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: 35]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 10]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 10]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 10]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 10]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 10]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 10]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 10]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 7]: procedure postcondition always holds For all program executions holds that procedure postcondition 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: 10]: 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, 40 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 524 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 295 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 213 IncrementalHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 229 mSDtfsCounter, 213 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 11 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 197 ConstructedInterpolants, 0 QuantifiedInterpolants, 547 SizeOfPredicates, 1 NumberOfNonLiveVariables, 74 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 176/180 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 11 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-09-13 05:35:23,208 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