./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound1.i --full-output --witness-type correctness_witness --validate ../results/automizer-verification-files/SV-COMP24_unreach-call/divbin_valuebound1.yml/witness-2.1.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReachWitnessValidation.xml -i ../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound1.i ../results/automizer-verification-files/SV-COMP24_unreach-call/divbin_valuebound1.yml/witness-2.1.yml -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-13 05:32:56,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 05:32:56,764 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 05:32:56,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 05:32:56,770 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 05:32:56,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 05:32:56,804 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 05:32:56,805 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 05:32:56,805 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 05:32:56,806 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 05:32:56,806 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 05:32:56,807 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 05:32:56,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 05:32:56,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 05:32:56,810 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 05:32:56,810 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 05:32:56,810 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 05:32:56,811 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 05:32:56,811 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 05:32:56,811 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 05:32:56,811 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 05:32:56,815 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 05:32:56,815 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 05:32:56,815 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 05:32:56,816 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 05:32:56,816 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 05:32:56,816 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 05:32:56,816 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 05:32:56,817 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 05:32:56,817 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 05:32:56,817 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 05:32:56,817 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 05:32:56,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 05:32:56,818 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 05:32:56,818 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 05:32:56,818 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 05:32:56,818 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 05:32:56,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 05:32:56,819 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 05:32:56,819 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 05:32:56,819 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 05:32:56,820 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 05:32:56,821 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None [2024-09-13 05:32:57,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 05:32:57,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 05:32:57,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 05:32:57,068 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-13 05:32:57,068 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-13 05:32:57,069 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/divbin_valuebound1.yml/witness-2.1.yml [2024-09-13 05:32:57,156 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 05:32:57,157 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 05:32:57,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound1.i [2024-09-13 05:32:58,541 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 05:32:58,708 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 05:32:58,709 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound1.i [2024-09-13 05:32:58,715 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/d132b537b/1a3bf9b11bdb49a4936f1506073bead4/FLAG60f99f61d [2024-09-13 05:32:58,741 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/d132b537b/1a3bf9b11bdb49a4936f1506073bead4 [2024-09-13 05:32:58,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 05:32:58,743 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-13 05:32:58,744 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 05:32:58,745 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 05:32:58,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 05:32:58,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 05:32:57" (1/2) ... [2024-09-13 05:32:58,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36076df8 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:32:58, skipping insertion in model container [2024-09-13 05:32:58,751 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 05:32:57" (1/2) ... [2024-09-13 05:32:58,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3f0f338 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.09 05:32:58, skipping insertion in model container [2024-09-13 05:32:58,753 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 05:32:58" (2/2) ... [2024-09-13 05:32:58,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36076df8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:32:58, skipping insertion in model container [2024-09-13 05:32:58,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 05:32:58" (2/2) ... [2024-09-13 05:32:58,762 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-13 05:32:58,763 INFO L1541 ArrayList]: Loop invariant at [L41-L50] (((((((((B % 4294967296) == 1) && (b == 1)) && ((r % 4294967296) <= 0)) && ((r % 4294967296) == (A % 4294967296))) && (q == 0)) || (((((((B % 4294967296) == 1) && ((r % 4294967296) == (A % 4294967296))) && (0 <= ((2 * ((((-2147483648 * (b / 4294967296)) + (b / 2)) + ((long long) -1 * B)) / 4294967296)) + (b / 4294967296)))) && ((A % 4294967296) <= 1)) && (b <= ((long long) B * 2))) && (q == 0))) || ((((((B % 4294967296) == 1) && (b == 1)) && ((r % 4294967296) <= 0)) && ((A % 4294967296) == (((long long) r + 1) % 4294967296))) && (q == 1))) || (((((b + ((B / 4294967296) * 4294967296)) == (B + ((b / 4294967296) * 4294967296))) && ((B / 4294967296) <= (b / 4294967296))) && (((A / 4294967296) + (b / 4294967296)) <= ((r / 4294967296) + (B / 4294967296)))) && ((A % 4294967296) == ((r + ((unsigned long long) b * q)) % 4294967296)))) [2024-09-13 05:32:58,763 INFO L1541 ArrayList]: Loop invariant at [L37-L40] ((((((((B % 4294967296) == 1) && ((r % 4294967296) == (A % 4294967296))) && (0 <= ((2 * ((((-2147483648 * (b / 4294967296)) + (b / 2)) + ((long long) -1 * B)) / 4294967296)) + (b / 4294967296)))) && ((A % 4294967296) <= 1)) && (b <= ((long long) B * 2))) && (q == 0)) || (((((((B % 4294967296) == 1) && ((r % 4294967296) == (A % 4294967296))) && (((A / 4294967296) + (b / 4294967296)) <= ((r / 4294967296) + (B / 4294967296)))) && ((A % 4294967296) <= 1)) && (B == b)) && (q == 0))) [2024-09-13 05:32:58,763 INFO L1541 ArrayList]: Function contract at [L15]: requires null, ensures (\old(cond) != 0) [2024-09-13 05:32:58,763 INFO L1541 ArrayList]: Function contract at [L18]: requires (1 <= \old(cond)), ensures (1 <= \old(cond)) [2024-09-13 05:32:58,795 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 05:32:58,934 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound1.i[950,963] [2024-09-13 05:32:58,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 05:32:58,966 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global Start Parsing Global [2024-09-13 05:32:58,999 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound1.i[950,963] Start Parsing Local Start Parsing Local [2024-09-13 05:32:59,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 05:32:59,048 INFO L204 MainTranslator]: Completed translation [2024-09-13 05:32:59,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:32:59 WrapperNode [2024-09-13 05:32:59,049 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 05:32:59,050 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 05:32:59,050 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 05:32:59,050 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 05:32:59,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:32:59" (1/1) ... [2024-09-13 05:32:59,064 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:32:59" (1/1) ... [2024-09-13 05:32:59,101 INFO L138 Inliner]: procedures = 16, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 48 [2024-09-13 05:32:59,102 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 05:32:59,102 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 05:32:59,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 05:32:59,103 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 05:32:59,111 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:32:59" (1/1) ... [2024-09-13 05:32:59,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:32:59" (1/1) ... [2024-09-13 05:32:59,114 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:32:59" (1/1) ... [2024-09-13 05:32:59,121 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Procedure assume_abort_if_not is not part of the Ultimate memory model but has specification other that is not a ModifiesSpecification [2024-09-13 05:32:59,121 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:32:59" (1/1) ... [2024-09-13 05:32:59,121 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:32:59" (1/1) ... [2024-09-13 05:32:59,132 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:32:59" (1/1) ... [2024-09-13 05:32:59,135 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:32:59" (1/1) ... [2024-09-13 05:32:59,137 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:32:59" (1/1) ... [2024-09-13 05:32:59,143 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:32:59" (1/1) ... [2024-09-13 05:32:59,150 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 05:32:59,151 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 05:32:59,151 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 05:32:59,151 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 05:32:59,152 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:32:59" (1/1) ... [2024-09-13 05:32:59,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 05:32:59,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:32:59,190 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-13 05:32:59,193 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-13 05:32:59,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 05:32:59,239 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 05:32:59,239 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 05:32:59,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-13 05:32:59,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 05:32:59,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 05:32:59,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 05:32:59,240 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 05:32:59,302 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 05:32:59,304 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 05:32:59,685 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-13 05:32:59,711 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-09-13 05:32:59,712 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 05:32:59,735 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 05:32:59,736 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-13 05:32:59,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 05:32:59 BoogieIcfgContainer [2024-09-13 05:32:59,737 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 05:32:59,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 05:32:59,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 05:32:59,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 05:32:59,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.09 05:32:57" (1/4) ... [2024-09-13 05:32:59,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f7d0231 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.09 05:32:59, skipping insertion in model container [2024-09-13 05:32:59,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 05:32:58" (2/4) ... [2024-09-13 05:32:59,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f7d0231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 05:32:59, skipping insertion in model container [2024-09-13 05:32:59,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 05:32:59" (3/4) ... [2024-09-13 05:32:59,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f7d0231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 05:32:59, skipping insertion in model container [2024-09-13 05:32:59,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 05:32:59" (4/4) ... [2024-09-13 05:32:59,745 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin_valuebound1.i [2024-09-13 05:32:59,761 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 05:32:59,761 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-09-13 05:32:59,806 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 05:32:59,815 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;@5650eb1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 05:32:59,815 INFO L337 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-09-13 05:32:59,820 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 20 states have (on average 1.7) internal successors, (34), 25 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-13 05:32:59,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-13 05:32:59,828 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:32:59,829 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-13 05:32:59,829 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 4 more)] === [2024-09-13 05:32:59,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:32:59,835 INFO L85 PathProgramCache]: Analyzing trace with hash 118866251, now seen corresponding path program 1 times [2024-09-13 05:32:59,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:32:59,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513164780] [2024-09-13 05:32:59,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:32:59,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:32:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:00,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 05:33:00,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:33:00,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513164780] [2024-09-13 05:33:00,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513164780] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:33:00,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:33:00,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:33:00,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287146502] [2024-09-13 05:33:00,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:33:00,056 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 05:33:00,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:33:00,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 05:33:00,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 05:33:00,118 INFO L87 Difference]: Start difference. First operand has 34 states, 20 states have (on average 1.7) internal successors, (34), 25 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:33:00,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:33:00,191 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2024-09-13 05:33:00,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 05:33:00,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-09-13 05:33:00,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:33:00,200 INFO L225 Difference]: With dead ends: 33 [2024-09-13 05:33:00,200 INFO L226 Difference]: Without dead ends: 31 [2024-09-13 05:33:00,202 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 05:33:00,206 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:33:00,208 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 80 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 05:33:00,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-13 05:33:00,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-13 05:33:00,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.368421052631579) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 05:33:00,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-09-13 05:33:00,239 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 5 [2024-09-13 05:33:00,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:33:00,240 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-09-13 05:33:00,240 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:33:00,240 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-09-13 05:33:00,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-13 05:33:00,241 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:33:00,242 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:33:00,242 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 05:33:00,242 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 4 more)] === [2024-09-13 05:33:00,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:33:00,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1837307530, now seen corresponding path program 1 times [2024-09-13 05:33:00,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:33:00,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019013620] [2024-09-13 05:33:00,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:33:00,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:33:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:01,488 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:33:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:01,524 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:33:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:01,547 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:33:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:01,558 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-13 05:33:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:01,578 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-13 05:33:01,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:33:01,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019013620] [2024-09-13 05:33:01,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019013620] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:33:01,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864904236] [2024-09-13 05:33:01,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:33:01,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:33:01,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:33:01,582 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:33:01,584 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-13 05:33:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:01,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-13 05:33:01,653 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:33:01,829 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-13 05:33:01,829 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:33:02,231 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-13 05:33:02,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864904236] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:33:02,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 05:33:02,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-09-13 05:33:02,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070305011] [2024-09-13 05:33:02,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 05:33:02,235 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-13 05:33:02,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:33:02,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-13 05:33:02,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-09-13 05:33:02,239 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-13 05:33:02,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:33:02,489 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2024-09-13 05:33:02,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-13 05:33:02,490 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 24 [2024-09-13 05:33:02,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:33:02,491 INFO L225 Difference]: With dead ends: 40 [2024-09-13 05:33:02,491 INFO L226 Difference]: Without dead ends: 40 [2024-09-13 05:33:02,492 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-09-13 05:33:02,493 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 48 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 05:33:02,494 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 87 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 05:33:02,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-09-13 05:33:02,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-09-13 05:33:02,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.32) internal successors, (33), 29 states have internal predecessors, (33), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-13 05:33:02,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2024-09-13 05:33:02,499 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 24 [2024-09-13 05:33:02,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:33:02,501 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-09-13 05:33:02,501 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-13 05:33:02,501 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2024-09-13 05:33:02,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-13 05:33:02,502 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:33:02,502 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:33:02,519 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-13 05:33:02,706 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:33:02,707 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 4 more)] === [2024-09-13 05:33:02,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:33:02,707 INFO L85 PathProgramCache]: Analyzing trace with hash -165357202, now seen corresponding path program 1 times [2024-09-13 05:33:02,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:33:02,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387010736] [2024-09-13 05:33:02,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:33:02,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:33:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:04,317 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:33:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:04,322 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:33:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:04,326 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:33:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:04,330 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-13 05:33:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:04,335 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 05:33:04,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:33:04,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387010736] [2024-09-13 05:33:04,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387010736] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:33:04,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066810522] [2024-09-13 05:33:04,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:33:04,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:33:04,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:33:04,340 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:33:04,346 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-13 05:33:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:33:04,425 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-13 05:33:04,428 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:33:04,635 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 05:33:04,636 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:33:05,327 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 05:33:05,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066810522] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:33:05,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 05:33:05,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-09-13 05:33:05,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632309853] [2024-09-13 05:33:05,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 05:33:05,329 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-13 05:33:05,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:33:05,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-13 05:33:05,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-09-13 05:33:05,331 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 05:33:09,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:33:13,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:33:17,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:33:21,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:33:25,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:33:29,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:33:33,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:33:37,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:33:41,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:33:45,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 05:33:49,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 05:33:53,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 05:33:57,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 05:34:01,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 05:34:05,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 05:34:09,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:34:13,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:34:17,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:34:21,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:34:25,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:34:29,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:34:33,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:34:37,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:34:41,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:34:45,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 05:34:49,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 05:34:53,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 05:34:57,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 05:35:01,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-13 05:35:01,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:35:01,591 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2024-09-13 05:35:01,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 05:35:01,592 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 27 [2024-09-13 05:35:01,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:35:01,593 INFO L225 Difference]: With dead ends: 51 [2024-09-13 05:35:01,593 INFO L226 Difference]: Without dead ends: 51 [2024-09-13 05:35:01,593 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-09-13 05:35:01,594 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 25 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 18 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 116.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 116.2s IncrementalHoareTripleChecker+Time [2024-09-13 05:35:01,594 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 133 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 96 Invalid, 28 Unknown, 0 Unchecked, 116.2s Time] [2024-09-13 05:35:01,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-13 05:35:01,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2024-09-13 05:35:01,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 35 states have internal predecessors, (42), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 05:35:01,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2024-09-13 05:35:01,601 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 59 transitions. Word has length 27 [2024-09-13 05:35:01,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:35:01,601 INFO L474 AbstractCegarLoop]: Abstraction has 46 states and 59 transitions. [2024-09-13 05:35:01,601 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 05:35:01,602 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2024-09-13 05:35:01,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-13 05:35:01,602 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:35:01,602 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:35:01,622 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-13 05:35:01,806 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:35:01,807 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 4 more)] === [2024-09-13 05:35:01,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:35:01,807 INFO L85 PathProgramCache]: Analyzing trace with hash 8600811, now seen corresponding path program 1 times [2024-09-13 05:35:01,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:35:01,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890980610] [2024-09-13 05:35:01,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:35:01,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:35:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:01,940 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:35:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:01,944 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:35:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:01,946 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:35:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:01,953 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-13 05:35:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:01,955 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 05:35:01,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:35:01,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890980610] [2024-09-13 05:35:01,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890980610] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:35:01,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:35:01,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:35:01,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828417349] [2024-09-13 05:35:01,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:35:01,959 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:35:01,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:35:01,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:35:01,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:35:01,960 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 05:35:01,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:35:01,973 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2024-09-13 05:35:01,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:35:01,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2024-09-13 05:35:01,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:35:01,976 INFO L225 Difference]: With dead ends: 44 [2024-09-13 05:35:01,978 INFO L226 Difference]: Without dead ends: 44 [2024-09-13 05:35:01,978 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:35:01,979 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:35:01,979 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:35:01,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-09-13 05:35:01,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-09-13 05:35:01,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 05:35:01,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2024-09-13 05:35:01,986 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 57 transitions. Word has length 32 [2024-09-13 05:35:01,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:35:01,986 INFO L474 AbstractCegarLoop]: Abstraction has 44 states and 57 transitions. [2024-09-13 05:35:01,988 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 05:35:01,988 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2024-09-13 05:35:01,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-13 05:35:01,989 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:35:01,989 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:35:01,990 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-13 05:35:01,990 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 4 more)] === [2024-09-13 05:35:01,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:35:01,990 INFO L85 PathProgramCache]: Analyzing trace with hash 8600972, now seen corresponding path program 1 times [2024-09-13 05:35:01,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:35:01,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536931513] [2024-09-13 05:35:01,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:35:01,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:35:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:02,028 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:35:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:02,031 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:35:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:02,033 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:35:02,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:02,036 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-13 05:35:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:02,040 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 05:35:02,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:35:02,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536931513] [2024-09-13 05:35:02,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536931513] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:35:02,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:35:02,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 05:35:02,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059248900] [2024-09-13 05:35:02,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:35:02,044 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 05:35:02,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:35:02,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 05:35:02,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:35:02,045 INFO L87 Difference]: Start difference. First operand 44 states and 57 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 05:35:02,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:35:02,087 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2024-09-13 05:35:02,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 05:35:02,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2024-09-13 05:35:02,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:35:02,089 INFO L225 Difference]: With dead ends: 43 [2024-09-13 05:35:02,089 INFO L226 Difference]: Without dead ends: 43 [2024-09-13 05:35:02,089 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 05:35:02,090 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 05:35:02,090 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 55 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 05:35:02,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-13 05:35:02,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-09-13 05:35:02,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 05:35:02,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2024-09-13 05:35:02,102 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 32 [2024-09-13 05:35:02,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:35:02,103 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2024-09-13 05:35:02,103 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 05:35:02,103 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2024-09-13 05:35:02,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-13 05:35:02,104 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:35:02,104 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:35:02,104 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-13 05:35:02,104 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 4 more)] === [2024-09-13 05:35:02,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:35:02,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1249567789, now seen corresponding path program 1 times [2024-09-13 05:35:02,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:35:02,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714436532] [2024-09-13 05:35:02,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:35:02,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:35:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 05:35:02,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [570733233] [2024-09-13 05:35:02,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:35:02,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:35:02,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:35:02,156 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:35:02,157 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-13 05:35:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:02,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-13 05:35:02,220 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:35:02,386 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-13 05:35:02,387 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 05:35:02,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:35:02,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714436532] [2024-09-13 05:35:02,388 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 05:35:02,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570733233] [2024-09-13 05:35:02,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570733233] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 05:35:02,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 05:35:02,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 05:35:02,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3731390] [2024-09-13 05:35:02,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:35:02,389 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 05:35:02,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:35:02,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 05:35:02,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 05:35:02,390 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 05:35:02,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:35:02,455 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2024-09-13 05:35:02,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 05:35:02,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2024-09-13 05:35:02,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:35:02,456 INFO L225 Difference]: With dead ends: 44 [2024-09-13 05:35:02,456 INFO L226 Difference]: Without dead ends: 39 [2024-09-13 05:35:02,457 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-13 05:35:02,457 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 05:35:02,458 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 59 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 05:35:02,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-09-13 05:35:02,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2024-09-13 05:35:02,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-13 05:35:02,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-09-13 05:35:02,461 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 32 [2024-09-13 05:35:02,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:35:02,462 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-09-13 05:35:02,462 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 05:35:02,462 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-09-13 05:35:02,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-13 05:35:02,463 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:35:02,463 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:35:02,482 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-13 05:35:02,663 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-13 05:35:02,664 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 4 more)] === [2024-09-13 05:35:02,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:35:02,664 INFO L85 PathProgramCache]: Analyzing trace with hash -308984639, now seen corresponding path program 1 times [2024-09-13 05:35:02,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:35:02,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156139123] [2024-09-13 05:35:02,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:35:02,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:35:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:05,474 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-13 05:35:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:05,477 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-13 05:35:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:05,478 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-13 05:35:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:05,480 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-13 05:35:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:05,482 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-13 05:35:05,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:05,500 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 05:35:05,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:35:05,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156139123] [2024-09-13 05:35:05,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156139123] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 05:35:05,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272893670] [2024-09-13 05:35:05,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:35:05,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:35:05,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:35:05,503 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:35:05,505 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-13 05:35:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:35:05,616 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-13 05:35:05,619 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:35:06,086 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-09-13 05:35:06,086 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:35:11,507 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-09-13 05:35:11,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272893670] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-13 05:35:11,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-13 05:35:11,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 6] total 16 [2024-09-13 05:35:11,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113190967] [2024-09-13 05:35:11,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 05:35:11,509 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 05:35:11,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:35:11,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 05:35:11,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=195, Unknown=1, NotChecked=0, Total=272 [2024-09-13 05:35:11,510 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-13 05:35:31,865 WARN L293 SmtUtils]: Spent 20.10s on a formula simplification. DAG size of input: 35 DAG size of output: 34 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 05:35:36,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:35:40,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:35:44,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:35:48,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:35:52,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:35:56,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:36:00,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:36:04,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:36:08,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:36:09,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 05:36:09,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:36:09,863 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2024-09-13 05:36:09,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 05:36:09,864 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2024-09-13 05:36:09,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:36:09,865 INFO L225 Difference]: With dead ends: 34 [2024-09-13 05:36:09,865 INFO L226 Difference]: Without dead ends: 34 [2024-09-13 05:36:09,865 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=99, Invalid=242, Unknown=1, NotChecked=0, Total=342 [2024-09-13 05:36:09,865 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 12 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.8s IncrementalHoareTripleChecker+Time [2024-09-13 05:36:09,866 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 56 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 9 Unknown, 0 Unchecked, 37.8s Time] [2024-09-13 05:36:09,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-13 05:36:09,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-09-13 05:36:09,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-13 05:36:09,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-09-13 05:36:09,869 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 39 [2024-09-13 05:36:09,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:36:09,870 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-09-13 05:36:09,870 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-13 05:36:09,870 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-09-13 05:36:09,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-13 05:36:09,871 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 05:36:09,871 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:36:09,885 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-13 05:36:10,071 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:36:10,072 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 4 more)] === [2024-09-13 05:36:10,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 05:36:10,072 INFO L85 PathProgramCache]: Analyzing trace with hash -581492508, now seen corresponding path program 1 times [2024-09-13 05:36:10,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 05:36:10,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110509438] [2024-09-13 05:36:10,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:36:10,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 05:36:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 05:36:10,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [675201000] [2024-09-13 05:36:10,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 05:36:10,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 05:36:10,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 05:36:10,142 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 05:36:10,149 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-13 05:36:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 05:36:10,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-13 05:36:10,270 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 05:36:10,619 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-09-13 05:36:10,620 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 05:36:36,927 WARN L293 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:36:52,953 WARN L293 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 05:36:57,021 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-09-13 05:36:57,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 05:36:57,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110509438] [2024-09-13 05:36:57,021 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 05:36:57,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675201000] [2024-09-13 05:36:57,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675201000] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 05:36:57,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 05:36:57,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-09-13 05:36:57,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174894132] [2024-09-13 05:36:57,021 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 05:36:57,022 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-13 05:36:57,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 05:36:57,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-13 05:36:57,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-09-13 05:36:57,023 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-13 05:36:57,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 05:36:57,421 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2024-09-13 05:36:57,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-13 05:36:57,422 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2024-09-13 05:36:57,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 05:36:57,422 INFO L225 Difference]: With dead ends: 35 [2024-09-13 05:36:57,422 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 05:36:57,423 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2024-09-13 05:36:57,423 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 9 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-13 05:36:57,423 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 78 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-13 05:36:57,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 05:36:57,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 05:36:57,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 05:36:57,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 05:36:57,424 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2024-09-13 05:36:57,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 05:36:57,425 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 05:36:57,425 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-13 05:36:57,425 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 05:36:57,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 05:36:57,427 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 7 remaining) [2024-09-13 05:36:57,428 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 7 remaining) [2024-09-13 05:36:57,428 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (4 of 7 remaining) [2024-09-13 05:36:57,428 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONPRE_CONDITION (3 of 7 remaining) [2024-09-13 05:36:57,428 INFO L785 garLoopResultBuilder]: Registering result SAFE for location assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION (2 of 7 remaining) [2024-09-13 05:36:57,428 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2024-09-13 05:36:57,429 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION (0 of 7 remaining) [2024-09-13 05:36:57,437 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-13 05:36:57,632 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-13 05:36:57,636 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 05:36:57,638 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 05:36:57,640 INFO L469 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-09-13 05:36:57,640 INFO L470 ceAbstractionStarter]: WitnessConsidered=2 [2024-09-13 05:36:57,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 05:36:57 BoogieIcfgContainer [2024-09-13 05:36:57,641 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 05:36:57,642 INFO L158 Benchmark]: Toolchain (without parser) took 238899.13ms. Allocated memory was 121.6MB in the beginning and 299.9MB in the end (delta: 178.3MB). Free memory was 93.6MB in the beginning and 227.3MB in the end (delta: -133.7MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. [2024-09-13 05:36:57,642 INFO L158 Benchmark]: Witness Parser took 0.18ms. Allocated memory is still 121.6MB. Free memory is still 70.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 05:36:57,642 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 121.6MB. Free memory is still 94.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 05:36:57,643 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.65ms. Allocated memory was 121.6MB in the beginning and 172.0MB in the end (delta: 50.3MB). Free memory was 93.4MB in the beginning and 132.3MB in the end (delta: -38.9MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-09-13 05:36:57,643 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.34ms. Allocated memory is still 172.0MB. Free memory was 132.3MB in the beginning and 128.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-13 05:36:57,643 INFO L158 Benchmark]: Boogie Preprocessor took 47.73ms. Allocated memory is still 172.0MB. Free memory was 128.1MB in the beginning and 125.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 05:36:57,644 INFO L158 Benchmark]: RCFGBuilder took 586.41ms. Allocated memory is still 172.0MB. Free memory was 125.0MB in the beginning and 89.3MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-09-13 05:36:57,644 INFO L158 Benchmark]: TraceAbstraction took 237902.76ms. Allocated memory was 172.0MB in the beginning and 299.9MB in the end (delta: 127.9MB). Free memory was 89.3MB in the beginning and 227.3MB in the end (delta: -137.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 05:36:57,646 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.18ms. Allocated memory is still 121.6MB. Free memory is still 70.8MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.15ms. Allocated memory is still 121.6MB. Free memory is still 94.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.65ms. Allocated memory was 121.6MB in the beginning and 172.0MB in the end (delta: 50.3MB). Free memory was 93.4MB in the beginning and 132.3MB in the end (delta: -38.9MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.34ms. Allocated memory is still 172.0MB. Free memory was 132.3MB in the beginning and 128.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.73ms. Allocated memory is still 172.0MB. Free memory was 128.1MB in the beginning and 125.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 586.41ms. Allocated memory is still 172.0MB. Free memory was 125.0MB in the beginning and 89.3MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 237902.76ms. Allocated memory was 172.0MB in the beginning and 299.9MB in the end (delta: 127.9MB). Free memory was 89.3MB in the beginning and 227.3MB in the end (delta: -137.9MB). There was no memory consumed. 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: 37]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 41]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 18]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 18]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 15]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - PositiveResult [Line: 21]: 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: 18]: 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, 34 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 237.9s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 175.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 37 mSolverCounterUnknown, 105 SdHoareTripleChecker+Valid, 154.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 610 SdHoareTripleChecker+Invalid, 154.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 408 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 420 IncrementalHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 202 mSDtfsCounter, 420 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 366 GetRequests, 301 SyntacticMatches, 8 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 32.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=3, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 60.0s InterpolantComputationTime, 395 NumberOfCodeBlocks, 395 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 438 ConstructedInterpolants, 0 QuantifiedInterpolants, 4053 SizeOfPredicates, 14 NumberOfNonLiveVariables, 387 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 331/366 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 7 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-09-13 05:36:57,807 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE