./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id2_b2_o3.c --full-output --witness-type correctness_witness --validate ../results/automizer-verification-files/SV-COMP24_unreach-call/id2_b2_o3.yml/witness-2.1.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 04d6fb36 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/recursive-simple/id2_b2_o3.c ../results/automizer-verification-files/SV-COMP24_unreach-call/id2_b2_o3.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-tmp.dk.referee-eval-04d6fb3-m [2024-09-15 20:25:00,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-15 20:25:00,474 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-15 20:25:00,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-15 20:25:00,479 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-15 20:25:00,503 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-15 20:25:00,505 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-15 20:25:00,505 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-15 20:25:00,506 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-15 20:25:00,506 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-15 20:25:00,507 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-15 20:25:00,507 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-15 20:25:00,507 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-15 20:25:00,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-15 20:25:00,509 INFO L153 SettingsManager]: * Use SBE=true [2024-09-15 20:25:00,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-15 20:25:00,510 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-15 20:25:00,510 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-15 20:25:00,510 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-15 20:25:00,510 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-15 20:25:00,511 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-15 20:25:00,511 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-15 20:25:00,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-15 20:25:00,513 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-15 20:25:00,514 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-15 20:25:00,514 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-15 20:25:00,514 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-15 20:25:00,514 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-15 20:25:00,515 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-15 20:25:00,515 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-15 20:25:00,515 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-15 20:25:00,516 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-15 20:25:00,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 20:25:00,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-15 20:25:00,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-15 20:25:00,517 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-15 20:25:00,517 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-15 20:25:00,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-15 20:25:00,517 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-15 20:25:00,517 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-15 20:25:00,518 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-15 20:25:00,518 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-15 20:25:00,518 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-15 20:25:00,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-15 20:25:00,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-15 20:25:00,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-15 20:25:00,775 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-15 20:25:00,776 INFO L274 PluginConnector]: CDTParser initialized [2024-09-15 20:25:00,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive-simple/id2_b2_o3.c [2024-09-15 20:25:02,015 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-15 20:25:02,181 INFO L384 CDTParser]: Found 1 translation units. [2024-09-15 20:25:02,182 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/id2_b2_o3.c [2024-09-15 20:25:02,189 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/618fcd982/90e9f1ca029e461e961ddb3b84ea917e/FLAG053b4de0f [2024-09-15 20:25:02,203 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/618fcd982/90e9f1ca029e461e961ddb3b84ea917e [2024-09-15 20:25:02,205 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-15 20:25:02,205 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-15 20:25:02,207 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/id2_b2_o3.yml/witness-2.1.yml [2024-09-15 20:25:02,246 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-15 20:25:02,249 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-15 20:25:02,251 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-15 20:25:02,252 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-15 20:25:02,255 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-15 20:25:02,256 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 08:25:02" (1/2) ... [2024-09-15 20:25:02,256 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1115f1a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:25:02, skipping insertion in model container [2024-09-15 20:25:02,257 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 08:25:02" (1/2) ... [2024-09-15 20:25:02,258 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5a92ffb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:25:02, skipping insertion in model container [2024-09-15 20:25:02,258 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 15.09 08:25:02" (2/2) ... [2024-09-15 20:25:02,258 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1115f1a2 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:25:02, skipping insertion in model container [2024-09-15 20:25:02,258 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 15.09 08:25:02" (2/2) ... [2024-09-15 20:25:02,265 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-15 20:25:02,265 INFO L1541 ArrayList]: Function contract at [L9]: requires null, ensures (\result < 3) [2024-09-15 20:25:02,278 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-15 20:25:02,404 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/id2_b2_o3.c[771,784] [2024-09-15 20:25:02,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 20:25:02,422 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global [2024-09-15 20:25:02,453 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/id2_b2_o3.c[771,784] [2024-09-15 20:25:02,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 20:25:02,465 INFO L204 MainTranslator]: Completed translation [2024-09-15 20:25:02,466 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:25:02 WrapperNode [2024-09-15 20:25:02,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-15 20:25:02,468 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-15 20:25:02,468 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-15 20:25:02,468 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-15 20:25:02,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:25:02" (1/1) ... [2024-09-15 20:25:02,488 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:25:02" (1/1) ... [2024-09-15 20:25:02,501 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2024-09-15 20:25:02,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-15 20:25:02,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-15 20:25:02,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-15 20:25:02,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-15 20:25:02,509 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:25:02" (1/1) ... [2024-09-15 20:25:02,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:25:02" (1/1) ... [2024-09-15 20:25:02,511 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:25:02" (1/1) ... [2024-09-15 20:25:02,518 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Procedure id is not part of the Ultimate memory model but has specification other that is not a ModifiesSpecification [2024-09-15 20:25:02,518 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:25:02" (1/1) ... [2024-09-15 20:25:02,518 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:25:02" (1/1) ... [2024-09-15 20:25:02,538 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:25:02" (1/1) ... [2024-09-15 20:25:02,539 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:25:02" (1/1) ... [2024-09-15 20:25:02,540 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:25:02" (1/1) ... [2024-09-15 20:25:02,540 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:25:02" (1/1) ... [2024-09-15 20:25:02,545 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-15 20:25:02,546 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-15 20:25:02,546 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-15 20:25:02,546 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-15 20:25:02,546 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:25:02" (1/1) ... [2024-09-15 20:25:02,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 20:25:02,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 20:25:02,577 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-15 20:25:02,580 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-15 20:25:02,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-15 20:25:02,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-15 20:25:02,615 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2024-09-15 20:25:02,615 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2024-09-15 20:25:02,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-15 20:25:02,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-15 20:25:02,616 INFO L130 BoogieDeclarations]: Found specification of procedure id [2024-09-15 20:25:02,616 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2024-09-15 20:25:02,670 INFO L242 CfgBuilder]: Building ICFG [2024-09-15 20:25:02,673 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-15 20:25:02,774 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-09-15 20:25:02,776 INFO L291 CfgBuilder]: Performing block encoding [2024-09-15 20:25:02,790 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-15 20:25:02,790 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-15 20:25:02,791 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 08:25:02 BoogieIcfgContainer [2024-09-15 20:25:02,791 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-15 20:25:02,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-15 20:25:02,793 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-15 20:25:02,795 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-15 20:25:02,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 08:25:02" (1/4) ... [2024-09-15 20:25:02,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e65a488 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 08:25:02, skipping insertion in model container [2024-09-15 20:25:02,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 15.09 08:25:02" (2/4) ... [2024-09-15 20:25:02,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e65a488 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 15.09 08:25:02, skipping insertion in model container [2024-09-15 20:25:02,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:25:02" (3/4) ... [2024-09-15 20:25:02,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e65a488 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 15.09 08:25:02, skipping insertion in model container [2024-09-15 20:25:02,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 08:25:02" (4/4) ... [2024-09-15 20:25:02,798 INFO L112 eAbstractionObserver]: Analyzing ICFG id2_b2_o3.c [2024-09-15 20:25:02,811 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-15 20:25:02,811 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-09-15 20:25:02,856 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-15 20:25:02,861 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;@72f38cb5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-15 20:25:02,862 INFO L337 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-09-15 20:25:02,865 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-15 20:25:02,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-15 20:25:02,872 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:25:02,872 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-15 20:25:02,873 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting idErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-15 20:25:02,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:25:02,880 INFO L85 PathProgramCache]: Analyzing trace with hash 73343560, now seen corresponding path program 1 times [2024-09-15 20:25:02,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:25:02,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73294228] [2024-09-15 20:25:02,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:25:02,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:25:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:25:03,083 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-15 20:25:03,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:25:03,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73294228] [2024-09-15 20:25:03,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73294228] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:25:03,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:25:03,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-15 20:25:03,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173721467] [2024-09-15 20:25:03,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:25:03,089 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-15 20:25:03,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:25:03,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-15 20:25:03,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-15 20:25:03,117 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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-15 20:25:03,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:25:03,150 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2024-09-15 20:25:03,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-15 20:25:03,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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-15 20:25:03,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:25:03,159 INFO L225 Difference]: With dead ends: 25 [2024-09-15 20:25:03,159 INFO L226 Difference]: Without dead ends: 23 [2024-09-15 20:25:03,160 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-15 20:25:03,163 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:25:03,172 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 44 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:25:03,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-15 20:25:03,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2024-09-15 20:25:03,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-15 20:25:03,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-09-15 20:25:03,198 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 5 [2024-09-15 20:25:03,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:25:03,199 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-09-15 20:25:03,199 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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-15 20:25:03,199 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-09-15 20:25:03,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-15 20:25:03,200 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:25:03,201 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:25:03,201 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-15 20:25:03,201 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-15 20:25:03,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:25:03,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1610947187, now seen corresponding path program 1 times [2024-09-15 20:25:03,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:25:03,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079168265] [2024-09-15 20:25:03,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:25:03,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:25:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:25:03,284 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-15 20:25:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:25:03,318 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-15 20:25:03,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:25:03,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079168265] [2024-09-15 20:25:03,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079168265] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:25:03,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:25:03,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 20:25:03,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152011983] [2024-09-15 20:25:03,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:25:03,321 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:25:03,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:25:03,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:25:03,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:25:03,322 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 20:25:03,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:25:03,343 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2024-09-15 20:25:03,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:25:03,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2024-09-15 20:25:03,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:25:03,345 INFO L225 Difference]: With dead ends: 25 [2024-09-15 20:25:03,345 INFO L226 Difference]: Without dead ends: 23 [2024-09-15 20:25:03,345 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:25:03,346 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:25:03,346 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:25:03,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-15 20:25:03,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-09-15 20:25:03,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-15 20:25:03,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-09-15 20:25:03,350 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 9 [2024-09-15 20:25:03,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:25:03,350 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-09-15 20:25:03,350 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 20:25:03,350 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-09-15 20:25:03,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-15 20:25:03,351 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:25:03,351 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:25:03,351 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-15 20:25:03,351 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting idErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-15 20:25:03,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:25:03,355 INFO L85 PathProgramCache]: Analyzing trace with hash -477854253, now seen corresponding path program 1 times [2024-09-15 20:25:03,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:25:03,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174420800] [2024-09-15 20:25:03,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:25:03,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:25:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:25:03,472 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-15 20:25:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:25:03,507 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-15 20:25:03,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:25:03,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174420800] [2024-09-15 20:25:03,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174420800] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:25:03,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:25:03,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 20:25:03,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404958804] [2024-09-15 20:25:03,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:25:03,509 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:25:03,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:25:03,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:25:03,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:25:03,510 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 20:25:03,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:25:03,528 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2024-09-15 20:25:03,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:25:03,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-15 20:25:03,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:25:03,529 INFO L225 Difference]: With dead ends: 27 [2024-09-15 20:25:03,529 INFO L226 Difference]: Without dead ends: 27 [2024-09-15 20:25:03,530 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:25:03,530 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:25:03,531 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:25:03,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-15 20:25:03,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-09-15 20:25:03,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-15 20:25:03,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-09-15 20:25:03,535 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 12 [2024-09-15 20:25:03,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:25:03,536 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-09-15 20:25:03,536 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 20:25:03,536 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-09-15 20:25:03,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-15 20:25:03,536 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:25:03,536 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:25:03,536 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-15 20:25:03,537 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting idErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-15 20:25:03,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:25:03,537 INFO L85 PathProgramCache]: Analyzing trace with hash -477854222, now seen corresponding path program 1 times [2024-09-15 20:25:03,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:25:03,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132443296] [2024-09-15 20:25:03,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:25:03,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:25:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:25:03,618 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-15 20:25:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:25:03,644 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-15 20:25:03,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:25:03,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132443296] [2024-09-15 20:25:03,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132443296] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:25:03,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:25:03,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 20:25:03,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375963392] [2024-09-15 20:25:03,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:25:03,645 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-15 20:25:03,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:25:03,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-15 20:25:03,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-15 20:25:03,646 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 20:25:03,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:25:03,681 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2024-09-15 20:25:03,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-15 20:25:03,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-15 20:25:03,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:25:03,683 INFO L225 Difference]: With dead ends: 29 [2024-09-15 20:25:03,683 INFO L226 Difference]: Without dead ends: 29 [2024-09-15 20:25:03,684 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-15 20:25:03,684 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:25:03,685 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:25:03,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-15 20:25:03,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-09-15 20:25:03,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-15 20:25:03,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-09-15 20:25:03,689 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 12 [2024-09-15 20:25:03,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:25:03,689 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-09-15 20:25:03,689 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 20:25:03,689 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-09-15 20:25:03,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-15 20:25:03,690 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:25:03,690 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:25:03,690 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-15 20:25:03,690 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-15 20:25:03,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:25:03,691 INFO L85 PathProgramCache]: Analyzing trace with hash -518888393, now seen corresponding path program 1 times [2024-09-15 20:25:03,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:25:03,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989877119] [2024-09-15 20:25:03,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:25:03,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:25:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:25:03,773 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-15 20:25:03,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:25:03,821 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-15 20:25:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:25:03,838 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-15 20:25:03,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:25:03,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989877119] [2024-09-15 20:25:03,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989877119] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:25:03,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:25:03,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-15 20:25:03,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550808153] [2024-09-15 20:25:03,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:25:03,839 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-15 20:25:03,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:25:03,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-15 20:25:03,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-15 20:25:03,840 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-15 20:25:03,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:25:03,874 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-09-15 20:25:03,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-15 20:25:03,875 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-15 20:25:03,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:25:03,876 INFO L225 Difference]: With dead ends: 31 [2024-09-15 20:25:03,876 INFO L226 Difference]: Without dead ends: 29 [2024-09-15 20:25:03,877 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-15 20:25:03,877 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:25:03,881 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:25:03,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-15 20:25:03,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-09-15 20:25:03,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-15 20:25:03,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-09-15 20:25:03,887 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2024-09-15 20:25:03,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:25:03,888 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-09-15 20:25:03,888 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-15 20:25:03,888 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-09-15 20:25:03,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-15 20:25:03,888 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:25:03,889 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:25:03,889 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-15 20:25:03,889 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting idErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-15 20:25:03,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:25:03,889 INFO L85 PathProgramCache]: Analyzing trace with hash 77705380, now seen corresponding path program 1 times [2024-09-15 20:25:03,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:25:03,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479159978] [2024-09-15 20:25:03,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:25:03,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:25:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:25:03,941 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-15 20:25:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:25:03,974 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-15 20:25:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:25:03,999 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-15 20:25:03,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:25:04,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479159978] [2024-09-15 20:25:04,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479159978] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:25:04,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:25:04,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 20:25:04,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411552959] [2024-09-15 20:25:04,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:25:04,000 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:25:04,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:25:04,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:25:04,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:25:04,001 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-15 20:25:04,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:25:04,022 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-09-15 20:25:04,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:25:04,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-09-15 20:25:04,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:25:04,024 INFO L225 Difference]: With dead ends: 31 [2024-09-15 20:25:04,024 INFO L226 Difference]: Without dead ends: 31 [2024-09-15 20:25:04,025 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 20:25:04,025 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:25:04,026 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:25:04,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-15 20:25:04,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-15 20:25:04,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-15 20:25:04,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-09-15 20:25:04,032 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 25 [2024-09-15 20:25:04,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:25:04,033 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-09-15 20:25:04,033 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-15 20:25:04,033 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-09-15 20:25:04,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-15 20:25:04,034 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:25:04,034 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:25:04,034 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-15 20:25:04,034 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting idErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-15 20:25:04,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:25:04,035 INFO L85 PathProgramCache]: Analyzing trace with hash 106334531, now seen corresponding path program 1 times [2024-09-15 20:25:04,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:25:04,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157561162] [2024-09-15 20:25:04,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:25:04,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:25:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:25:04,124 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-15 20:25:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:25:04,172 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-15 20:25:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:25:04,194 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-15 20:25:04,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:25:04,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157561162] [2024-09-15 20:25:04,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157561162] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:25:04,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:25:04,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-15 20:25:04,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920916157] [2024-09-15 20:25:04,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:25:04,195 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-15 20:25:04,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:25:04,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-15 20:25:04,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-15 20:25:04,197 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-15 20:25:04,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:25:04,236 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2024-09-15 20:25:04,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-15 20:25:04,237 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-09-15 20:25:04,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:25:04,238 INFO L225 Difference]: With dead ends: 35 [2024-09-15 20:25:04,238 INFO L226 Difference]: Without dead ends: 35 [2024-09-15 20:25:04,238 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-15 20:25:04,239 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:25:04,239 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:25:04,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-15 20:25:04,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-09-15 20:25:04,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-15 20:25:04,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-09-15 20:25:04,248 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 25 [2024-09-15 20:25:04,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:25:04,248 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-09-15 20:25:04,249 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-15 20:25:04,249 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-09-15 20:25:04,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-15 20:25:04,249 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:25:04,249 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:25:04,249 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-15 20:25:04,250 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting idErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-15 20:25:04,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:25:04,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1119410942, now seen corresponding path program 1 times [2024-09-15 20:25:04,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:25:04,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449495493] [2024-09-15 20:25:04,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:25:04,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:25:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:25:04,329 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-15 20:25:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:25:04,370 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-15 20:25:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:25:04,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-15 20:25:04,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:25:04,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449495493] [2024-09-15 20:25:04,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449495493] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 20:25:04,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500790794] [2024-09-15 20:25:04,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:25:04,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 20:25:04,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 20:25:04,394 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-15 20:25:04,395 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-15 20:25:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:25:04,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-15 20:25:04,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 20:25:04,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-15 20:25:04,483 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 20:25:04,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-15 20:25:04,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500790794] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-15 20:25:04,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-15 20:25:04,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8, 8] total 10 [2024-09-15 20:25:04,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461213153] [2024-09-15 20:25:04,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:25:04,528 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-15 20:25:04,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:25:04,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-15 20:25:04,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-09-15 20:25:04,529 INFO L87 Difference]: Start difference. First operand 35 states and 39 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-15 20:25:04,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:25:04,539 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2024-09-15 20:25:04,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-15 20:25:04,541 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-09-15 20:25:04,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:25:04,541 INFO L225 Difference]: With dead ends: 34 [2024-09-15 20:25:04,542 INFO L226 Difference]: Without dead ends: 34 [2024-09-15 20:25:04,542 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-09-15 20:25:04,542 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:25:04,542 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:25:04,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-15 20:25:04,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-09-15 20:25:04,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-15 20:25:04,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-09-15 20:25:04,548 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 19 [2024-09-15 20:25:04,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:25:04,548 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-09-15 20:25:04,548 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-15 20:25:04,549 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-09-15 20:25:04,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-15 20:25:04,549 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:25:04,549 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:25:04,565 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-15 20:25:04,749 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 20:25:04,750 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-15 20:25:04,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:25:04,750 INFO L85 PathProgramCache]: Analyzing trace with hash 884822851, now seen corresponding path program 1 times [2024-09-15 20:25:04,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:25:04,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174262438] [2024-09-15 20:25:04,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:25:04,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:25:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:25:04,824 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-15 20:25:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:25:04,886 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-15 20:25:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:25:04,926 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-15 20:25:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:25:04,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-15 20:25:04,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:25:04,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174262438] [2024-09-15 20:25:04,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174262438] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 20:25:04,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445737880] [2024-09-15 20:25:04,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:25:04,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 20:25:04,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 20:25:04,948 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-15 20:25:04,949 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-15 20:25:04,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:25:04,981 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-15 20:25:04,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 20:25:05,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-15 20:25:05,022 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 20:25:05,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-15 20:25:05,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445737880] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-15 20:25:05,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-15 20:25:05,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 11] total 15 [2024-09-15 20:25:05,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593742775] [2024-09-15 20:25:05,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:25:05,122 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 20:25:05,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:25:05,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 20:25:05,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-09-15 20:25:05,123 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-15 20:25:05,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:25:05,138 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-09-15 20:25:05,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 20:25:05,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2024-09-15 20:25:05,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:25:05,138 INFO L225 Difference]: With dead ends: 32 [2024-09-15 20:25:05,138 INFO L226 Difference]: Without dead ends: 0 [2024-09-15 20:25:05,139 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-09-15 20:25:05,139 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:25:05,139 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:25:05,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-15 20:25:05,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-15 20:25:05,140 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-15 20:25:05,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-15 20:25:05,140 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2024-09-15 20:25:05,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:25:05,140 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-15 20:25:05,140 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-15 20:25:05,140 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-15 20:25:05,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-15 20:25:05,144 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-09-15 20:25:05,145 INFO L785 garLoopResultBuilder]: Registering result SAFE for location idErr0ENSURES_VIOLATIONPOST_CONDITION (0 of 2 remaining) [2024-09-15 20:25:05,158 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-15 20:25:05,348 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 20:25:05,351 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:25:05,353 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-15 20:25:05,355 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 08:25:05 BoogieIcfgContainer [2024-09-15 20:25:05,355 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-15 20:25:05,355 INFO L158 Benchmark]: Toolchain (without parser) took 3108.34ms. Allocated memory was 65.0MB in the beginning and 109.1MB in the end (delta: 44.0MB). Free memory was 41.4MB in the beginning and 37.0MB in the end (delta: 4.3MB). Peak memory consumption was 51.6MB. Max. memory is 16.1GB. [2024-09-15 20:25:05,355 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 65.0MB. Free memory was 42.0MB in the beginning and 41.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 20:25:05,356 INFO L158 Benchmark]: Witness Parser took 0.08ms. Allocated memory is still 65.0MB. Free memory is still 43.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 20:25:05,356 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.44ms. Allocated memory is still 65.0MB. Free memory was 41.2MB in the beginning and 28.4MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-15 20:25:05,356 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.99ms. Allocated memory was 65.0MB in the beginning and 90.2MB in the end (delta: 25.2MB). Free memory was 28.4MB in the beginning and 70.1MB in the end (delta: -41.7MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-09-15 20:25:05,356 INFO L158 Benchmark]: Boogie Preprocessor took 43.19ms. Allocated memory is still 90.2MB. Free memory was 70.1MB in the beginning and 68.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-15 20:25:05,356 INFO L158 Benchmark]: RCFGBuilder took 245.31ms. Allocated memory is still 90.2MB. Free memory was 68.5MB in the beginning and 57.5MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-15 20:25:05,357 INFO L158 Benchmark]: TraceAbstraction took 2562.31ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 57.1MB in the beginning and 37.0MB in the end (delta: 20.0MB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. [2024-09-15 20:25:05,358 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 65.0MB. Free memory was 42.0MB in the beginning and 41.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.08ms. Allocated memory is still 65.0MB. Free memory is still 43.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.44ms. Allocated memory is still 65.0MB. Free memory was 41.2MB in the beginning and 28.4MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.99ms. Allocated memory was 65.0MB in the beginning and 90.2MB in the end (delta: 25.2MB). Free memory was 28.4MB in the beginning and 70.1MB in the end (delta: -41.7MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.19ms. Allocated memory is still 90.2MB. Free memory was 70.1MB in the beginning and 68.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 245.31ms. Allocated memory is still 90.2MB. Free memory was 68.5MB in the beginning and 57.5MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2562.31ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 57.1MB in the beginning and 37.0MB in the end (delta: 20.0MB). Peak memory consumption was 42.3MB. 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: 27]: 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: 9]: 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, 23 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 794 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 598 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 191 IncrementalHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 196 mSDtfsCounter, 191 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=7, InterpolantAutomatonStates: 48, 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, 9 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 188 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 431 SizeOfPredicates, 0 NumberOfNonLiveVariables, 131 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 37/43 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 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-09-15 20:25:05,378 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE