/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options enumeration-timeout=5000 --traceabstraction.additional.smt.options interpolation-heuristic=WIDESTAMONGSMALL --traceabstraction.additional.smt.options tolerance=0.4 --traceabstraction.additional.smt.options log-additional-information=true -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-177f698 [2020-08-21 23:47:45,226 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-21 23:47:45,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-21 23:47:45,253 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-21 23:47:45,253 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-21 23:47:45,254 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-21 23:47:45,256 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-21 23:47:45,258 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-21 23:47:45,259 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-21 23:47:45,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-21 23:47:45,261 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-21 23:47:45,262 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-21 23:47:45,263 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-21 23:47:45,264 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-21 23:47:45,265 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-21 23:47:45,266 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-21 23:47:45,267 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-21 23:47:45,268 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-21 23:47:45,269 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-21 23:47:45,271 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-21 23:47:45,273 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-21 23:47:45,274 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-21 23:47:45,275 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-21 23:47:45,276 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-21 23:47:45,279 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-21 23:47:45,279 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-21 23:47:45,279 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-21 23:47:45,280 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-21 23:47:45,281 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-21 23:47:45,281 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-21 23:47:45,282 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-21 23:47:45,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-21 23:47:45,283 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-21 23:47:45,284 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-21 23:47:45,285 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-21 23:47:45,285 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-21 23:47:45,286 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-21 23:47:45,286 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-21 23:47:45,286 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-21 23:47:45,287 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-21 23:47:45,288 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-21 23:47:45,289 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-21 23:47:45,312 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-21 23:47:45,312 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-21 23:47:45,313 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-21 23:47:45,314 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-21 23:47:45,314 INFO L138 SettingsManager]: * Use SBE=true [2020-08-21 23:47:45,314 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-21 23:47:45,314 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-21 23:47:45,314 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-21 23:47:45,315 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-21 23:47:45,315 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-21 23:47:45,315 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-21 23:47:45,315 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-21 23:47:45,315 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-21 23:47:45,315 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-21 23:47:45,316 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-21 23:47:45,316 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-21 23:47:45,316 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-21 23:47:45,316 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-21 23:47:45,316 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-21 23:47:45,317 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-21 23:47:45,317 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-21 23:47:45,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-21 23:47:45,317 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-21 23:47:45,317 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-21 23:47:45,318 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-21 23:47:45,318 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-21 23:47:45,318 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-21 23:47:45,318 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-21 23:47:45,318 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-21 23:47:45,318 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.4;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.4;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.4;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.4;log-additional-information=true; [2020-08-21 23:47:45,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-21 23:47:45,646 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-21 23:47:45,650 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-21 23:47:45,651 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-21 23:47:45,652 INFO L275 PluginConnector]: CDTParser initialized [2020-08-21 23:47:45,653 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2020-08-21 23:47:45,715 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9e0991659/35562692c6e648caa390e550849894a1/FLAG6e02cad03 [2020-08-21 23:47:46,210 INFO L306 CDTParser]: Found 1 translation units. [2020-08-21 23:47:46,214 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2020-08-21 23:47:46,228 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9e0991659/35562692c6e648caa390e550849894a1/FLAG6e02cad03 [2020-08-21 23:47:46,603 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9e0991659/35562692c6e648caa390e550849894a1 [2020-08-21 23:47:46,612 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-21 23:47:46,614 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-21 23:47:46,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-21 23:47:46,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-21 23:47:46,622 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-21 23:47:46,624 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 11:47:46" (1/1) ... [2020-08-21 23:47:46,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cc3fb97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:47:46, skipping insertion in model container [2020-08-21 23:47:46,628 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 11:47:46" (1/1) ... [2020-08-21 23:47:46,639 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-21 23:47:46,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-21 23:47:46,992 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 23:47:47,002 INFO L203 MainTranslator]: Completed pre-run [2020-08-21 23:47:47,167 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-21 23:47:47,186 INFO L208 MainTranslator]: Completed translation [2020-08-21 23:47:47,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:47:47 WrapperNode [2020-08-21 23:47:47,187 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-21 23:47:47,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-21 23:47:47,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-21 23:47:47,188 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-21 23:47:47,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:47:47" (1/1) ... [2020-08-21 23:47:47,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:47:47" (1/1) ... [2020-08-21 23:47:47,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:47:47" (1/1) ... [2020-08-21 23:47:47,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:47:47" (1/1) ... [2020-08-21 23:47:47,222 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:47:47" (1/1) ... [2020-08-21 23:47:47,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:47:47" (1/1) ... [2020-08-21 23:47:47,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:47:47" (1/1) ... [2020-08-21 23:47:47,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-21 23:47:47,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-21 23:47:47,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-21 23:47:47,239 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-21 23:47:47,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:47:47" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-21 23:47:47,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-21 23:47:47,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-21 23:47:47,302 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2020-08-21 23:47:47,303 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2020-08-21 23:47:47,303 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2020-08-21 23:47:47,303 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-21 23:47:47,303 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2020-08-21 23:47:47,304 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2020-08-21 23:47:47,304 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2020-08-21 23:47:47,304 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2020-08-21 23:47:47,304 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2020-08-21 23:47:47,305 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2020-08-21 23:47:47,305 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2020-08-21 23:47:47,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-21 23:47:47,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-08-21 23:47:47,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-21 23:47:47,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2020-08-21 23:47:47,307 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2020-08-21 23:47:47,307 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2020-08-21 23:47:47,307 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2020-08-21 23:47:47,308 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2020-08-21 23:47:47,308 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2020-08-21 23:47:47,308 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2020-08-21 23:47:47,308 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2020-08-21 23:47:47,308 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2020-08-21 23:47:47,309 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2020-08-21 23:47:47,310 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-21 23:47:47,311 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2020-08-21 23:47:47,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-21 23:47:47,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-21 23:47:47,602 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-08-21 23:47:47,749 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2020-08-21 23:47:47,749 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2020-08-21 23:47:47,751 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-08-21 23:47:47,796 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2020-08-21 23:47:47,797 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2020-08-21 23:47:47,811 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-08-21 23:47:47,836 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2020-08-21 23:47:47,836 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2020-08-21 23:47:47,850 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-08-21 23:47:47,984 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2020-08-21 23:47:47,984 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2020-08-21 23:47:48,002 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-21 23:47:48,003 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-21 23:47:48,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 11:47:48 BoogieIcfgContainer [2020-08-21 23:47:48,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-21 23:47:48,015 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-21 23:47:48,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-21 23:47:48,019 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-21 23:47:48,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.08 11:47:46" (1/3) ... [2020-08-21 23:47:48,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5964e902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 11:47:48, skipping insertion in model container [2020-08-21 23:47:48,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 11:47:47" (2/3) ... [2020-08-21 23:47:48,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5964e902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 11:47:48, skipping insertion in model container [2020-08-21 23:47:48,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 11:47:48" (3/3) ... [2020-08-21 23:47:48,025 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2020-08-21 23:47:48,037 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-21 23:47:48,052 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-21 23:47:48,068 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-21 23:47:48,104 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-21 23:47:48,104 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-21 23:47:48,104 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-21 23:47:48,104 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-21 23:47:48,105 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-21 23:47:48,105 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-21 23:47:48,105 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-21 23:47:48,105 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-21 23:47:48,137 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2020-08-21 23:47:48,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-08-21 23:47:48,147 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:47:48,148 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 23:47:48,148 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:47:48,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:47:48,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1530382191, now seen corresponding path program 1 times [2020-08-21 23:47:48,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:47:48,166 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1391665003] [2020-08-21 23:47:48,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:47:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:48,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:47:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:48,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 23:47:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:48,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 23:47:48,603 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1391665003] [2020-08-21 23:47:48,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 23:47:48,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-21 23:47:48,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258435168] [2020-08-21 23:47:48,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-21 23:47:48,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:47:48,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-21 23:47:48,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-21 23:47:48,629 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 5 states. [2020-08-21 23:47:49,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:47:49,347 INFO L93 Difference]: Finished difference Result 303 states and 463 transitions. [2020-08-21 23:47:49,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-08-21 23:47:49,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-08-21 23:47:49,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:47:49,368 INFO L225 Difference]: With dead ends: 303 [2020-08-21 23:47:49,368 INFO L226 Difference]: Without dead ends: 157 [2020-08-21 23:47:49,375 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-08-21 23:47:49,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-08-21 23:47:49,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 140. [2020-08-21 23:47:49,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-08-21 23:47:49,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2020-08-21 23:47:49,455 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 20 [2020-08-21 23:47:49,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:47:49,456 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2020-08-21 23:47:49,456 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-21 23:47:49,456 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2020-08-21 23:47:49,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-21 23:47:49,458 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:47:49,458 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 23:47:49,458 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-21 23:47:49,458 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:47:49,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:47:49,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1141575010, now seen corresponding path program 1 times [2020-08-21 23:47:49,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:47:49,460 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [39181701] [2020-08-21 23:47:49,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:47:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:49,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:47:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:49,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 23:47:49,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:49,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 23:47:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:49,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 23:47:49,810 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [39181701] [2020-08-21 23:47:49,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 23:47:49,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-08-21 23:47:49,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453889785] [2020-08-21 23:47:49,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-21 23:47:49,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:47:49,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-21 23:47:49,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-08-21 23:47:49,820 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand 6 states. [2020-08-21 23:47:50,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:47:50,624 INFO L93 Difference]: Finished difference Result 275 states and 370 transitions. [2020-08-21 23:47:50,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 23:47:50,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-21 23:47:50,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:47:50,629 INFO L225 Difference]: With dead ends: 275 [2020-08-21 23:47:50,630 INFO L226 Difference]: Without dead ends: 219 [2020-08-21 23:47:50,631 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-08-21 23:47:50,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-08-21 23:47:50,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 195. [2020-08-21 23:47:50,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-08-21 23:47:50,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 259 transitions. [2020-08-21 23:47:50,662 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 259 transitions. Word has length 26 [2020-08-21 23:47:50,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:47:50,663 INFO L479 AbstractCegarLoop]: Abstraction has 195 states and 259 transitions. [2020-08-21 23:47:50,663 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-21 23:47:50,663 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 259 transitions. [2020-08-21 23:47:50,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-21 23:47:50,664 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:47:50,664 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 23:47:50,664 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-21 23:47:50,665 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:47:50,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:47:50,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1029098174, now seen corresponding path program 1 times [2020-08-21 23:47:50,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:47:50,666 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1425229436] [2020-08-21 23:47:50,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:47:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:50,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:47:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:50,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 23:47:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:50,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 23:47:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:50,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 23:47:50,889 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1425229436] [2020-08-21 23:47:50,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 23:47:50,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-08-21 23:47:50,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343027643] [2020-08-21 23:47:50,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-21 23:47:50,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:47:50,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-21 23:47:50,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-08-21 23:47:50,891 INFO L87 Difference]: Start difference. First operand 195 states and 259 transitions. Second operand 6 states. [2020-08-21 23:47:51,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:47:51,294 INFO L93 Difference]: Finished difference Result 316 states and 413 transitions. [2020-08-21 23:47:51,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 23:47:51,294 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-21 23:47:51,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:47:51,298 INFO L225 Difference]: With dead ends: 316 [2020-08-21 23:47:51,299 INFO L226 Difference]: Without dead ends: 254 [2020-08-21 23:47:51,302 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-08-21 23:47:51,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2020-08-21 23:47:51,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 217. [2020-08-21 23:47:51,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-08-21 23:47:51,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 289 transitions. [2020-08-21 23:47:51,363 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 289 transitions. Word has length 27 [2020-08-21 23:47:51,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:47:51,364 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 289 transitions. [2020-08-21 23:47:51,364 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-21 23:47:51,364 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 289 transitions. [2020-08-21 23:47:51,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-08-21 23:47:51,369 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:47:51,369 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 23:47:51,369 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-21 23:47:51,370 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:47:51,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:47:51,370 INFO L82 PathProgramCache]: Analyzing trace with hash 742933031, now seen corresponding path program 1 times [2020-08-21 23:47:51,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:47:51,371 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2038418418] [2020-08-21 23:47:51,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:47:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:51,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:47:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:51,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 23:47:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:51,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 23:47:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:51,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 23:47:51,569 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2038418418] [2020-08-21 23:47:51,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 23:47:51,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-08-21 23:47:51,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37179409] [2020-08-21 23:47:51,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-21 23:47:51,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:47:51,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-21 23:47:51,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-08-21 23:47:51,571 INFO L87 Difference]: Start difference. First operand 217 states and 289 transitions. Second operand 6 states. [2020-08-21 23:47:52,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:47:52,143 INFO L93 Difference]: Finished difference Result 220 states and 291 transitions. [2020-08-21 23:47:52,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-21 23:47:52,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2020-08-21 23:47:52,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:47:52,146 INFO L225 Difference]: With dead ends: 220 [2020-08-21 23:47:52,146 INFO L226 Difference]: Without dead ends: 217 [2020-08-21 23:47:52,147 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-08-21 23:47:52,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-08-21 23:47:52,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2020-08-21 23:47:52,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-08-21 23:47:52,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 288 transitions. [2020-08-21 23:47:52,168 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 288 transitions. Word has length 37 [2020-08-21 23:47:52,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:47:52,169 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 288 transitions. [2020-08-21 23:47:52,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-21 23:47:52,169 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2020-08-21 23:47:52,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-08-21 23:47:52,172 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:47:52,172 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 23:47:52,172 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-21 23:47:52,172 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:47:52,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:47:52,173 INFO L82 PathProgramCache]: Analyzing trace with hash 324263340, now seen corresponding path program 1 times [2020-08-21 23:47:52,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:47:52,173 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [587023844] [2020-08-21 23:47:52,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:47:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:52,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:47:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:52,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 23:47:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:52,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 23:47:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:52,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-21 23:47:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:52,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 23:47:52,345 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [587023844] [2020-08-21 23:47:52,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 23:47:52,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-21 23:47:52,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575893881] [2020-08-21 23:47:52,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-21 23:47:52,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:47:52,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-21 23:47:52,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-21 23:47:52,348 INFO L87 Difference]: Start difference. First operand 217 states and 288 transitions. Second operand 8 states. [2020-08-21 23:47:53,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:47:53,085 INFO L93 Difference]: Finished difference Result 274 states and 356 transitions. [2020-08-21 23:47:53,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-21 23:47:53,093 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-08-21 23:47:53,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:47:53,096 INFO L225 Difference]: With dead ends: 274 [2020-08-21 23:47:53,097 INFO L226 Difference]: Without dead ends: 208 [2020-08-21 23:47:53,098 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-08-21 23:47:53,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-08-21 23:47:53,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 190. [2020-08-21 23:47:53,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-08-21 23:47:53,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 250 transitions. [2020-08-21 23:47:53,127 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 250 transitions. Word has length 45 [2020-08-21 23:47:53,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:47:53,128 INFO L479 AbstractCegarLoop]: Abstraction has 190 states and 250 transitions. [2020-08-21 23:47:53,128 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-21 23:47:53,128 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 250 transitions. [2020-08-21 23:47:53,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-08-21 23:47:53,130 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:47:53,131 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 23:47:53,131 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-21 23:47:53,131 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:47:53,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:47:53,132 INFO L82 PathProgramCache]: Analyzing trace with hash 726030577, now seen corresponding path program 1 times [2020-08-21 23:47:53,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:47:53,132 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1244799319] [2020-08-21 23:47:53,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:47:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:53,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:47:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:53,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 23:47:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:53,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 23:47:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:53,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-21 23:47:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:53,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-21 23:47:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:53,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-21 23:47:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:53,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 23:47:53,357 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1244799319] [2020-08-21 23:47:53,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 23:47:53,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-21 23:47:53,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108802977] [2020-08-21 23:47:53,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-21 23:47:53,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:47:53,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-21 23:47:53,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-08-21 23:47:53,359 INFO L87 Difference]: Start difference. First operand 190 states and 250 transitions. Second operand 8 states. [2020-08-21 23:47:53,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:47:53,821 INFO L93 Difference]: Finished difference Result 258 states and 336 transitions. [2020-08-21 23:47:53,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-21 23:47:53,822 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-08-21 23:47:53,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:47:53,824 INFO L225 Difference]: With dead ends: 258 [2020-08-21 23:47:53,824 INFO L226 Difference]: Without dead ends: 197 [2020-08-21 23:47:53,825 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-08-21 23:47:53,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-08-21 23:47:53,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2020-08-21 23:47:53,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-08-21 23:47:53,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 246 transitions. [2020-08-21 23:47:53,841 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 246 transitions. Word has length 51 [2020-08-21 23:47:53,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:47:53,841 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 246 transitions. [2020-08-21 23:47:53,841 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-21 23:47:53,842 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 246 transitions. [2020-08-21 23:47:53,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-08-21 23:47:53,843 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:47:53,844 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 23:47:53,844 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-21 23:47:53,844 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:47:53,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:47:53,844 INFO L82 PathProgramCache]: Analyzing trace with hash 572107035, now seen corresponding path program 1 times [2020-08-21 23:47:53,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:47:53,845 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1039514521] [2020-08-21 23:47:53,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:47:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:53,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:47:53,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:53,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 23:47:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:54,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 23:47:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:54,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-21 23:47:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:54,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 23:47:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:54,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 23:47:54,078 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1039514521] [2020-08-21 23:47:54,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 23:47:54,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-21 23:47:54,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011698098] [2020-08-21 23:47:54,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-21 23:47:54,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:47:54,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-21 23:47:54,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-08-21 23:47:54,080 INFO L87 Difference]: Start difference. First operand 188 states and 246 transitions. Second operand 10 states. [2020-08-21 23:47:54,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:47:54,921 INFO L93 Difference]: Finished difference Result 243 states and 316 transitions. [2020-08-21 23:47:54,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-21 23:47:54,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2020-08-21 23:47:54,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:47:54,924 INFO L225 Difference]: With dead ends: 243 [2020-08-21 23:47:54,924 INFO L226 Difference]: Without dead ends: 238 [2020-08-21 23:47:54,927 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-08-21 23:47:54,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-08-21 23:47:54,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 205. [2020-08-21 23:47:54,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-08-21 23:47:54,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 267 transitions. [2020-08-21 23:47:54,954 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 267 transitions. Word has length 50 [2020-08-21 23:47:54,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:47:54,955 INFO L479 AbstractCegarLoop]: Abstraction has 205 states and 267 transitions. [2020-08-21 23:47:54,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-21 23:47:54,956 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 267 transitions. [2020-08-21 23:47:54,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-08-21 23:47:54,957 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:47:54,958 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 23:47:54,958 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-21 23:47:54,958 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:47:54,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:47:54,959 INFO L82 PathProgramCache]: Analyzing trace with hash 176400751, now seen corresponding path program 1 times [2020-08-21 23:47:54,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:47:54,959 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1929127311] [2020-08-21 23:47:54,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:47:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:55,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:47:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:55,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 23:47:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:55,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 23:47:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:55,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-21 23:47:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:55,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 23:47:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:55,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 23:47:55,300 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1929127311] [2020-08-21 23:47:55,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 23:47:55,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-08-21 23:47:55,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310648145] [2020-08-21 23:47:55,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-21 23:47:55,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:47:55,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-21 23:47:55,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2020-08-21 23:47:55,303 INFO L87 Difference]: Start difference. First operand 205 states and 267 transitions. Second operand 14 states. [2020-08-21 23:47:56,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:47:56,642 INFO L93 Difference]: Finished difference Result 246 states and 313 transitions. [2020-08-21 23:47:56,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-21 23:47:56,642 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 51 [2020-08-21 23:47:56,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:47:56,644 INFO L225 Difference]: With dead ends: 246 [2020-08-21 23:47:56,645 INFO L226 Difference]: Without dead ends: 222 [2020-08-21 23:47:56,645 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2020-08-21 23:47:56,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-08-21 23:47:56,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 188. [2020-08-21 23:47:56,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-08-21 23:47:56,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 244 transitions. [2020-08-21 23:47:56,662 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 244 transitions. Word has length 51 [2020-08-21 23:47:56,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:47:56,663 INFO L479 AbstractCegarLoop]: Abstraction has 188 states and 244 transitions. [2020-08-21 23:47:56,663 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-21 23:47:56,663 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 244 transitions. [2020-08-21 23:47:56,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-08-21 23:47:56,664 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:47:56,664 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 23:47:56,665 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-21 23:47:56,665 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:47:56,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:47:56,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1461171158, now seen corresponding path program 1 times [2020-08-21 23:47:56,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:47:56,666 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1563266922] [2020-08-21 23:47:56,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:47:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:56,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:47:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:56,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 23:47:56,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:56,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 23:47:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:56,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-21 23:47:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:56,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 23:47:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:56,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 23:47:56,851 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1563266922] [2020-08-21 23:47:56,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 23:47:56,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-21 23:47:56,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311975205] [2020-08-21 23:47:56,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-21 23:47:56,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:47:56,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-21 23:47:56,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-08-21 23:47:56,853 INFO L87 Difference]: Start difference. First operand 188 states and 244 transitions. Second operand 8 states. [2020-08-21 23:47:57,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:47:57,076 INFO L93 Difference]: Finished difference Result 203 states and 262 transitions. [2020-08-21 23:47:57,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-21 23:47:57,077 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-08-21 23:47:57,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:47:57,079 INFO L225 Difference]: With dead ends: 203 [2020-08-21 23:47:57,079 INFO L226 Difference]: Without dead ends: 91 [2020-08-21 23:47:57,080 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-08-21 23:47:57,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-08-21 23:47:57,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-08-21 23:47:57,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-08-21 23:47:57,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2020-08-21 23:47:57,094 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 52 [2020-08-21 23:47:57,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:47:57,094 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2020-08-21 23:47:57,094 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-21 23:47:57,095 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2020-08-21 23:47:57,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-08-21 23:47:57,095 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:47:57,096 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 23:47:57,096 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-21 23:47:57,096 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:47:57,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:47:57,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1516710605, now seen corresponding path program 1 times [2020-08-21 23:47:57,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:47:57,097 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [276414990] [2020-08-21 23:47:57,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:47:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:57,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:47:57,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:57,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 23:47:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:57,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 23:47:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:57,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-21 23:47:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:57,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-21 23:47:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:57,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-21 23:47:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:57,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 23:47:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:57,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 23:47:57,320 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [276414990] [2020-08-21 23:47:57,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 23:47:57,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-08-21 23:47:57,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581254599] [2020-08-21 23:47:57,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-21 23:47:57,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:47:57,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-21 23:47:57,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-08-21 23:47:57,322 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 11 states. [2020-08-21 23:47:57,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:47:57,798 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2020-08-21 23:47:57,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-21 23:47:57,799 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2020-08-21 23:47:57,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:47:57,800 INFO L225 Difference]: With dead ends: 119 [2020-08-21 23:47:57,800 INFO L226 Difference]: Without dead ends: 91 [2020-08-21 23:47:57,802 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2020-08-21 23:47:57,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-08-21 23:47:57,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-08-21 23:47:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-08-21 23:47:57,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2020-08-21 23:47:57,820 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 59 [2020-08-21 23:47:57,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:47:57,820 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2020-08-21 23:47:57,820 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-21 23:47:57,821 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2020-08-21 23:47:57,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-08-21 23:47:57,822 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:47:57,822 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 23:47:57,822 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-21 23:47:57,822 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:47:57,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:47:57,823 INFO L82 PathProgramCache]: Analyzing trace with hash -14076392, now seen corresponding path program 1 times [2020-08-21 23:47:57,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:47:57,823 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1095174168] [2020-08-21 23:47:57,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:47:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:57,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:47:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:57,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 23:47:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:58,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 23:47:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:58,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-21 23:47:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:58,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-21 23:47:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:58,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-21 23:47:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:58,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 23:47:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:58,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 23:47:58,070 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1095174168] [2020-08-21 23:47:58,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 23:47:58,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-21 23:47:58,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058321666] [2020-08-21 23:47:58,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-21 23:47:58,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:47:58,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-21 23:47:58,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-08-21 23:47:58,073 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand 9 states. [2020-08-21 23:47:58,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:47:58,265 INFO L93 Difference]: Finished difference Result 122 states and 138 transitions. [2020-08-21 23:47:58,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-21 23:47:58,266 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-08-21 23:47:58,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:47:58,267 INFO L225 Difference]: With dead ends: 122 [2020-08-21 23:47:58,267 INFO L226 Difference]: Without dead ends: 94 [2020-08-21 23:47:58,268 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-08-21 23:47:58,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-08-21 23:47:58,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-08-21 23:47:58,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-08-21 23:47:58,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2020-08-21 23:47:58,278 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 61 [2020-08-21 23:47:58,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:47:58,279 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2020-08-21 23:47:58,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-21 23:47:58,279 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2020-08-21 23:47:58,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-08-21 23:47:58,280 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:47:58,280 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 23:47:58,280 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-21 23:47:58,281 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:47:58,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:47:58,281 INFO L82 PathProgramCache]: Analyzing trace with hash -600882406, now seen corresponding path program 1 times [2020-08-21 23:47:58,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:47:58,282 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1002023470] [2020-08-21 23:47:58,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:47:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:58,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:47:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:58,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 23:47:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:58,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 23:47:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:58,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-21 23:47:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:58,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-21 23:47:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:58,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-21 23:47:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:58,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 23:47:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:58,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 23:47:58,518 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1002023470] [2020-08-21 23:47:58,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 23:47:58,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-21 23:47:58,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239502258] [2020-08-21 23:47:58,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-21 23:47:58,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:47:58,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-21 23:47:58,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-08-21 23:47:58,520 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 12 states. [2020-08-21 23:47:58,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:47:58,843 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2020-08-21 23:47:58,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-21 23:47:58,844 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2020-08-21 23:47:58,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:47:58,846 INFO L225 Difference]: With dead ends: 112 [2020-08-21 23:47:58,847 INFO L226 Difference]: Without dead ends: 93 [2020-08-21 23:47:58,848 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-08-21 23:47:58,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-21 23:47:58,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2020-08-21 23:47:58,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-08-21 23:47:58,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2020-08-21 23:47:58,857 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 61 [2020-08-21 23:47:58,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:47:58,858 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2020-08-21 23:47:58,858 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-21 23:47:58,858 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2020-08-21 23:47:58,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-08-21 23:47:58,859 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:47:58,859 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 23:47:58,859 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-21 23:47:58,864 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:47:58,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:47:58,865 INFO L82 PathProgramCache]: Analyzing trace with hash -673462309, now seen corresponding path program 1 times [2020-08-21 23:47:58,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:47:58,865 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1646468146] [2020-08-21 23:47:58,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:47:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:58,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:47:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:58,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 23:47:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:59,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 23:47:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:59,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-21 23:47:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:59,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-21 23:47:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:59,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-21 23:47:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:59,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 23:47:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:59,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 23:47:59,051 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1646468146] [2020-08-21 23:47:59,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 23:47:59,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-21 23:47:59,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753941580] [2020-08-21 23:47:59,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-21 23:47:59,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:47:59,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-21 23:47:59,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-08-21 23:47:59,053 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 9 states. [2020-08-21 23:47:59,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:47:59,269 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2020-08-21 23:47:59,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-21 23:47:59,269 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2020-08-21 23:47:59,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:47:59,273 INFO L225 Difference]: With dead ends: 105 [2020-08-21 23:47:59,273 INFO L226 Difference]: Without dead ends: 100 [2020-08-21 23:47:59,274 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-08-21 23:47:59,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-08-21 23:47:59,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2020-08-21 23:47:59,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-08-21 23:47:59,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2020-08-21 23:47:59,284 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 62 [2020-08-21 23:47:59,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:47:59,285 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2020-08-21 23:47:59,285 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-21 23:47:59,285 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2020-08-21 23:47:59,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-08-21 23:47:59,285 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:47:59,286 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 23:47:59,286 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-21 23:47:59,286 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:47:59,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:47:59,286 INFO L82 PathProgramCache]: Analyzing trace with hash 475938380, now seen corresponding path program 1 times [2020-08-21 23:47:59,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:47:59,287 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [209757527] [2020-08-21 23:47:59,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:47:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:59,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:47:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:59,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 23:47:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:59,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 23:47:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:59,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-21 23:47:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:59,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-21 23:47:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:59,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-21 23:47:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:59,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 23:47:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:59,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 23:47:59,503 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [209757527] [2020-08-21 23:47:59,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 23:47:59,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-21 23:47:59,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043380211] [2020-08-21 23:47:59,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-21 23:47:59,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:47:59,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-21 23:47:59,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-08-21 23:47:59,506 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 12 states. [2020-08-21 23:47:59,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:47:59,810 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2020-08-21 23:47:59,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-21 23:47:59,810 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2020-08-21 23:47:59,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:47:59,811 INFO L225 Difference]: With dead ends: 98 [2020-08-21 23:47:59,811 INFO L226 Difference]: Without dead ends: 91 [2020-08-21 23:47:59,812 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-08-21 23:47:59,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-08-21 23:47:59,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-08-21 23:47:59,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-08-21 23:47:59,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2020-08-21 23:47:59,822 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 62 [2020-08-21 23:47:59,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:47:59,822 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2020-08-21 23:47:59,822 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-21 23:47:59,822 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2020-08-21 23:47:59,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-08-21 23:47:59,823 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:47:59,823 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 23:47:59,823 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-08-21 23:47:59,824 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:47:59,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:47:59,824 INFO L82 PathProgramCache]: Analyzing trace with hash 359859562, now seen corresponding path program 1 times [2020-08-21 23:47:59,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:47:59,824 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [920024543] [2020-08-21 23:47:59,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:47:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:59,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:47:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:59,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 23:47:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:59,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 23:47:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:47:59,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-21 23:48:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:48:00,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-21 23:48:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:48:00,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-21 23:48:00,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:48:00,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 23:48:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:48: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. [2020-08-21 23:48:00,049 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [920024543] [2020-08-21 23:48:00,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 23:48:00,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-21 23:48:00,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808005873] [2020-08-21 23:48:00,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-21 23:48:00,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:48:00,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-21 23:48:00,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-08-21 23:48:00,051 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand 10 states. [2020-08-21 23:48:00,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:48:00,382 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2020-08-21 23:48:00,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-21 23:48:00,383 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-08-21 23:48:00,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:48:00,384 INFO L225 Difference]: With dead ends: 107 [2020-08-21 23:48:00,384 INFO L226 Difference]: Without dead ends: 76 [2020-08-21 23:48:00,385 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2020-08-21 23:48:00,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-08-21 23:48:00,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2020-08-21 23:48:00,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-08-21 23:48:00,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2020-08-21 23:48:00,397 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 63 [2020-08-21 23:48:00,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:48:00,398 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2020-08-21 23:48:00,398 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-21 23:48:00,398 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2020-08-21 23:48:00,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-08-21 23:48:00,399 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:48:00,399 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 23:48:00,400 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-08-21 23:48:00,400 INFO L427 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:48:00,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:48:00,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1228040100, now seen corresponding path program 1 times [2020-08-21 23:48:00,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:48:00,401 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1443812569] [2020-08-21 23:48:00,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:48:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:48:00,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:48:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:48:00,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 23:48:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:48:00,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 23:48:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:48:00,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-21 23:48:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:48:00,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-21 23:48:00,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:48:00,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-21 23:48:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:48:00,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 23:48:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:48:00,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 23:48:00,678 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1443812569] [2020-08-21 23:48:00,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 23:48:00,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-21 23:48:00,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885239166] [2020-08-21 23:48:00,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-21 23:48:00,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:48:00,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-21 23:48:00,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-08-21 23:48:00,680 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 9 states. [2020-08-21 23:48:01,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:48:01,095 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2020-08-21 23:48:01,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-21 23:48:01,096 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2020-08-21 23:48:01,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:48:01,098 INFO L225 Difference]: With dead ends: 141 [2020-08-21 23:48:01,098 INFO L226 Difference]: Without dead ends: 134 [2020-08-21 23:48:01,098 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2020-08-21 23:48:01,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-08-21 23:48:01,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2020-08-21 23:48:01,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-08-21 23:48:01,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2020-08-21 23:48:01,121 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 63 [2020-08-21 23:48:01,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:48:01,121 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2020-08-21 23:48:01,122 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-21 23:48:01,122 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2020-08-21 23:48:01,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-08-21 23:48:01,123 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:48:01,124 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 23:48:01,124 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-08-21 23:48:01,124 INFO L427 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:48:01,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:48:01,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1291919834, now seen corresponding path program 1 times [2020-08-21 23:48:01,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:48:01,125 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [945371725] [2020-08-21 23:48:01,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:48:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:48:01,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:48:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:48:01,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 23:48:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:48:01,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 23:48:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:48:01,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-21 23:48:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:48:01,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-21 23:48:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:48:01,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-21 23:48:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:48:01,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 23:48:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:48:01,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 23:48:01,397 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [945371725] [2020-08-21 23:48:01,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 23:48:01,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-21 23:48:01,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760980518] [2020-08-21 23:48:01,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-21 23:48:01,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:48:01,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-21 23:48:01,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-08-21 23:48:01,399 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 12 states. [2020-08-21 23:48:01,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:48:01,666 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2020-08-21 23:48:01,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-21 23:48:01,666 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2020-08-21 23:48:01,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:48:01,668 INFO L225 Difference]: With dead ends: 144 [2020-08-21 23:48:01,668 INFO L226 Difference]: Without dead ends: 133 [2020-08-21 23:48:01,668 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-08-21 23:48:01,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-08-21 23:48:01,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2020-08-21 23:48:01,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-08-21 23:48:01,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2020-08-21 23:48:01,683 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 63 [2020-08-21 23:48:01,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:48:01,683 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2020-08-21 23:48:01,684 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-21 23:48:01,684 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2020-08-21 23:48:01,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-08-21 23:48:01,685 INFO L414 BasicCegarLoop]: Found error trace [2020-08-21 23:48:01,685 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-21 23:48:01,685 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-08-21 23:48:01,685 INFO L427 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-21 23:48:01,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-21 23:48:01,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1154361885, now seen corresponding path program 1 times [2020-08-21 23:48:01,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-21 23:48:01,686 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [696152428] [2020-08-21 23:48:01,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-21 23:48:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:48:01,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-21 23:48:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:48:01,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-21 23:48:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:48:01,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 23:48:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:48:01,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-08-21 23:48:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:48:01,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-21 23:48:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:48:01,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-21 23:48:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:48:01,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-21 23:48:01,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:48:01,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-08-21 23:48:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-21 23:48:01,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-21 23:48:01,905 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [696152428] [2020-08-21 23:48:01,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-21 23:48:01,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-08-21 23:48:01,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149516857] [2020-08-21 23:48:01,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-21 23:48:01,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-21 23:48:01,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-21 23:48:01,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-08-21 23:48:01,914 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand 11 states. [2020-08-21 23:48:02,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-21 23:48:02,141 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2020-08-21 23:48:02,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-21 23:48:02,142 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2020-08-21 23:48:02,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-21 23:48:02,142 INFO L225 Difference]: With dead ends: 133 [2020-08-21 23:48:02,143 INFO L226 Difference]: Without dead ends: 0 [2020-08-21 23:48:02,144 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-08-21 23:48:02,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-08-21 23:48:02,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-08-21 23:48:02,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-08-21 23:48:02,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-08-21 23:48:02,146 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2020-08-21 23:48:02,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-21 23:48:02,146 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-08-21 23:48:02,147 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-21 23:48:02,147 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-08-21 23:48:02,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-08-21 23:48:02,147 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-08-21 23:48:02,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-08-21 23:48:03,072 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2020-08-21 23:48:03,247 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2020-08-21 23:48:03,576 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 48 [2020-08-21 23:48:03,683 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 27 [2020-08-21 23:48:03,926 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 60 [2020-08-21 23:48:04,130 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2020-08-21 23:48:04,382 WARN L193 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2020-08-21 23:48:04,582 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-08-21 23:48:04,878 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 50 [2020-08-21 23:48:05,236 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 38 [2020-08-21 23:48:05,418 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 51 [2020-08-21 23:48:05,651 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 53 [2020-08-21 23:48:05,834 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2020-08-21 23:48:05,975 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-08-21 23:48:06,371 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2020-08-21 23:48:06,553 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 50 [2020-08-21 23:48:06,693 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2020-08-21 23:48:06,857 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2020-08-21 23:48:06,980 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2020-08-21 23:48:07,228 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 48 [2020-08-21 23:48:07,403 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2020-08-21 23:48:07,666 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2020-08-21 23:48:07,961 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 53 [2020-08-21 23:48:08,150 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2020-08-21 23:48:08,537 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-08-21 23:48:08,587 INFO L264 CegarLoopResult]: At program point KeSetEventENTRY(lines 513 520) the Hoare annotation is: (or (not (<= (+ ~s~0 2) ~SKIP1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 1 ~NP~0)) (not (= ~s~0 ~NP~0))) [2020-08-21 23:48:08,588 INFO L268 CegarLoopResult]: For program point KeSetEventFINAL(lines 513 520) no Hoare annotation was computed. [2020-08-21 23:48:08,588 INFO L268 CegarLoopResult]: For program point KeSetEventEXIT(lines 513 520) no Hoare annotation was computed. [2020-08-21 23:48:08,588 INFO L264 CegarLoopResult]: At program point KbFilter_CompleteENTRY(lines 563 573) the Hoare annotation is: (or (not (<= (+ ~s~0 2) ~SKIP1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 1 ~NP~0)) (not (= ~s~0 ~NP~0))) [2020-08-21 23:48:08,589 INFO L264 CegarLoopResult]: At program point L569(line 569) the Hoare annotation is: (or (not (<= (+ ~s~0 2) ~SKIP1~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 1 ~NP~0)) (not (= ~s~0 ~NP~0))) [2020-08-21 23:48:08,589 INFO L268 CegarLoopResult]: For program point L569-1(line 569) no Hoare annotation was computed. [2020-08-21 23:48:08,589 INFO L268 CegarLoopResult]: For program point KbFilter_CompleteFINAL(lines 563 573) no Hoare annotation was computed. [2020-08-21 23:48:08,590 INFO L268 CegarLoopResult]: For program point KbFilter_CompleteEXIT(lines 563 573) no Hoare annotation was computed. [2020-08-21 23:48:08,590 INFO L268 CegarLoopResult]: For program point stub_driver_initEXIT(lines 35 48) no Hoare annotation was computed. [2020-08-21 23:48:08,590 INFO L264 CegarLoopResult]: At program point stub_driver_initENTRY(lines 35 48) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~pended~0 |old(~pended~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0)) (not (<= |old(~pended~0)| 0))) [2020-08-21 23:48:08,590 INFO L268 CegarLoopResult]: For program point stub_driver_initFINAL(lines 35 48) no Hoare annotation was computed. [2020-08-21 23:48:08,590 INFO L268 CegarLoopResult]: For program point _BLAST_initFINAL(lines 49 70) no Hoare annotation was computed. [2020-08-21 23:48:08,591 INFO L264 CegarLoopResult]: At program point _BLAST_initENTRY(lines 49 70) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= ~MPR3~0 |old(~MPR3~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~IPC~0 |old(~IPC~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~DC~0 |old(~DC~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~pended~0 |old(~pended~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-21 23:48:08,591 INFO L268 CegarLoopResult]: For program point _BLAST_initEXIT(lines 49 70) no Hoare annotation was computed. [2020-08-21 23:48:08,591 INFO L271 CegarLoopResult]: At program point errorFnENTRY(lines 575 582) the Hoare annotation is: true [2020-08-21 23:48:08,591 INFO L268 CegarLoopResult]: For program point errorFnFINAL(lines 575 582) no Hoare annotation was computed. [2020-08-21 23:48:08,591 INFO L268 CegarLoopResult]: For program point errorFnEXIT(lines 575 582) no Hoare annotation was computed. [2020-08-21 23:48:08,591 INFO L268 CegarLoopResult]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2020-08-21 23:48:08,592 INFO L264 CegarLoopResult]: At program point L382(lines 375 415) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~pended~0 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-21 23:48:08,592 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 286 420) no Hoare annotation was computed. [2020-08-21 23:48:08,592 INFO L268 CegarLoopResult]: For program point L407(lines 407 409) no Hoare annotation was computed. [2020-08-21 23:48:08,592 INFO L264 CegarLoopResult]: At program point L374(lines 367 416) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~pended~0 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-21 23:48:08,592 INFO L268 CegarLoopResult]: For program point L383(lines 367 416) no Hoare annotation was computed. [2020-08-21 23:48:08,592 INFO L268 CegarLoopResult]: For program point L350(lines 350 365) no Hoare annotation was computed. [2020-08-21 23:48:08,592 INFO L268 CegarLoopResult]: For program point L384(lines 384 413) no Hoare annotation was computed. [2020-08-21 23:48:08,593 INFO L264 CegarLoopResult]: At program point L351(lines 350 365) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (<= ~NP~0 1) (<= 0 main_~status~1) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 1 ~NP~0) (<= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-21 23:48:08,593 INFO L268 CegarLoopResult]: For program point L376(lines 376 380) no Hoare annotation was computed. [2020-08-21 23:48:08,593 INFO L268 CegarLoopResult]: For program point L368(lines 368 372) no Hoare annotation was computed. [2020-08-21 23:48:08,593 INFO L268 CegarLoopResult]: For program point L335(lines 321 366) no Hoare annotation was computed. [2020-08-21 23:48:08,593 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 286 420) no Hoare annotation was computed. [2020-08-21 23:48:08,593 INFO L268 CegarLoopResult]: For program point L385(lines 385 412) no Hoare annotation was computed. [2020-08-21 23:48:08,594 INFO L264 CegarLoopResult]: At program point L319(line 319) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (and (= ~MPR3~0 ~s~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (<= ~IPC~0 ~s~0) (<= 0 main_~status~1) (= ~MPR1~0 ~NP~0) (<= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-21 23:48:08,594 INFO L268 CegarLoopResult]: For program point L319-1(lines 295 419) no Hoare annotation was computed. [2020-08-21 23:48:08,594 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 286 420) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~Executive~0)| ~Executive~0) (= ~MPR3~0 |old(~MPR3~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= ~IPC~0 |old(~IPC~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~DC~0 |old(~DC~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~pended~0 |old(~pended~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~SKIP1~0 ~s~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-21 23:48:08,594 INFO L268 CegarLoopResult]: For program point L402(lines 402 410) no Hoare annotation was computed. [2020-08-21 23:48:08,594 INFO L264 CegarLoopResult]: At program point L394(lines 385 412) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-21 23:48:08,594 INFO L268 CegarLoopResult]: For program point L386(lines 386 392) no Hoare annotation was computed. [2020-08-21 23:48:08,595 INFO L264 CegarLoopResult]: At program point L353(lines 352 365) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (<= 0 main_~status~1) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-21 23:48:08,595 INFO L268 CegarLoopResult]: For program point L403(lines 403 405) no Hoare annotation was computed. [2020-08-21 23:48:08,595 INFO L268 CegarLoopResult]: For program point L387(lines 387 389) no Hoare annotation was computed. [2020-08-21 23:48:08,595 INFO L264 CegarLoopResult]: At program point L321(lines 295 419) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= ~pended~0 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-21 23:48:08,595 INFO L268 CegarLoopResult]: For program point L338-1(lines 337 347) no Hoare annotation was computed. [2020-08-21 23:48:08,595 INFO L268 CegarLoopResult]: For program point L396(lines 396 400) no Hoare annotation was computed. [2020-08-21 23:48:08,595 INFO L268 CegarLoopResult]: For program point L330(lines 330 333) no Hoare annotation was computed. [2020-08-21 23:48:08,596 INFO L264 CegarLoopResult]: At program point L330-2(lines 330 333) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (<= ~NP~0 1) (<= 0 main_~status~1) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 1 ~NP~0) (<= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-21 23:48:08,596 INFO L264 CegarLoopResult]: At program point L398(line 398) the Hoare annotation is: (or (not (<= |old(~IPC~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~pended~0)| 0))) [2020-08-21 23:48:08,596 INFO L268 CegarLoopResult]: For program point L357(line 357) no Hoare annotation was computed. [2020-08-21 23:48:08,596 INFO L268 CegarLoopResult]: For program point L477(lines 477 494) no Hoare annotation was computed. [2020-08-21 23:48:08,596 INFO L264 CegarLoopResult]: At program point L444(line 444) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))) (or .cse0 .cse1 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))))) [2020-08-21 23:48:08,596 INFO L268 CegarLoopResult]: For program point L444-1(line 444) no Hoare annotation was computed. [2020-08-21 23:48:08,597 INFO L264 CegarLoopResult]: At program point L469(lines 442 497) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (let ((.cse2 (= ~MPR1~0 ~s~0))) (or (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (and .cse2 (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0)) (and (<= IofCallDriver_~returnVal2~0 0) .cse2) (not (<= 1 ~NP~0)))))) [2020-08-21 23:48:08,597 INFO L264 CegarLoopResult]: At program point L457(lines 456 471) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (or (not (<= 1 ~compRegistered~0)) (and (= ~MPR1~0 ~s~0) (= ~setEventCalled~0 1)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))))) [2020-08-21 23:48:08,597 INFO L268 CegarLoopResult]: For program point L486(lines 486 493) no Hoare annotation was computed. [2020-08-21 23:48:08,597 INFO L268 CegarLoopResult]: For program point L449(lines 449 472) no Hoare annotation was computed. [2020-08-21 23:48:08,597 INFO L268 CegarLoopResult]: For program point L478(lines 478 484) no Hoare annotation was computed. [2020-08-21 23:48:08,597 INFO L264 CegarLoopResult]: At program point L445(line 445) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0)) (and (= ~setEventCalled~0 1) (= ~s~0 |old(~s~0)|))) (or .cse0 .cse1 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))))) [2020-08-21 23:48:08,598 INFO L264 CegarLoopResult]: At program point IofCallDriverENTRY(lines 435 498) the Hoare annotation is: (let ((.cse2 (not (<= ~pended~0 0))) (.cse3 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse0 (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (.cse1 (= ~setEventCalled~0 |old(~setEventCalled~0)|))) (and (or (and .cse0 .cse1 (= ~s~0 ~NP~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse2 .cse3 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))) (or .cse2 .cse3 (and .cse0 .cse1 (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))))) [2020-08-21 23:48:08,598 INFO L264 CegarLoopResult]: At program point L491(line 491) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (or (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))))) [2020-08-21 23:48:08,598 INFO L268 CegarLoopResult]: For program point L491-1(lines 473 495) no Hoare annotation was computed. [2020-08-21 23:48:08,598 INFO L268 CegarLoopResult]: For program point L454(lines 454 471) no Hoare annotation was computed. [2020-08-21 23:48:08,598 INFO L264 CegarLoopResult]: At program point L450(lines 449 472) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (or (not (<= 1 ~compRegistered~0)) (= ~MPR1~0 ~s~0) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))))) [2020-08-21 23:48:08,598 INFO L268 CegarLoopResult]: For program point IofCallDriverFINAL(lines 435 498) no Hoare annotation was computed. [2020-08-21 23:48:08,598 INFO L268 CegarLoopResult]: For program point IofCallDriverEXIT(lines 435 498) no Hoare annotation was computed. [2020-08-21 23:48:08,599 INFO L264 CegarLoopResult]: At program point L455(lines 454 471) the Hoare annotation is: (let ((.cse0 (not (<= ~pended~0 0))) (.cse1 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (and (or .cse0 .cse1 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= ~compRegistered~0 0))) (or (not (<= 1 ~compRegistered~0)) (= ~MPR1~0 ~s~0) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))))) [2020-08-21 23:48:08,599 INFO L268 CegarLoopResult]: For program point L443(lines 443 446) no Hoare annotation was computed. [2020-08-21 23:48:08,599 INFO L268 CegarLoopResult]: For program point L443-1(lines 443 446) no Hoare annotation was computed. [2020-08-21 23:48:08,599 INFO L264 CegarLoopResult]: At program point L429(line 429) the Hoare annotation is: (or (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= ~setEventCalled~0 1)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))) [2020-08-21 23:48:08,599 INFO L268 CegarLoopResult]: For program point L429-1(lines 421 434) no Hoare annotation was computed. [2020-08-21 23:48:08,599 INFO L264 CegarLoopResult]: At program point stubMoreProcessingRequiredENTRY(lines 421 434) the Hoare annotation is: (or (not (<= 1 ~compRegistered~0)) (not (<= ~NP~0 1)) (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (= ~setEventCalled~0 1)) (= ~s~0 ~NP~0) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 1 ~NP~0))) [2020-08-21 23:48:08,599 INFO L268 CegarLoopResult]: For program point stubMoreProcessingRequiredEXIT(lines 421 434) no Hoare annotation was computed. [2020-08-21 23:48:08,600 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-08-21 23:48:08,600 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~compRegistered~0 |old(~compRegistered~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP2~0 |old(~SKIP2~0)|) (= ~NP~0 |old(~NP~0)|) (= ~MPR3~0 |old(~MPR3~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= ~s~0 |old(~s~0)|) (= ~SKIP1~0 |old(~SKIP1~0)|) (= ~IPC~0 |old(~IPC~0)|) (= ~DC~0 |old(~DC~0)|) (= ~pended~0 |old(~pended~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~customIrp~0 |old(~customIrp~0)|) (= ~UNLOADED~0 |old(~UNLOADED~0)|) (= ~Executive~0 |old(~Executive~0)|) (= ~myStatus~0 |old(~myStatus~0)|)) [2020-08-21 23:48:08,600 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-08-21 23:48:08,600 INFO L264 CegarLoopResult]: At program point L541(line 541) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~compRegistered~0))) (.cse1 (not (<= ~NP~0 1))) (.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= ~pended~0 0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~MPR3~0 |old(~s~0)|)) .cse6) (or .cse0 .cse1 .cse2 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse3 .cse4 .cse5 (not (= ~NP~0 |old(~s~0)|)) .cse6))) [2020-08-21 23:48:08,600 INFO L268 CegarLoopResult]: For program point L539(lines 539 543) no Hoare annotation was computed. [2020-08-21 23:48:08,600 INFO L268 CegarLoopResult]: For program point L539-1(lines 526 545) no Hoare annotation was computed. [2020-08-21 23:48:08,600 INFO L268 CegarLoopResult]: For program point KeWaitForSingleObjectEXIT(lines 521 562) no Hoare annotation was computed. [2020-08-21 23:48:08,601 INFO L268 CegarLoopResult]: For program point L527(lines 527 532) no Hoare annotation was computed. [2020-08-21 23:48:08,601 INFO L268 CegarLoopResult]: For program point L548(lines 548 560) no Hoare annotation was computed. [2020-08-21 23:48:08,601 INFO L268 CegarLoopResult]: For program point KeWaitForSingleObjectFINAL(lines 521 562) no Hoare annotation was computed. [2020-08-21 23:48:08,601 INFO L264 CegarLoopResult]: At program point L534(lines 526 545) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~compRegistered~0))) (.cse1 (not (<= ~NP~0 1))) (.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= ~pended~0 0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse3 .cse4 .cse5 (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0)) .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~MPR3~0 |old(~s~0)|)) .cse6))) [2020-08-21 23:48:08,601 INFO L268 CegarLoopResult]: For program point L526(lines 526 545) no Hoare annotation was computed. [2020-08-21 23:48:08,601 INFO L264 CegarLoopResult]: At program point L551(lines 550 560) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~compRegistered~0))) (.cse1 (not (<= ~NP~0 1))) (.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= ~pended~0 0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (= ~s~0 ~NP~0) .cse4 .cse5 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~MPR3~0 |old(~s~0)|)) .cse6) (or .cse0 .cse1 .cse2 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse3 .cse4 .cse5 (not (= ~NP~0 |old(~s~0)|)) (= ~s~0 |old(~s~0)|) .cse6))) [2020-08-21 23:48:08,602 INFO L264 CegarLoopResult]: At program point KeWaitForSingleObjectENTRY(lines 521 562) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~compRegistered~0))) (.cse1 (not (<= ~NP~0 1))) (.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= ~pended~0 0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (= ~setEventCalled~0 |old(~setEventCalled~0)|)) (.cse7 (= |old(~customIrp~0)| ~customIrp~0)) (.cse8 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and (= ~MPR3~0 ~s~0) .cse6 .cse7) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~MPR3~0 |old(~s~0)|)) .cse8) (or .cse0 .cse1 .cse2 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse3 .cse4 .cse5 (not (= ~NP~0 |old(~s~0)|)) (and .cse6 (= ~s~0 ~NP~0) .cse7) .cse8))) [2020-08-21 23:48:08,602 INFO L264 CegarLoopResult]: At program point L549(lines 548 560) the Hoare annotation is: (let ((.cse0 (not (<= 1 ~compRegistered~0))) (.cse1 (not (<= ~NP~0 1))) (.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= ~pended~0 0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse6 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (= ~s~0 ~NP~0) .cse4 .cse5 (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (= ~MPR3~0 |old(~s~0)|)) .cse6) (or .cse0 .cse1 .cse2 (not (<= (+ |old(~s~0)| 2) ~SKIP1~0)) .cse3 .cse4 .cse5 (not (= ~NP~0 |old(~s~0)|)) (= ~s~0 |old(~s~0)|) .cse6))) [2020-08-21 23:48:08,602 INFO L264 CegarLoopResult]: At program point L507(line 507) the Hoare annotation is: (or (not (<= 1 ~compRegistered~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0))) [2020-08-21 23:48:08,602 INFO L268 CegarLoopResult]: For program point L507-1(lines 499 512) no Hoare annotation was computed. [2020-08-21 23:48:08,602 INFO L264 CegarLoopResult]: At program point IofCompleteRequestENTRY(lines 499 512) the Hoare annotation is: (or (not (<= 1 ~compRegistered~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (= ~s~0 |old(~s~0)|)) [2020-08-21 23:48:08,602 INFO L268 CegarLoopResult]: For program point L503(lines 503 509) no Hoare annotation was computed. [2020-08-21 23:48:08,603 INFO L268 CegarLoopResult]: For program point IofCompleteRequestEXIT(lines 499 512) no Hoare annotation was computed. [2020-08-21 23:48:08,603 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-08-21 23:48:08,603 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= ~MPR3~0 ~s~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (<= ~IPC~0 ~s~0) (= ~MPR1~0 ~NP~0) (<= ~pended~0 0)) [2020-08-21 23:48:08,603 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-08-21 23:48:08,603 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-08-21 23:48:08,603 INFO L264 CegarLoopResult]: At program point L192(lines 192 194) the Hoare annotation is: (let ((.cse1 (<= 259 KbFilter_PnP_~status~0)) (.cse2 (= ~setEventCalled~0 1)) (.cse12 (<= 1 ~NP~0)) (.cse3 (<= 1 ~compRegistered~0)) (.cse13 (<= (+ ~NP~0 4) ~MPR1~0))) (let ((.cse0 (not (<= ~NP~0 1))) (.cse4 (not .cse13)) (.cse5 (not (<= ~pended~0 0))) (.cse6 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= ~NP~0 |old(~s~0)|))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse9 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse10 (and .cse1 .cse2 .cse13 (= ~s~0 |old(~s~0)|) .cse12 .cse3)) (.cse11 (not .cse12))) (and (or .cse0 (and (= ~MPR3~0 ~s~0) .cse1 .cse2 (= KbFilter_PnP_~__cil_tmp23~0 259) .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse4 .cse5 .cse6 .cse8 .cse7 .cse9 .cse10 .cse11 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) (<= (+ ~myStatus~0 1073741637) 0))))) [2020-08-21 23:48:08,603 INFO L268 CegarLoopResult]: For program point L192-1(lines 192 194) no Hoare annotation was computed. [2020-08-21 23:48:08,604 INFO L268 CegarLoopResult]: For program point L151(lines 151 265) no Hoare annotation was computed. [2020-08-21 23:48:08,604 INFO L268 CegarLoopResult]: For program point L118(lines 118 276) no Hoare annotation was computed. [2020-08-21 23:48:08,604 INFO L264 CegarLoopResult]: At program point L209(line 209) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (not (<= 1 ~NP~0))) [2020-08-21 23:48:08,604 INFO L264 CegarLoopResult]: At program point L176(line 176) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-21 23:48:08,604 INFO L264 CegarLoopResult]: At program point L234(line 234) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-21 23:48:08,604 INFO L268 CegarLoopResult]: For program point L234-1(lines 230 236) no Hoare annotation was computed. [2020-08-21 23:48:08,604 INFO L268 CegarLoopResult]: For program point L160(lines 160 262) no Hoare annotation was computed. [2020-08-21 23:48:08,604 INFO L268 CegarLoopResult]: For program point L127(lines 127 273) no Hoare annotation was computed. [2020-08-21 23:48:08,605 INFO L264 CegarLoopResult]: At program point L218(line 218) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-21 23:48:08,605 INFO L264 CegarLoopResult]: At program point L185(lines 185 186) the Hoare annotation is: (let ((.cse0 (not (<= ~NP~0 1))) (.cse1 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse2 (not (<= ~pended~0 0))) (.cse3 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse4 (not (= |old(~compRegistered~0)| 0))) (.cse5 (not (= ~NP~0 |old(~s~0)|))) (.cse6 (not (<= (+ ~NP~0 2) ~SKIP1~0))) (.cse7 (not (<= 1 ~NP~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 |old(~s~0)|) (<= 1 ~compRegistered~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ ~myStatus~0 1073741637) 0) (not (<= (+ |old(~myStatus~0)| 1073741637) 0))))) [2020-08-21 23:48:08,605 INFO L268 CegarLoopResult]: For program point L218-1(lines 214 220) no Hoare annotation was computed. [2020-08-21 23:48:08,605 INFO L268 CegarLoopResult]: For program point L185-1(lines 185 186) no Hoare annotation was computed. [2020-08-21 23:48:08,605 INFO L268 CegarLoopResult]: For program point L169(lines 169 181) no Hoare annotation was computed. [2020-08-21 23:48:08,605 INFO L268 CegarLoopResult]: For program point L136(lines 136 270) no Hoare annotation was computed. [2020-08-21 23:48:08,605 INFO L268 CegarLoopResult]: For program point L103(lines 103 281) no Hoare annotation was computed. [2020-08-21 23:48:08,606 INFO L271 CegarLoopResult]: At program point L260(lines 164 261) the Hoare annotation is: true [2020-08-21 23:48:08,606 INFO L268 CegarLoopResult]: For program point KbFilter_PnPEXIT(lines 73 285) no Hoare annotation was computed. [2020-08-21 23:48:08,606 INFO L268 CegarLoopResult]: For program point L145(lines 145 267) no Hoare annotation was computed. [2020-08-21 23:48:08,606 INFO L268 CegarLoopResult]: For program point L112(lines 112 278) no Hoare annotation was computed. [2020-08-21 23:48:08,606 INFO L264 CegarLoopResult]: At program point L104(lines 103 281) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-21 23:48:08,606 INFO L268 CegarLoopResult]: For program point L154(lines 154 264) no Hoare annotation was computed. [2020-08-21 23:48:08,606 INFO L268 CegarLoopResult]: For program point L121(lines 121 275) no Hoare annotation was computed. [2020-08-21 23:48:08,607 INFO L264 CegarLoopResult]: At program point KbFilter_PnPENTRY(lines 73 285) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-21 23:48:08,607 INFO L264 CegarLoopResult]: At program point L171(line 171) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-21 23:48:08,607 INFO L268 CegarLoopResult]: For program point KbFilter_PnPFINAL(lines 73 285) no Hoare annotation was computed. [2020-08-21 23:48:08,607 INFO L264 CegarLoopResult]: At program point L163(lines 109 279) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-21 23:48:08,607 INFO L268 CegarLoopResult]: For program point L130(lines 130 272) no Hoare annotation was computed. [2020-08-21 23:48:08,607 INFO L268 CegarLoopResult]: For program point L139(lines 139 269) no Hoare annotation was computed. [2020-08-21 23:48:08,607 INFO L268 CegarLoopResult]: For program point L106(lines 106 280) no Hoare annotation was computed. [2020-08-21 23:48:08,607 INFO L268 CegarLoopResult]: For program point L230(lines 230 236) no Hoare annotation was computed. [2020-08-21 23:48:08,608 INFO L264 CegarLoopResult]: At program point L255(lines 255 256) the Hoare annotation is: (or (not (<= ~NP~0 1)) (and (= ~compRegistered~0 0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-21 23:48:08,608 INFO L268 CegarLoopResult]: For program point L255-1(lines 255 256) no Hoare annotation was computed. [2020-08-21 23:48:08,608 INFO L268 CegarLoopResult]: For program point L214(lines 214 220) no Hoare annotation was computed. [2020-08-21 23:48:08,608 INFO L268 CegarLoopResult]: For program point L148(lines 148 266) no Hoare annotation was computed. [2020-08-21 23:48:08,608 INFO L268 CegarLoopResult]: For program point L115(lines 115 277) no Hoare annotation was computed. [2020-08-21 23:48:08,608 INFO L264 CegarLoopResult]: At program point L107(lines 106 280) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-21 23:48:08,608 INFO L268 CegarLoopResult]: For program point L198(lines 198 204) no Hoare annotation was computed. [2020-08-21 23:48:08,608 INFO L268 CegarLoopResult]: For program point L190(lines 190 196) no Hoare annotation was computed. [2020-08-21 23:48:08,609 INFO L268 CegarLoopResult]: For program point L157(lines 157 263) no Hoare annotation was computed. [2020-08-21 23:48:08,609 INFO L268 CegarLoopResult]: For program point L124(lines 124 274) no Hoare annotation was computed. [2020-08-21 23:48:08,609 INFO L268 CegarLoopResult]: For program point L190-2(lines 164 259) no Hoare annotation was computed. [2020-08-21 23:48:08,609 INFO L264 CegarLoopResult]: At program point L240(line 240) the Hoare annotation is: (or (not (<= ~NP~0 1)) (and (= ~compRegistered~0 0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-21 23:48:08,609 INFO L268 CegarLoopResult]: For program point L240-1(line 240) no Hoare annotation was computed. [2020-08-21 23:48:08,609 INFO L268 CegarLoopResult]: For program point L174(lines 174 180) no Hoare annotation was computed. [2020-08-21 23:48:08,609 INFO L268 CegarLoopResult]: For program point L174-1(lines 169 181) no Hoare annotation was computed. [2020-08-21 23:48:08,609 INFO L268 CegarLoopResult]: For program point L199(lines 199 203) no Hoare annotation was computed. [2020-08-21 23:48:08,609 INFO L268 CegarLoopResult]: For program point L133(lines 133 271) no Hoare annotation was computed. [2020-08-21 23:48:08,610 INFO L268 CegarLoopResult]: For program point L100(lines 100 282) no Hoare annotation was computed. [2020-08-21 23:48:08,610 INFO L264 CegarLoopResult]: At program point L224(lines 224 225) the Hoare annotation is: (or (not (<= ~NP~0 1)) (and (= ~compRegistered~0 0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-21 23:48:08,610 INFO L268 CegarLoopResult]: For program point L224-1(lines 224 225) no Hoare annotation was computed. [2020-08-21 23:48:08,610 INFO L264 CegarLoopResult]: At program point L249(line 249) the Hoare annotation is: (or (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-21 23:48:08,610 INFO L268 CegarLoopResult]: For program point L249-1(lines 245 251) no Hoare annotation was computed. [2020-08-21 23:48:08,610 INFO L268 CegarLoopResult]: For program point L142(lines 142 268) no Hoare annotation was computed. [2020-08-21 23:48:08,610 INFO L268 CegarLoopResult]: For program point L109(lines 109 279) no Hoare annotation was computed. [2020-08-21 23:48:08,611 INFO L264 CegarLoopResult]: At program point L101(lines 100 282) the Hoare annotation is: (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~myStatus~0 |old(~myStatus~0)|)) (not (<= ~NP~0 1)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= ~pended~0 0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= (+ ~NP~0 2) ~SKIP1~0)) (not (<= 1 ~NP~0))) [2020-08-21 23:48:08,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 11:48:08 BoogieIcfgContainer [2020-08-21 23:48:08,647 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-21 23:48:08,648 INFO L168 Benchmark]: Toolchain (without parser) took 22035.27 ms. Allocated memory was 136.8 MB in the beginning and 512.2 MB in the end (delta: 375.4 MB). Free memory was 99.3 MB in the beginning and 370.9 MB in the end (delta: -271.6 MB). Peak memory consumption was 394.3 MB. Max. memory is 7.1 GB. [2020-08-21 23:48:08,649 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 136.8 MB. Free memory was 118.4 MB in the beginning and 118.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-21 23:48:08,650 INFO L168 Benchmark]: CACSL2BoogieTranslator took 572.08 ms. Allocated memory was 136.8 MB in the beginning and 199.8 MB in the end (delta: 62.9 MB). Free memory was 99.1 MB in the beginning and 175.5 MB in the end (delta: -76.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2020-08-21 23:48:08,650 INFO L168 Benchmark]: Boogie Preprocessor took 50.66 ms. Allocated memory is still 199.8 MB. Free memory was 175.5 MB in the beginning and 173.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2020-08-21 23:48:08,651 INFO L168 Benchmark]: RCFGBuilder took 775.12 ms. Allocated memory is still 199.8 MB. Free memory was 173.4 MB in the beginning and 128.0 MB in the end (delta: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 7.1 GB. [2020-08-21 23:48:08,652 INFO L168 Benchmark]: TraceAbstraction took 20631.63 ms. Allocated memory was 199.8 MB in the beginning and 512.2 MB in the end (delta: 312.5 MB). Free memory was 127.3 MB in the beginning and 370.9 MB in the end (delta: -243.6 MB). Peak memory consumption was 359.4 MB. Max. memory is 7.1 GB. [2020-08-21 23:48:08,654 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 136.8 MB. Free memory was 118.4 MB in the beginning and 118.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 572.08 ms. Allocated memory was 136.8 MB in the beginning and 199.8 MB in the end (delta: 62.9 MB). Free memory was 99.1 MB in the beginning and 175.5 MB in the end (delta: -76.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.66 ms. Allocated memory is still 199.8 MB. Free memory was 175.5 MB in the beginning and 173.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 775.12 ms. Allocated memory is still 199.8 MB. Free memory was 173.4 MB in the beginning and 128.0 MB in the end (delta: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20631.63 ms. Allocated memory was 199.8 MB in the beginning and 512.2 MB in the end (delta: 312.5 MB). Free memory was 127.3 MB in the beginning and 370.9 MB in the end (delta: -243.6 MB). Peak memory consumption was 359.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || !(\old(s) == \old(MPR3))) || ((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && pended <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || !(\old(s) == \old(MPR3))) || ((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && pended <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || !(\old(s) == \old(MPR3))) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || 0 <= status) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || !(NP <= 1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(NP + 2 <= SKIP1)) || !(1 <= NP) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || !(NP <= 1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(NP + 2 <= SKIP1)) || !(1 <= NP) - InvariantResult [Line: 449]: Loop Invariant Derived loop invariant: (((((!(pended <= 0) || !(SKIP2 + 3 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(NP + 2 <= SKIP1)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) && ((((((((!(1 <= compRegistered) || MPR1 == s) || !(NP <= 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || !(1 <= NP)) - InvariantResult [Line: 526]: Loop Invariant Derived loop invariant: (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || ((setEventCalled == \old(setEventCalled) && s == NP) && \old(customIrp) == customIrp)) || !(1 <= NP)) && ((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP + 2 <= SKIP1)) || !(MPR3 == \old(s))) || !(1 <= NP)) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || !(NP <= 1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(NP + 2 <= SKIP1)) || !(1 <= NP) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: (((((!(pended <= 0) || !(SKIP2 + 3 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(NP + 2 <= SKIP1)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) && ((((((((!(1 <= compRegistered) || (MPR1 == s && setEventCalled == 1)) || !(NP <= 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || !(1 <= NP)) - InvariantResult [Line: 548]: Loop Invariant Derived loop invariant: (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(NP + 4 <= MPR1)) || s == NP) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP + 2 <= SKIP1)) || !(MPR3 == \old(s))) || !(1 <= NP)) && (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || s == \old(s)) || !(1 <= NP)) - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: (((((!(pended <= 0) || !(SKIP2 + 3 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(NP + 2 <= SKIP1)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) && (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || (((MPR1 == s && setEventCalled == 1) && returnVal2 <= 259) && 259 <= returnVal2)) || (returnVal2 <= 0 && MPR1 == s)) || !(1 <= NP)) - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(NP + 4 <= MPR1)) || s == NP) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP + 2 <= SKIP1)) || !(MPR3 == \old(s))) || !(1 <= NP)) && (((((((((!(1 <= compRegistered) || !(NP <= 1)) || !(\old(setEventCalled) == 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || s == \old(s)) || !(1 <= NP)) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || !(\old(s) == \old(MPR3))) || ((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && pended <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || !(NP <= 1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(NP + 2 <= SKIP1)) || !(1 <= NP) - InvariantResult [Line: 454]: Loop Invariant Derived loop invariant: (((((!(pended <= 0) || !(SKIP2 + 3 <= IPC)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s)) || !(NP + 2 <= SKIP1)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) && ((((((((!(1 <= compRegistered) || MPR1 == s) || !(NP <= 1)) || !(\old(s) + 2 <= SKIP1)) || !(NP + 4 <= MPR1)) || !(pended <= 0)) || !(SKIP2 + 3 <= IPC)) || !(NP == \old(s))) || !(1 <= NP)) - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || ((((((((NP + 2 <= SKIP1 && compRegistered == 0) && s == NP) && NP <= 1) && 0 <= status) && SKIP2 + 3 <= IPC) && NP + 4 <= MPR1) && 1 <= NP) && pended <= 0)) || !(\old(s) == \old(MPR3))) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - InvariantResult [Line: 385]: Loop Invariant Derived loop invariant: ((((((!(\old(IPC) <= \old(s)) || ((NP + 2 <= SKIP1 && SKIP2 + 3 <= IPC) && pended <= 0)) || !(\old(s) == \old(MPR3))) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || !(\old(pended) <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 151 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 14.0s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2162 SDtfs, 3407 SDslu, 2828 SDs, 0 SdLazy, 5133 SolverSat, 925 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 359 GetRequests, 174 SyntacticMatches, 3 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 186 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 53 LocationsWithAnnotation, 283 PreInvPairs, 349 NumberOfFragments, 3020 HoareAnnotationTreeSize, 283 FomulaSimplifications, 1712 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 53 FomulaSimplificationsInter, 7182 FormulaSimplificationTreeSizeReductionInter, 5.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 927 NumberOfCodeBlocks, 927 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 909 ConstructedInterpolants, 0 QuantifiedInterpolants, 205803 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...