/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -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.2.0-7d8eed3 [2020-11-06 22:25:23,433 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-06 22:25:23,436 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-06 22:25:23,491 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-06 22:25:23,492 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-06 22:25:23,496 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-06 22:25:23,500 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-06 22:25:23,507 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-06 22:25:23,511 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-06 22:25:23,518 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-06 22:25:23,519 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-06 22:25:23,521 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-06 22:25:23,521 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-06 22:25:23,525 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-06 22:25:23,527 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-06 22:25:23,528 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-06 22:25:23,529 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-06 22:25:23,533 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-06 22:25:23,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-06 22:25:23,549 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-06 22:25:23,551 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-06 22:25:23,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-06 22:25:23,554 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-06 22:25:23,557 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-06 22:25:23,566 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-06 22:25:23,567 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-06 22:25:23,567 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-06 22:25:23,585 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-06 22:25:23,585 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-06 22:25:23,586 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-06 22:25:23,586 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-06 22:25:23,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-06 22:25:23,591 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-06 22:25:23,592 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-06 22:25:23,593 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-06 22:25:23,593 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-06 22:25:23,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-06 22:25:23,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-06 22:25:23,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-06 22:25:23,596 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-06 22:25:23,596 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-06 22:25:23,598 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-06 22:25:23,626 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-06 22:25:23,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-06 22:25:23,628 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-06 22:25:23,628 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-06 22:25:23,628 INFO L138 SettingsManager]: * Use SBE=true [2020-11-06 22:25:23,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-06 22:25:23,629 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-06 22:25:23,629 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-06 22:25:23,629 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-06 22:25:23,630 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-06 22:25:23,630 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-06 22:25:23,630 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-06 22:25:23,630 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-06 22:25:23,631 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-06 22:25:23,631 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-06 22:25:23,631 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-06 22:25:23,631 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-06 22:25:23,632 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-06 22:25:23,632 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-06 22:25:23,632 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-06 22:25:23,632 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-06 22:25:23,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:25:23,633 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-06 22:25:23,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-06 22:25:23,633 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-06 22:25:23,634 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-06 22:25:23,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-06 22:25:23,634 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-06 22:25:23,634 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-06 22:25:23,635 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-06 22:25:23,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-06 22:25:24,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-06 22:25:24,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-06 22:25:24,029 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-06 22:25:24,036 INFO L275 PluginConnector]: CDTParser initialized [2020-11-06 22:25:24,037 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2020-11-06 22:25:24,117 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daf36a05c/ea2652ac63794a2d81eccb6c018aaa32/FLAG13486a49d [2020-11-06 22:25:24,741 INFO L306 CDTParser]: Found 1 translation units. [2020-11-06 22:25:24,742 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2020-11-06 22:25:24,755 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daf36a05c/ea2652ac63794a2d81eccb6c018aaa32/FLAG13486a49d [2020-11-06 22:25:25,092 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daf36a05c/ea2652ac63794a2d81eccb6c018aaa32 [2020-11-06 22:25:25,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-06 22:25:25,106 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-06 22:25:25,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-06 22:25:25,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-06 22:25:25,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-06 22:25:25,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:25:25" (1/1) ... [2020-11-06 22:25:25,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@779d7891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:25, skipping insertion in model container [2020-11-06 22:25:25,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:25:25" (1/1) ... [2020-11-06 22:25:25,129 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-06 22:25:25,193 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-06 22:25:25,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:25:25,499 INFO L203 MainTranslator]: Completed pre-run [2020-11-06 22:25:25,608 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:25:25,633 INFO L208 MainTranslator]: Completed translation [2020-11-06 22:25:25,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:25 WrapperNode [2020-11-06 22:25:25,634 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-06 22:25:25,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-06 22:25:25,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-06 22:25:25,636 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-06 22:25:25,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:25" (1/1) ... [2020-11-06 22:25:25,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:25" (1/1) ... [2020-11-06 22:25:25,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:25" (1/1) ... [2020-11-06 22:25:25,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:25" (1/1) ... [2020-11-06 22:25:25,680 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:25" (1/1) ... [2020-11-06 22:25:25,688 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:25" (1/1) ... [2020-11-06 22:25:25,693 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:25" (1/1) ... [2020-11-06 22:25:25,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-06 22:25:25,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-06 22:25:25,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-06 22:25:25,700 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-06 22:25:25,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/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-11-06 22:25:25,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-06 22:25:25,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-06 22:25:25,797 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-06 22:25:25,797 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2020-11-06 22:25:25,797 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2020-11-06 22:25:25,798 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2020-11-06 22:25:25,798 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-06 22:25:25,798 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2020-11-06 22:25:25,798 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2020-11-06 22:25:25,798 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2020-11-06 22:25:25,799 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2020-11-06 22:25:25,799 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2020-11-06 22:25:25,799 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2020-11-06 22:25:25,799 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2020-11-06 22:25:25,799 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-06 22:25:25,799 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-06 22:25:25,800 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-06 22:25:25,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-06 22:25:25,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-11-06 22:25:25,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-06 22:25:25,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2020-11-06 22:25:25,801 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2020-11-06 22:25:25,801 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2020-11-06 22:25:25,801 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2020-11-06 22:25:25,801 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2020-11-06 22:25:25,801 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2020-11-06 22:25:25,802 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2020-11-06 22:25:25,802 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2020-11-06 22:25:25,802 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2020-11-06 22:25:25,802 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2020-11-06 22:25:25,803 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-06 22:25:25,803 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2020-11-06 22:25:25,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-06 22:25:25,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-06 22:25:25,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-06 22:25:25,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-06 22:25:25,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-06 22:25:25,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-06 22:25:26,261 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-06 22:25:26,481 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2020-11-06 22:25:26,482 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2020-11-06 22:25:26,484 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-06 22:25:26,567 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2020-11-06 22:25:26,567 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2020-11-06 22:25:26,637 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-06 22:25:26,672 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2020-11-06 22:25:26,673 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2020-11-06 22:25:26,687 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-11-06 22:25:26,838 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2020-11-06 22:25:26,839 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2020-11-06 22:25:26,854 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-06 22:25:26,854 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-06 22:25:26,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:25:26 BoogieIcfgContainer [2020-11-06 22:25:26,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-06 22:25:26,858 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-06 22:25:26,858 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-06 22:25:26,862 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-06 22:25:26,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:25:25" (1/3) ... [2020-11-06 22:25:26,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac88f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:25:26, skipping insertion in model container [2020-11-06 22:25:26,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:25" (2/3) ... [2020-11-06 22:25:26,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac88f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:25:26, skipping insertion in model container [2020-11-06 22:25:26,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:25:26" (3/3) ... [2020-11-06 22:25:26,865 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2020-11-06 22:25:26,881 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-06 22:25:26,885 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-06 22:25:26,898 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-06 22:25:26,926 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-06 22:25:26,927 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-06 22:25:26,927 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-06 22:25:26,927 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-06 22:25:26,927 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-06 22:25:26,927 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-06 22:25:26,927 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-06 22:25:26,928 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-06 22:25:26,950 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2020-11-06 22:25:26,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-06 22:25:26,956 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:26,957 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] [2020-11-06 22:25:26,957 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:26,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:26,964 INFO L82 PathProgramCache]: Analyzing trace with hash -287519802, now seen corresponding path program 1 times [2020-11-06 22:25:26,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:26,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692938732] [2020-11-06 22:25:26,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:27,542 WARN L194 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-11-06 22:25:27,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:27,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:27,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:27,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692938732] [2020-11-06 22:25:27,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:27,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-06 22:25:27,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127401432] [2020-11-06 22:25:27,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-06 22:25:27,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:27,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-06 22:25:27,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:25:27,743 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 5 states. [2020-11-06 22:25:28,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:28,753 INFO L93 Difference]: Finished difference Result 307 states and 468 transitions. [2020-11-06 22:25:28,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:25:28,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-11-06 22:25:28,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:28,769 INFO L225 Difference]: With dead ends: 307 [2020-11-06 22:25:28,769 INFO L226 Difference]: Without dead ends: 158 [2020-11-06 22:25:28,776 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:25:28,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-11-06 22:25:28,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2020-11-06 22:25:28,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-11-06 22:25:28,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 191 transitions. [2020-11-06 22:25:28,850 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 191 transitions. Word has length 21 [2020-11-06 22:25:28,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:28,851 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 191 transitions. [2020-11-06 22:25:28,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-06 22:25:28,851 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 191 transitions. [2020-11-06 22:25:28,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-06 22:25:28,852 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:28,853 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-11-06 22:25:28,853 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-06 22:25:28,853 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:28,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:28,854 INFO L82 PathProgramCache]: Analyzing trace with hash 161897331, now seen corresponding path program 1 times [2020-11-06 22:25:28,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:28,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049265593] [2020-11-06 22:25:28,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:29,126 WARN L194 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-11-06 22:25:29,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:29,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:29,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:29,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:29,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049265593] [2020-11-06 22:25:29,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:29,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:25:29,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200695143] [2020-11-06 22:25:29,235 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:25:29,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:29,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:25:29,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:25:29,236 INFO L87 Difference]: Start difference. First operand 141 states and 191 transitions. Second operand 6 states. [2020-11-06 22:25:30,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:30,278 INFO L93 Difference]: Finished difference Result 278 states and 373 transitions. [2020-11-06 22:25:30,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-06 22:25:30,279 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-11-06 22:25:30,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:30,284 INFO L225 Difference]: With dead ends: 278 [2020-11-06 22:25:30,284 INFO L226 Difference]: Without dead ends: 221 [2020-11-06 22:25:30,285 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:25:30,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2020-11-06 22:25:30,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 196. [2020-11-06 22:25:30,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-11-06 22:25:30,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 260 transitions. [2020-11-06 22:25:30,372 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 260 transitions. Word has length 27 [2020-11-06 22:25:30,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:30,372 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 260 transitions. [2020-11-06 22:25:30,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:25:30,372 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 260 transitions. [2020-11-06 22:25:30,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-06 22:25:30,376 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:30,377 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] [2020-11-06 22:25:30,377 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-06 22:25:30,377 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:30,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:30,378 INFO L82 PathProgramCache]: Analyzing trace with hash 723741620, now seen corresponding path program 1 times [2020-11-06 22:25:30,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:30,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732068041] [2020-11-06 22:25:30,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:30,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:30,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:30,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:30,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:30,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732068041] [2020-11-06 22:25:30,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:30,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:25:30,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16636104] [2020-11-06 22:25:30,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:25:30,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:30,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:25:30,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:25:30,696 INFO L87 Difference]: Start difference. First operand 196 states and 260 transitions. Second operand 6 states. [2020-11-06 22:25:31,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:31,493 INFO L93 Difference]: Finished difference Result 319 states and 416 transitions. [2020-11-06 22:25:31,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-06 22:25:31,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-11-06 22:25:31,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:31,500 INFO L225 Difference]: With dead ends: 319 [2020-11-06 22:25:31,500 INFO L226 Difference]: Without dead ends: 256 [2020-11-06 22:25:31,501 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:25:31,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-11-06 22:25:31,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 218. [2020-11-06 22:25:31,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-11-06 22:25:31,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 290 transitions. [2020-11-06 22:25:31,564 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 290 transitions. Word has length 28 [2020-11-06 22:25:31,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:31,564 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 290 transitions. [2020-11-06 22:25:31,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:25:31,565 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 290 transitions. [2020-11-06 22:25:31,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-11-06 22:25:31,571 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:31,571 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] [2020-11-06 22:25:31,571 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-06 22:25:31,571 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:31,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:31,572 INFO L82 PathProgramCache]: Analyzing trace with hash -301257207, now seen corresponding path program 1 times [2020-11-06 22:25:31,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:31,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761477311] [2020-11-06 22:25:31,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:31,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:31,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:31,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:31,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:31,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:31,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761477311] [2020-11-06 22:25:31,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:31,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-06 22:25:31,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510039878] [2020-11-06 22:25:31,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-06 22:25:31,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:31,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-06 22:25:31,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:25:31,931 INFO L87 Difference]: Start difference. First operand 218 states and 290 transitions. Second operand 7 states. [2020-11-06 22:25:33,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:33,018 INFO L93 Difference]: Finished difference Result 222 states and 293 transitions. [2020-11-06 22:25:33,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-06 22:25:33,019 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-11-06 22:25:33,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:33,022 INFO L225 Difference]: With dead ends: 222 [2020-11-06 22:25:33,022 INFO L226 Difference]: Without dead ends: 218 [2020-11-06 22:25:33,023 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:25:33,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2020-11-06 22:25:33,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2020-11-06 22:25:33,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-11-06 22:25:33,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 289 transitions. [2020-11-06 22:25:33,051 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 289 transitions. Word has length 38 [2020-11-06 22:25:33,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:33,052 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 289 transitions. [2020-11-06 22:25:33,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-06 22:25:33,052 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 289 transitions. [2020-11-06 22:25:33,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-06 22:25:33,054 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:33,055 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] [2020-11-06 22:25:33,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-06 22:25:33,055 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:33,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:33,056 INFO L82 PathProgramCache]: Analyzing trace with hash -905173741, now seen corresponding path program 1 times [2020-11-06 22:25:33,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:33,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568302974] [2020-11-06 22:25:33,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:33,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:33,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:33,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:33,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-11-06 22:25:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:33,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:33,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568302974] [2020-11-06 22:25:33,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:33,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-06 22:25:33,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565496929] [2020-11-06 22:25:33,338 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-06 22:25:33,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:33,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-06 22:25:33,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:25:33,339 INFO L87 Difference]: Start difference. First operand 218 states and 289 transitions. Second operand 9 states. [2020-11-06 22:25:34,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:34,513 INFO L93 Difference]: Finished difference Result 277 states and 359 transitions. [2020-11-06 22:25:34,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-06 22:25:34,514 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2020-11-06 22:25:34,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:34,516 INFO L225 Difference]: With dead ends: 277 [2020-11-06 22:25:34,516 INFO L226 Difference]: Without dead ends: 210 [2020-11-06 22:25:34,517 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2020-11-06 22:25:34,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-11-06 22:25:34,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 191. [2020-11-06 22:25:34,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-11-06 22:25:34,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 251 transitions. [2020-11-06 22:25:34,545 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 251 transitions. Word has length 46 [2020-11-06 22:25:34,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:34,547 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 251 transitions. [2020-11-06 22:25:34,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-06 22:25:34,547 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 251 transitions. [2020-11-06 22:25:34,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-06 22:25:34,552 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:34,552 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-11-06 22:25:34,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-06 22:25:34,553 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:34,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:34,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1403671779, now seen corresponding path program 1 times [2020-11-06 22:25:34,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:34,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341820616] [2020-11-06 22:25:34,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:34,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:34,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:34,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:34,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:25:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:34,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:25:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:34,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-11-06 22:25:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:34,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:34,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341820616] [2020-11-06 22:25:34,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:34,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-06 22:25:34,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890033808] [2020-11-06 22:25:34,850 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-06 22:25:34,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:34,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-06 22:25:34,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:25:34,851 INFO L87 Difference]: Start difference. First operand 191 states and 251 transitions. Second operand 8 states. [2020-11-06 22:25:35,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:35,758 INFO L93 Difference]: Finished difference Result 260 states and 338 transitions. [2020-11-06 22:25:35,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-06 22:25:35,758 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-11-06 22:25:35,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:35,760 INFO L225 Difference]: With dead ends: 260 [2020-11-06 22:25:35,760 INFO L226 Difference]: Without dead ends: 198 [2020-11-06 22:25:35,761 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:25:35,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2020-11-06 22:25:35,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 189. [2020-11-06 22:25:35,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-11-06 22:25:35,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 247 transitions. [2020-11-06 22:25:35,783 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 247 transitions. Word has length 52 [2020-11-06 22:25:35,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:35,783 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 247 transitions. [2020-11-06 22:25:35,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-06 22:25:35,783 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 247 transitions. [2020-11-06 22:25:35,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-06 22:25:35,785 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:35,785 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-11-06 22:25:35,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-06 22:25:35,785 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:35,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:35,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1321153240, now seen corresponding path program 1 times [2020-11-06 22:25:35,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:35,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165925095] [2020-11-06 22:25:35,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:35,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:35,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:35,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:35,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:36,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-06 22:25:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:36,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:36,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:36,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165925095] [2020-11-06 22:25:36,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:36,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-06 22:25:36,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151412216] [2020-11-06 22:25:36,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-06 22:25:36,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:36,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-06 22:25:36,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:25:36,143 INFO L87 Difference]: Start difference. First operand 189 states and 247 transitions. Second operand 12 states. [2020-11-06 22:25:36,870 WARN L194 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2020-11-06 22:25:37,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:37,541 INFO L93 Difference]: Finished difference Result 237 states and 303 transitions. [2020-11-06 22:25:37,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-06 22:25:37,542 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2020-11-06 22:25:37,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:37,544 INFO L225 Difference]: With dead ends: 237 [2020-11-06 22:25:37,544 INFO L226 Difference]: Without dead ends: 212 [2020-11-06 22:25:37,545 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2020-11-06 22:25:37,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-11-06 22:25:37,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 189. [2020-11-06 22:25:37,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-11-06 22:25:37,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 245 transitions. [2020-11-06 22:25:37,567 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 245 transitions. Word has length 51 [2020-11-06 22:25:37,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:37,568 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 245 transitions. [2020-11-06 22:25:37,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-06 22:25:37,568 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 245 transitions. [2020-11-06 22:25:37,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-06 22:25:37,569 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:37,569 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] [2020-11-06 22:25:37,569 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-06 22:25:37,570 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:37,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:37,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1176655459, now seen corresponding path program 1 times [2020-11-06 22:25:37,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:37,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074029845] [2020-11-06 22:25:37,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:37,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:37,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:37,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:37,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-06 22:25:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:37,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:37,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:37,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074029845] [2020-11-06 22:25:37,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:37,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-06 22:25:37,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796410944] [2020-11-06 22:25:37,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-06 22:25:37,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:37,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-06 22:25:37,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:25:37,812 INFO L87 Difference]: Start difference. First operand 189 states and 245 transitions. Second operand 8 states. [2020-11-06 22:25:38,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:38,289 INFO L93 Difference]: Finished difference Result 280 states and 363 transitions. [2020-11-06 22:25:38,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-06 22:25:38,290 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2020-11-06 22:25:38,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:38,292 INFO L225 Difference]: With dead ends: 280 [2020-11-06 22:25:38,292 INFO L226 Difference]: Without dead ends: 214 [2020-11-06 22:25:38,293 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:25:38,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-11-06 22:25:38,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 195. [2020-11-06 22:25:38,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-11-06 22:25:38,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 253 transitions. [2020-11-06 22:25:38,315 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 253 transitions. Word has length 53 [2020-11-06 22:25:38,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:38,315 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 253 transitions. [2020-11-06 22:25:38,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-06 22:25:38,315 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 253 transitions. [2020-11-06 22:25:38,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-06 22:25:38,316 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:38,316 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] [2020-11-06 22:25:38,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-06 22:25:38,317 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:38,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:38,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1429368095, now seen corresponding path program 1 times [2020-11-06 22:25:38,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:38,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777127440] [2020-11-06 22:25:38,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:38,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:38,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:38,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:38,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-06 22:25:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:38,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:38,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:38,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777127440] [2020-11-06 22:25:38,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:38,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-06 22:25:38,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63095885] [2020-11-06 22:25:38,699 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-06 22:25:38,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:38,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-06 22:25:38,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:25:38,701 INFO L87 Difference]: Start difference. First operand 195 states and 253 transitions. Second operand 12 states. [2020-11-06 22:25:39,130 WARN L194 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 90 [2020-11-06 22:25:40,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:40,068 INFO L93 Difference]: Finished difference Result 227 states and 288 transitions. [2020-11-06 22:25:40,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-06 22:25:40,069 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2020-11-06 22:25:40,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:40,072 INFO L225 Difference]: With dead ends: 227 [2020-11-06 22:25:40,072 INFO L226 Difference]: Without dead ends: 221 [2020-11-06 22:25:40,072 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2020-11-06 22:25:40,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2020-11-06 22:25:40,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 200. [2020-11-06 22:25:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-11-06 22:25:40,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 259 transitions. [2020-11-06 22:25:40,095 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 259 transitions. Word has length 53 [2020-11-06 22:25:40,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:40,096 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 259 transitions. [2020-11-06 22:25:40,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-06 22:25:40,096 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 259 transitions. [2020-11-06 22:25:40,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-06 22:25:40,097 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:40,097 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] [2020-11-06 22:25:40,097 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-06 22:25:40,097 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:40,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:40,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1681877661, now seen corresponding path program 1 times [2020-11-06 22:25:40,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:40,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727730541] [2020-11-06 22:25:40,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:40,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:40,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:40,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:40,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-06 22:25:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:40,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:40,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:40,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727730541] [2020-11-06 22:25:40,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:40,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-06 22:25:40,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126599170] [2020-11-06 22:25:40,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:25:40,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:40,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:25:40,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:25:40,377 INFO L87 Difference]: Start difference. First operand 200 states and 259 transitions. Second operand 10 states. [2020-11-06 22:25:40,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:40,936 INFO L93 Difference]: Finished difference Result 219 states and 281 transitions. [2020-11-06 22:25:40,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-06 22:25:40,936 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2020-11-06 22:25:40,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:40,937 INFO L225 Difference]: With dead ends: 219 [2020-11-06 22:25:40,938 INFO L226 Difference]: Without dead ends: 95 [2020-11-06 22:25:40,941 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:25:40,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-11-06 22:25:40,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-11-06 22:25:40,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-11-06 22:25:40,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2020-11-06 22:25:40,955 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 53 [2020-11-06 22:25:40,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:40,956 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2020-11-06 22:25:40,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:25:40,956 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2020-11-06 22:25:40,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-06 22:25:40,957 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:40,957 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] [2020-11-06 22:25:40,958 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-06 22:25:40,958 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:40,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:40,958 INFO L82 PathProgramCache]: Analyzing trace with hash 827842256, now seen corresponding path program 1 times [2020-11-06 22:25:40,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:40,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947015851] [2020-11-06 22:25:40,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:41,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:41,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:41,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:41,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-11-06 22:25:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:41,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:25:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:41,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:25:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:41,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:41,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:41,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947015851] [2020-11-06 22:25:41,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:41,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-06 22:25:41,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263477975] [2020-11-06 22:25:41,340 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-06 22:25:41,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:41,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-06 22:25:41,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:25:41,342 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 12 states. [2020-11-06 22:25:42,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:42,022 INFO L93 Difference]: Finished difference Result 124 states and 141 transitions. [2020-11-06 22:25:42,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-06 22:25:42,023 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2020-11-06 22:25:42,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:42,025 INFO L225 Difference]: With dead ends: 124 [2020-11-06 22:25:42,025 INFO L226 Difference]: Without dead ends: 95 [2020-11-06 22:25:42,026 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2020-11-06 22:25:42,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-11-06 22:25:42,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-11-06 22:25:42,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-11-06 22:25:42,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2020-11-06 22:25:42,039 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 60 [2020-11-06 22:25:42,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:42,039 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2020-11-06 22:25:42,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-06 22:25:42,039 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2020-11-06 22:25:42,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-06 22:25:42,040 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:42,040 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-11-06 22:25:42,040 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-06 22:25:42,041 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:42,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:42,041 INFO L82 PathProgramCache]: Analyzing trace with hash -233728390, now seen corresponding path program 1 times [2020-11-06 22:25:42,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:42,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474087337] [2020-11-06 22:25:42,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:42,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:42,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:42,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:42,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-11-06 22:25:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:42,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:25:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:42,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:25:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:42,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:42,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-11-06 22:25:42,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474087337] [2020-11-06 22:25:42,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:42,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-06 22:25:42,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005969793] [2020-11-06 22:25:42,346 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-06 22:25:42,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:42,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-06 22:25:42,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:25:42,347 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand 12 states. [2020-11-06 22:25:42,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:42,773 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2020-11-06 22:25:42,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-06 22:25:42,773 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2020-11-06 22:25:42,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:42,774 INFO L225 Difference]: With dead ends: 114 [2020-11-06 22:25:42,774 INFO L226 Difference]: Without dead ends: 94 [2020-11-06 22:25:42,775 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:25:42,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-11-06 22:25:42,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2020-11-06 22:25:42,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-11-06 22:25:42,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2020-11-06 22:25:42,788 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 62 [2020-11-06 22:25:42,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:42,790 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2020-11-06 22:25:42,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-06 22:25:42,790 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2020-11-06 22:25:42,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-06 22:25:42,791 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:42,791 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-11-06 22:25:42,791 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-06 22:25:42,791 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:42,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:42,792 INFO L82 PathProgramCache]: Analyzing trace with hash 660592135, now seen corresponding path program 1 times [2020-11-06 22:25:42,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:42,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129334377] [2020-11-06 22:25:42,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:42,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:42,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:43,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:43,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-11-06 22:25:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:43,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:25:43,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:43,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:25:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:43,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:43,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:43,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129334377] [2020-11-06 22:25:43,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:43,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-06 22:25:43,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307861182] [2020-11-06 22:25:43,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-06 22:25:43,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:43,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-06 22:25:43,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:25:43,112 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand 12 states. [2020-11-06 22:25:43,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:43,438 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2020-11-06 22:25:43,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-06 22:25:43,440 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2020-11-06 22:25:43,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:43,441 INFO L225 Difference]: With dead ends: 98 [2020-11-06 22:25:43,441 INFO L226 Difference]: Without dead ends: 90 [2020-11-06 22:25:43,442 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:25:43,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-11-06 22:25:43,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2020-11-06 22:25:43,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-11-06 22:25:43,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2020-11-06 22:25:43,463 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 63 [2020-11-06 22:25:43,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:43,463 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2020-11-06 22:25:43,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-06 22:25:43,464 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2020-11-06 22:25:43,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-06 22:25:43,464 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:43,464 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-11-06 22:25:43,465 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-06 22:25:43,465 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:43,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:43,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1477695784, now seen corresponding path program 1 times [2020-11-06 22:25:43,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:43,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805967769] [2020-11-06 22:25:43,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:43,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:43,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:43,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:43,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-11-06 22:25:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:43,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:25:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:43,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:25:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:43,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:43,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:43,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805967769] [2020-11-06 22:25:43,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:43,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-06 22:25:43,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330286495] [2020-11-06 22:25:43,742 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-06 22:25:43,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:43,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-06 22:25:43,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:25:43,743 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand 9 states. [2020-11-06 22:25:44,039 WARN L194 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-11-06 22:25:44,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:44,104 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2020-11-06 22:25:44,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-06 22:25:44,105 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2020-11-06 22:25:44,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:44,106 INFO L225 Difference]: With dead ends: 108 [2020-11-06 22:25:44,106 INFO L226 Difference]: Without dead ends: 102 [2020-11-06 22:25:44,106 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:25:44,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-11-06 22:25:44,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 92. [2020-11-06 22:25:44,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-11-06 22:25:44,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2020-11-06 22:25:44,123 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 63 [2020-11-06 22:25:44,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:44,123 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2020-11-06 22:25:44,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-06 22:25:44,123 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2020-11-06 22:25:44,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-06 22:25:44,124 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:44,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, 1] [2020-11-06 22:25:44,124 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-06 22:25:44,125 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:44,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:44,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1115430964, now seen corresponding path program 1 times [2020-11-06 22:25:44,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:44,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026088342] [2020-11-06 22:25:44,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:44,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:44,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:44,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:44,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-11-06 22:25:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:44,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:25:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:44,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:25:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:44,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:44,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-11-06 22:25:44,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026088342] [2020-11-06 22:25:44,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:44,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-06 22:25:44,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103181363] [2020-11-06 22:25:44,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-06 22:25:44,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:44,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-06 22:25:44,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:25:44,400 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 9 states. [2020-11-06 22:25:44,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:44,841 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2020-11-06 22:25:44,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-06 22:25:44,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2020-11-06 22:25:44,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:44,844 INFO L225 Difference]: With dead ends: 176 [2020-11-06 22:25:44,844 INFO L226 Difference]: Without dead ends: 168 [2020-11-06 22:25:44,847 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:25:44,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2020-11-06 22:25:44,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 155. [2020-11-06 22:25:44,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-11-06 22:25:44,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 166 transitions. [2020-11-06 22:25:44,878 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 166 transitions. Word has length 64 [2020-11-06 22:25:44,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:44,878 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 166 transitions. [2020-11-06 22:25:44,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-06 22:25:44,878 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 166 transitions. [2020-11-06 22:25:44,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-06 22:25:44,882 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:44,882 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] [2020-11-06 22:25:44,882 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-06 22:25:44,883 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:44,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:44,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1924777590, now seen corresponding path program 1 times [2020-11-06 22:25:44,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:44,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131476537] [2020-11-06 22:25:44,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:45,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:45,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:45,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:45,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-11-06 22:25:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:45,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:25:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:45,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:25:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:45,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:45,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:45,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131476537] [2020-11-06 22:25:45,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:45,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-06 22:25:45,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560277739] [2020-11-06 22:25:45,253 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-06 22:25:45,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:45,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-06 22:25:45,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:25:45,254 INFO L87 Difference]: Start difference. First operand 155 states and 166 transitions. Second operand 12 states. [2020-11-06 22:25:45,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:45,648 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2020-11-06 22:25:45,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-06 22:25:45,651 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2020-11-06 22:25:45,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:45,652 INFO L225 Difference]: With dead ends: 168 [2020-11-06 22:25:45,652 INFO L226 Difference]: Without dead ends: 141 [2020-11-06 22:25:45,653 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:25:45,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-11-06 22:25:45,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2020-11-06 22:25:45,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-11-06 22:25:45,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 148 transitions. [2020-11-06 22:25:45,679 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 148 transitions. Word has length 64 [2020-11-06 22:25:45,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:45,680 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 148 transitions. [2020-11-06 22:25:45,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-06 22:25:45,680 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 148 transitions. [2020-11-06 22:25:45,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-06 22:25:45,681 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:45,681 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] [2020-11-06 22:25:45,681 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-06 22:25:45,681 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:45,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:45,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1636423798, now seen corresponding path program 1 times [2020-11-06 22:25:45,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:45,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689583434] [2020-11-06 22:25:45,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:45,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:45,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:45,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:45,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-11-06 22:25:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:45,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:25:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:45,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:25:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:45,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:45,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:45,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689583434] [2020-11-06 22:25:45,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:45,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-06 22:25:45,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269290071] [2020-11-06 22:25:45,982 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-06 22:25:45,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:45,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-06 22:25:45,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:25:45,983 INFO L87 Difference]: Start difference. First operand 141 states and 148 transitions. Second operand 9 states. [2020-11-06 22:25:46,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:46,327 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2020-11-06 22:25:46,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-06 22:25:46,327 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2020-11-06 22:25:46,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:46,329 INFO L225 Difference]: With dead ends: 167 [2020-11-06 22:25:46,329 INFO L226 Difference]: Without dead ends: 134 [2020-11-06 22:25:46,329 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:25:46,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-11-06 22:25:46,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2020-11-06 22:25:46,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-11-06 22:25:46,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 137 transitions. [2020-11-06 22:25:46,350 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 137 transitions. Word has length 64 [2020-11-06 22:25:46,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:46,350 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 137 transitions. [2020-11-06 22:25:46,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-06 22:25:46,350 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2020-11-06 22:25:46,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-11-06 22:25:46,352 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:25:46,352 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, 1] [2020-11-06 22:25:46,352 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-06 22:25:46,352 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:25:46,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:25:46,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1756072874, now seen corresponding path program 1 times [2020-11-06 22:25:46,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:25:46,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067749040] [2020-11-06 22:25:46,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:25:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:46,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:25:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:46,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:25:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:46,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:46,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-11-06 22:25:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:46,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:25:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:46,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:25:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:46,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:25:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:46,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-11-06 22:25:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:25:46,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:25:46,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067749040] [2020-11-06 22:25:46,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:25:46,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-06 22:25:46,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357997738] [2020-11-06 22:25:46,654 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-06 22:25:46,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:25:46,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-06 22:25:46,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:25:46,655 INFO L87 Difference]: Start difference. First operand 134 states and 137 transitions. Second operand 11 states. [2020-11-06 22:25:46,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:25:46,915 INFO L93 Difference]: Finished difference Result 134 states and 137 transitions. [2020-11-06 22:25:46,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-06 22:25:46,918 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2020-11-06 22:25:46,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:25:46,918 INFO L225 Difference]: With dead ends: 134 [2020-11-06 22:25:46,918 INFO L226 Difference]: Without dead ends: 0 [2020-11-06 22:25:46,919 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:25:46,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-06 22:25:46,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-06 22:25:46,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-06 22:25:46,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-06 22:25:46,920 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2020-11-06 22:25:46,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:25:46,920 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-06 22:25:46,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-06 22:25:46,920 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-06 22:25:46,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-06 22:25:46,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-06 22:25:46,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-06 22:25:48,012 WARN L194 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 46 [2020-11-06 22:25:48,211 WARN L194 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2020-11-06 22:25:48,461 WARN L194 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2020-11-06 22:25:48,734 WARN L194 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 48 [2020-11-06 22:25:48,890 WARN L194 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 27 [2020-11-06 22:25:49,011 WARN L194 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2020-11-06 22:25:49,151 WARN L194 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 60 [2020-11-06 22:25:49,392 WARN L194 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 40 [2020-11-06 22:25:49,932 WARN L194 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 46 [2020-11-06 22:25:50,417 WARN L194 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 45 [2020-11-06 22:25:50,757 WARN L194 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 33 [2020-11-06 22:25:50,863 WARN L194 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2020-11-06 22:25:51,173 WARN L194 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 31 [2020-11-06 22:25:51,593 WARN L194 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 44 [2020-11-06 22:25:51,905 WARN L194 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 43 [2020-11-06 22:25:52,243 WARN L194 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 46 [2020-11-06 22:25:52,565 WARN L194 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 69 [2020-11-06 22:25:52,675 WARN L194 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2020-11-06 22:25:52,869 WARN L194 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2020-11-06 22:25:53,118 WARN L194 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 31 [2020-11-06 22:25:53,500 WARN L194 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 51 [2020-11-06 22:25:53,903 WARN L194 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 42 [2020-11-06 22:25:54,155 WARN L194 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 46 [2020-11-06 22:25:54,467 WARN L194 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 43 [2020-11-06 22:25:54,646 WARN L194 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2020-11-06 22:25:54,914 WARN L194 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 46 [2020-11-06 22:25:55,075 WARN L194 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2020-11-06 22:25:55,324 WARN L194 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 31 [2020-11-06 22:25:55,404 INFO L266 CegarLoopResult]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2020-11-06 22:25:55,404 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-06 22:25:55,404 INFO L266 CegarLoopResult]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2020-11-06 22:25:55,405 INFO L266 CegarLoopResult]: For program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-11-06 22:25:55,405 INFO L262 CegarLoopResult]: At program point KeSetEventENTRY(lines 515 522) the Hoare annotation is: (or (= ~compRegistered~0 0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= 5 ~MPR1~0)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0)) (not (= ~s~0 ~NP~0))) [2020-11-06 22:25:55,405 INFO L266 CegarLoopResult]: For program point KeSetEventFINAL(lines 515 522) no Hoare annotation was computed. [2020-11-06 22:25:55,405 INFO L266 CegarLoopResult]: For program point KeSetEventEXIT(lines 515 522) no Hoare annotation was computed. [2020-11-06 22:25:55,406 INFO L262 CegarLoopResult]: At program point KbFilter_CompleteENTRY(lines 565 575) the Hoare annotation is: (or (= ~compRegistered~0 0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= 5 ~MPR1~0)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0)) (not (= ~s~0 ~NP~0))) [2020-11-06 22:25:55,406 INFO L262 CegarLoopResult]: At program point L571(line 571) the Hoare annotation is: (or (= ~compRegistered~0 0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (<= 5 ~MPR1~0)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0)) (not (= ~s~0 ~NP~0))) [2020-11-06 22:25:55,406 INFO L266 CegarLoopResult]: For program point L571-1(line 571) no Hoare annotation was computed. [2020-11-06 22:25:55,406 INFO L266 CegarLoopResult]: For program point KbFilter_CompleteFINAL(lines 565 575) no Hoare annotation was computed. [2020-11-06 22:25:55,407 INFO L266 CegarLoopResult]: For program point KbFilter_CompleteEXIT(lines 565 575) no Hoare annotation was computed. [2020-11-06 22:25:55,407 INFO L266 CegarLoopResult]: For program point stub_driver_initEXIT(lines 37 50) no Hoare annotation was computed. [2020-11-06 22:25:55,407 INFO L262 CegarLoopResult]: At program point stub_driver_initENTRY(lines 37 50) the Hoare annotation is: (or (not (= |old(~pended~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~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 (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3))) [2020-11-06 22:25:55,407 INFO L266 CegarLoopResult]: For program point stub_driver_initFINAL(lines 37 50) no Hoare annotation was computed. [2020-11-06 22:25:55,407 INFO L266 CegarLoopResult]: For program point _BLAST_initFINAL(lines 51 72) no Hoare annotation was computed. [2020-11-06 22:25:55,407 INFO L262 CegarLoopResult]: At program point _BLAST_initENTRY(lines 51 72) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~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(~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)|))) [2020-11-06 22:25:55,408 INFO L266 CegarLoopResult]: For program point _BLAST_initEXIT(lines 51 72) no Hoare annotation was computed. [2020-11-06 22:25:55,408 INFO L269 CegarLoopResult]: At program point errorFnENTRY(lines 577 584) the Hoare annotation is: true [2020-11-06 22:25:55,408 INFO L266 CegarLoopResult]: For program point errorFnFINAL(lines 577 584) no Hoare annotation was computed. [2020-11-06 22:25:55,408 INFO L266 CegarLoopResult]: For program point errorFnEXIT(lines 577 584) no Hoare annotation was computed. [2020-11-06 22:25:55,408 INFO L266 CegarLoopResult]: For program point L581(line 581) no Hoare annotation was computed. [2020-11-06 22:25:55,408 INFO L266 CegarLoopResult]: For program point mainEXIT(lines 288 422) no Hoare annotation was computed. [2020-11-06 22:25:55,408 INFO L262 CegarLoopResult]: At program point L400(line 400) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~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)|))) [2020-11-06 22:25:55,408 INFO L266 CegarLoopResult]: For program point L359(line 359) no Hoare annotation was computed. [2020-11-06 22:25:55,409 INFO L262 CegarLoopResult]: At program point L384(lines 377 417) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~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)|)) (and (= ~NP~0 1) (= ~pended~0 0) (<= 4 ~SKIP2~0) (<= ~SKIP1~0 3) (= main_~__cil_tmp8~0 1) (<= 3 ~SKIP1~0))) [2020-11-06 22:25:55,409 INFO L266 CegarLoopResult]: For program point L409(lines 409 411) no Hoare annotation was computed. [2020-11-06 22:25:55,409 INFO L262 CegarLoopResult]: At program point L376(lines 369 418) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~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)|)) (and (= ~NP~0 1) (= ~pended~0 0) (<= 4 ~SKIP2~0) (<= ~SKIP1~0 3) (= main_~__cil_tmp8~0 1) (<= 3 ~SKIP1~0))) [2020-11-06 22:25:55,409 INFO L266 CegarLoopResult]: For program point mainFINAL(lines 288 422) no Hoare annotation was computed. [2020-11-06 22:25:55,409 INFO L266 CegarLoopResult]: For program point L385(lines 369 418) no Hoare annotation was computed. [2020-11-06 22:25:55,409 INFO L266 CegarLoopResult]: For program point L352(lines 352 367) no Hoare annotation was computed. [2020-11-06 22:25:55,409 INFO L262 CegarLoopResult]: At program point mainENTRY(lines 288 422) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~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)|)) (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) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~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)|))) [2020-11-06 22:25:55,409 INFO L266 CegarLoopResult]: For program point L386(lines 386 415) no Hoare annotation was computed. [2020-11-06 22:25:55,410 INFO L262 CegarLoopResult]: At program point L353(lines 352 367) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~pended~0)| 0)) (and (= ~NP~0 1) (= ~pended~0 0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= main_~status~1 0) (<= ~SKIP1~0 3) (= main_~__cil_tmp8~0 1) (<= 3 ~SKIP1~0) (<= 5 ~MPR1~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)|))) [2020-11-06 22:25:55,410 INFO L266 CegarLoopResult]: For program point L378(lines 378 382) no Hoare annotation was computed. [2020-11-06 22:25:55,410 INFO L266 CegarLoopResult]: For program point L370(lines 370 374) no Hoare annotation was computed. [2020-11-06 22:25:55,410 INFO L266 CegarLoopResult]: For program point L337(lines 323 368) no Hoare annotation was computed. [2020-11-06 22:25:55,410 INFO L266 CegarLoopResult]: For program point L387(lines 387 414) no Hoare annotation was computed. [2020-11-06 22:25:55,410 INFO L262 CegarLoopResult]: At program point L321(line 321) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~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)|)) (and (= ~MPR3~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (= main_~status~1 0))) [2020-11-06 22:25:55,410 INFO L266 CegarLoopResult]: For program point L321-1(lines 297 421) no Hoare annotation was computed. [2020-11-06 22:25:55,410 INFO L266 CegarLoopResult]: For program point L404(lines 404 412) no Hoare annotation was computed. [2020-11-06 22:25:55,410 INFO L262 CegarLoopResult]: At program point L396(lines 387 414) the Hoare annotation is: (or (and (= ~pended~0 0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (<= ~SKIP1~0 3) (= main_~__cil_tmp8~0 1) (<= 3 ~SKIP1~0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~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)|))) [2020-11-06 22:25:55,410 INFO L266 CegarLoopResult]: For program point L388(lines 388 394) no Hoare annotation was computed. [2020-11-06 22:25:55,411 INFO L262 CegarLoopResult]: At program point L355(lines 354 367) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (= main_~status~1 0) (not (= |old(~s~0)| |old(~NP~0)|))) [2020-11-06 22:25:55,411 INFO L266 CegarLoopResult]: For program point L405(lines 405 407) no Hoare annotation was computed. [2020-11-06 22:25:55,411 INFO L266 CegarLoopResult]: For program point L389(lines 389 391) no Hoare annotation was computed. [2020-11-06 22:25:55,411 INFO L262 CegarLoopResult]: At program point L323(lines 297 421) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~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)|)) (and (= ~NP~0 1) (= ~pended~0 0) (<= 4 ~SKIP2~0) (<= ~SKIP1~0 3) (= main_~__cil_tmp8~0 1) (<= 3 ~SKIP1~0))) [2020-11-06 22:25:55,411 INFO L266 CegarLoopResult]: For program point L340-1(lines 339 349) no Hoare annotation was computed. [2020-11-06 22:25:55,411 INFO L266 CegarLoopResult]: For program point L398(lines 398 402) no Hoare annotation was computed. [2020-11-06 22:25:55,411 INFO L266 CegarLoopResult]: For program point L332(lines 332 335) no Hoare annotation was computed. [2020-11-06 22:25:55,411 INFO L262 CegarLoopResult]: At program point L332-2(lines 332 335) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (= ~NP~0 1) (= ~pended~0 0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= main_~status~1 0) (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0) (<= 5 ~MPR1~0)) (not (= |old(~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)|))) [2020-11-06 22:25:55,412 INFO L262 CegarLoopResult]: At program point L457(lines 456 473) the Hoare annotation is: (let ((.cse1 (not (<= 3 ~SKIP1~0))) (.cse2 (not (= ~NP~0 1))) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse0 (= ~compRegistered~0 0)) (.cse4 (not (<= ~SKIP1~0 3))) (.cse5 (not (= ~pended~0 0)))) (and (or (= ~MPR1~0 ~s~0) .cse0 (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5) (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) (not .cse0) .cse4 .cse5))) [2020-11-06 22:25:55,412 INFO L266 CegarLoopResult]: For program point L445(lines 445 448) no Hoare annotation was computed. [2020-11-06 22:25:55,412 INFO L266 CegarLoopResult]: For program point L445-1(lines 445 448) no Hoare annotation was computed. [2020-11-06 22:25:55,412 INFO L262 CegarLoopResult]: At program point IofCallDriverENTRY(lines 437 500) the Hoare annotation is: (let ((.cse0 (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (.cse1 (= ~setEventCalled~0 |old(~setEventCalled~0)|)) (.cse3 (not (<= 3 ~SKIP1~0))) (.cse4 (not (= ~NP~0 1))) (.cse5 (not (<= 4 ~SKIP2~0))) (.cse2 (= ~compRegistered~0 0)) (.cse6 (not (<= ~SKIP1~0 3))) (.cse7 (not (= ~pended~0 0)))) (and (or (and .cse0 .cse1 (= ~s~0 ~NP~0)) .cse2 (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) .cse3 .cse4 .cse5 .cse6 .cse7) (or (and .cse0 .cse1 (= ~SKIP1~0 ~s~0)) .cse3 .cse4 .cse5 (not (= ~SKIP1~0 |old(~s~0)|)) (not .cse2) .cse6 .cse7))) [2020-11-06 22:25:55,412 INFO L266 CegarLoopResult]: For program point IofCallDriverFINAL(lines 437 500) no Hoare annotation was computed. [2020-11-06 22:25:55,412 INFO L266 CegarLoopResult]: For program point L479(lines 479 496) no Hoare annotation was computed. [2020-11-06 22:25:55,412 INFO L262 CegarLoopResult]: At program point L446(line 446) the Hoare annotation is: (let ((.cse3 (= ~compRegistered~0 0)) (.cse0 (not (<= 3 ~SKIP1~0))) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse4 (not (<= ~SKIP1~0 3))) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) (not .cse3) .cse4 .cse5) (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~NP~0)) .cse3 (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) .cse0 .cse1 .cse2 .cse4 .cse5))) [2020-11-06 22:25:55,412 INFO L266 CegarLoopResult]: For program point L446-1(line 446) no Hoare annotation was computed. [2020-11-06 22:25:55,412 INFO L262 CegarLoopResult]: At program point L471(lines 444 499) the Hoare annotation is: (let ((.cse1 (not (<= 3 ~SKIP1~0))) (.cse2 (not (= ~NP~0 1))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse0 (= ~compRegistered~0 0)) (.cse5 (not (<= ~SKIP1~0 3))) (.cse6 (not (= ~pended~0 0)))) (and (let ((.cse3 (= ~MPR1~0 ~s~0))) (or .cse0 (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 (and .cse3 (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0)) (and (<= IofCallDriver_~returnVal2~0 0) .cse3) .cse4 .cse5 .cse6)) (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) .cse1 .cse2 .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) (not .cse0) .cse5 .cse6))) [2020-11-06 22:25:55,413 INFO L266 CegarLoopResult]: For program point IofCallDriverEXIT(lines 437 500) no Hoare annotation was computed. [2020-11-06 22:25:55,413 INFO L262 CegarLoopResult]: At program point L459(lines 458 473) the Hoare annotation is: (let ((.cse1 (not (<= 3 ~SKIP1~0))) (.cse2 (not (= ~NP~0 1))) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse0 (= ~compRegistered~0 0)) (.cse4 (not (<= ~SKIP1~0 3))) (.cse5 (not (= ~pended~0 0)))) (and (or (and (= ~MPR1~0 ~s~0) (= ~setEventCalled~0 1)) .cse0 (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5) (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) (not .cse0) .cse4 .cse5))) [2020-11-06 22:25:55,413 INFO L266 CegarLoopResult]: For program point L488(lines 488 495) no Hoare annotation was computed. [2020-11-06 22:25:55,413 INFO L266 CegarLoopResult]: For program point L451(lines 451 474) no Hoare annotation was computed. [2020-11-06 22:25:55,413 INFO L266 CegarLoopResult]: For program point L480(lines 480 486) no Hoare annotation was computed. [2020-11-06 22:25:55,413 INFO L262 CegarLoopResult]: At program point L447(line 447) the Hoare annotation is: (let ((.cse3 (= ~compRegistered~0 0)) (.cse0 (not (<= 3 ~SKIP1~0))) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse4 (not (<= ~SKIP1~0 3))) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) (not .cse3) .cse4 .cse5) (or .cse3 (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) .cse0 .cse1 .cse2 .cse4 (and (= ~setEventCalled~0 1) (= ~s~0 |old(~s~0)|)) .cse5))) [2020-11-06 22:25:55,413 INFO L262 CegarLoopResult]: At program point L493(line 493) the Hoare annotation is: (let ((.cse3 (= ~compRegistered~0 0)) (.cse0 (not (<= 3 ~SKIP1~0))) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse4 (not (<= ~SKIP1~0 3))) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) (not .cse3) .cse4 .cse5) (or .cse3 (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) .cse0 .cse1 .cse2 .cse4 .cse5))) [2020-11-06 22:25:55,413 INFO L266 CegarLoopResult]: For program point L493-1(lines 475 497) no Hoare annotation was computed. [2020-11-06 22:25:55,413 INFO L266 CegarLoopResult]: For program point L456(lines 456 473) no Hoare annotation was computed. [2020-11-06 22:25:55,414 INFO L262 CegarLoopResult]: At program point L452(lines 451 474) the Hoare annotation is: (let ((.cse1 (not (<= 3 ~SKIP1~0))) (.cse2 (not (= ~NP~0 1))) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse0 (= ~compRegistered~0 0)) (.cse4 (not (<= ~SKIP1~0 3))) (.cse5 (not (= ~pended~0 0)))) (and (or (= ~MPR1~0 ~s~0) .cse0 (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5) (or (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) (not .cse0) .cse4 .cse5))) [2020-11-06 22:25:55,414 INFO L262 CegarLoopResult]: At program point L431(line 431) the Hoare annotation is: (or (= ~compRegistered~0 0) (not (= ~setEventCalled~0 1)) (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-11-06 22:25:55,414 INFO L266 CegarLoopResult]: For program point L431-1(lines 423 436) no Hoare annotation was computed. [2020-11-06 22:25:55,414 INFO L262 CegarLoopResult]: At program point stubMoreProcessingRequiredENTRY(lines 423 436) the Hoare annotation is: (or (= ~compRegistered~0 0) (not (= ~setEventCalled~0 1)) (= ~s~0 ~NP~0) (not (<= 5 ~MPR1~0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-11-06 22:25:55,414 INFO L266 CegarLoopResult]: For program point stubMoreProcessingRequiredEXIT(lines 423 436) no Hoare annotation was computed. [2020-11-06 22:25:55,414 INFO L266 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-11-06 22:25:55,415 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.offset| |old(#t~string5.offset)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= ~NP~0 |old(~NP~0)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#valid)| |#valid|) (= ~IPC~0 |old(~IPC~0)|) (= |#t~string5.base| |old(#t~string5.base)|) (= ~DC~0 |old(~DC~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= ~Executive~0 |old(~Executive~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~compRegistered~0 |old(~compRegistered~0)|) (= ~SKIP2~0 |old(~SKIP2~0)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= ~MPR3~0 |old(~MPR3~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= ~SKIP1~0 |old(~SKIP1~0)|) (= ~pended~0 |old(~pended~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~customIrp~0 |old(~customIrp~0)|) (= ~UNLOADED~0 |old(~UNLOADED~0)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-11-06 22:25:55,415 INFO L266 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-11-06 22:25:55,415 INFO L262 CegarLoopResult]: At program point L543(line 543) the Hoare annotation is: (or (not (= |old(~setEventCalled~0)| 1)) (= ~compRegistered~0 0) (not (<= 5 ~MPR1~0)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (= ~MPR3~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-11-06 22:25:55,415 INFO L266 CegarLoopResult]: For program point L541(lines 541 545) no Hoare annotation was computed. [2020-11-06 22:25:55,415 INFO L266 CegarLoopResult]: For program point L541-1(lines 528 547) no Hoare annotation was computed. [2020-11-06 22:25:55,415 INFO L266 CegarLoopResult]: For program point KeWaitForSingleObjectEXIT(lines 523 564) no Hoare annotation was computed. [2020-11-06 22:25:55,415 INFO L266 CegarLoopResult]: For program point L529(lines 529 534) no Hoare annotation was computed. [2020-11-06 22:25:55,415 INFO L266 CegarLoopResult]: For program point L550(lines 550 562) no Hoare annotation was computed. [2020-11-06 22:25:55,415 INFO L266 CegarLoopResult]: For program point KeWaitForSingleObjectFINAL(lines 523 564) no Hoare annotation was computed. [2020-11-06 22:25:55,416 INFO L262 CegarLoopResult]: At program point L536(lines 528 547) the Hoare annotation is: (or (not (= |old(~setEventCalled~0)| 1)) (= ~compRegistered~0 0) (not (<= 5 ~MPR1~0)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (= ~MPR3~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-11-06 22:25:55,416 INFO L266 CegarLoopResult]: For program point L528(lines 528 547) no Hoare annotation was computed. [2020-11-06 22:25:55,416 INFO L262 CegarLoopResult]: At program point L553(lines 552 562) the Hoare annotation is: (or (not (= |old(~setEventCalled~0)| 1)) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (not (<= 5 ~MPR1~0)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (= ~MPR3~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-11-06 22:25:55,416 INFO L262 CegarLoopResult]: At program point L551(lines 550 562) the Hoare annotation is: (or (not (= |old(~setEventCalled~0)| 1)) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (not (<= 5 ~MPR1~0)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (= ~MPR3~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-11-06 22:25:55,416 INFO L262 CegarLoopResult]: At program point KeWaitForSingleObjectENTRY(lines 523 564) the Hoare annotation is: (or (not (= |old(~setEventCalled~0)| 1)) (= ~compRegistered~0 0) (not (<= 5 ~MPR1~0)) (not (<= 3 ~SKIP1~0)) (and (= ~MPR3~0 ~s~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (= ~NP~0 1)) (not (= ~MPR3~0 |old(~s~0)|)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-11-06 22:25:55,416 INFO L262 CegarLoopResult]: At program point L509(line 509) the Hoare annotation is: (or (= ~compRegistered~0 0) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-11-06 22:25:55,416 INFO L266 CegarLoopResult]: For program point L509-1(lines 501 514) no Hoare annotation was computed. [2020-11-06 22:25:55,417 INFO L262 CegarLoopResult]: At program point IofCompleteRequestENTRY(lines 501 514) the Hoare annotation is: (or (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-11-06 22:25:55,417 INFO L266 CegarLoopResult]: For program point L505(lines 505 511) no Hoare annotation was computed. [2020-11-06 22:25:55,417 INFO L266 CegarLoopResult]: For program point IofCompleteRequestEXIT(lines 501 514) no Hoare annotation was computed. [2020-11-06 22:25:55,417 INFO L266 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-11-06 22:25:55,417 INFO L262 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= ~MPR3~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0)) [2020-11-06 22:25:55,417 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-06 22:25:55,417 INFO L266 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-11-06 22:25:55,417 INFO L266 CegarLoopResult]: For program point L192(lines 192 198) no Hoare annotation was computed. [2020-11-06 22:25:55,417 INFO L266 CegarLoopResult]: For program point L159(lines 159 265) no Hoare annotation was computed. [2020-11-06 22:25:55,418 INFO L266 CegarLoopResult]: For program point L126(lines 126 276) no Hoare annotation was computed. [2020-11-06 22:25:55,418 INFO L266 CegarLoopResult]: For program point L192-2(lines 166 261) no Hoare annotation was computed. [2020-11-06 22:25:55,418 INFO L262 CegarLoopResult]: At program point L242(line 242) the Hoare annotation is: (or (and (= ~compRegistered~0 0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-11-06 22:25:55,418 INFO L266 CegarLoopResult]: For program point L242-1(line 242) no Hoare annotation was computed. [2020-11-06 22:25:55,418 INFO L266 CegarLoopResult]: For program point L176(lines 176 182) no Hoare annotation was computed. [2020-11-06 22:25:55,418 INFO L266 CegarLoopResult]: For program point L176-1(lines 171 183) no Hoare annotation was computed. [2020-11-06 22:25:55,418 INFO L266 CegarLoopResult]: For program point L201(lines 201 205) no Hoare annotation was computed. [2020-11-06 22:25:55,418 INFO L266 CegarLoopResult]: For program point L135(lines 135 273) no Hoare annotation was computed. [2020-11-06 22:25:55,418 INFO L266 CegarLoopResult]: For program point L102(lines 102 284) no Hoare annotation was computed. [2020-11-06 22:25:55,418 INFO L262 CegarLoopResult]: At program point L226(lines 226 227) the Hoare annotation is: (or (and (= ~compRegistered~0 0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-11-06 22:25:55,419 INFO L266 CegarLoopResult]: For program point L226-1(lines 226 227) no Hoare annotation was computed. [2020-11-06 22:25:55,419 INFO L262 CegarLoopResult]: At program point L251(line 251) the Hoare annotation is: (or (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-11-06 22:25:55,419 INFO L266 CegarLoopResult]: For program point L251-1(lines 247 253) no Hoare annotation was computed. [2020-11-06 22:25:55,419 INFO L266 CegarLoopResult]: For program point L144(lines 144 270) no Hoare annotation was computed. [2020-11-06 22:25:55,419 INFO L266 CegarLoopResult]: For program point L111(lines 111 281) no Hoare annotation was computed. [2020-11-06 22:25:55,419 INFO L262 CegarLoopResult]: At program point L103(lines 102 284) 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 (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-11-06 22:25:55,419 INFO L262 CegarLoopResult]: At program point L194(lines 194 196) the Hoare annotation is: (let ((.cse0 (not (<= 5 ~MPR1~0))) (.cse1 (not (= |old(~compRegistered~0)| 0))) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse3 (not (<= 3 ~SKIP1~0))) (.cse4 (not (= ~NP~0 1))) (.cse5 (not (<= 4 ~SKIP2~0))) (.cse6 (not (<= ~SKIP1~0 3))) (.cse7 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ ~myStatus~0 1073741637) 0) (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse7) (or (and (= ~MPR3~0 ~s~0) (<= 259 KbFilter_PnP_~status~0) (= ~setEventCalled~0 1) (= KbFilter_PnP_~__cil_tmp23~0 259) (not (= ~compRegistered~0 0))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2020-11-06 22:25:55,420 INFO L266 CegarLoopResult]: For program point L194-1(lines 194 196) no Hoare annotation was computed. [2020-11-06 22:25:55,420 INFO L266 CegarLoopResult]: For program point L153(lines 153 267) no Hoare annotation was computed. [2020-11-06 22:25:55,420 INFO L266 CegarLoopResult]: For program point L120(lines 120 278) no Hoare annotation was computed. [2020-11-06 22:25:55,420 INFO L262 CegarLoopResult]: At program point L211(line 211) the Hoare annotation is: (or (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (and (= ~s~0 ~NP~0) (not (= ~compRegistered~0 0))) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-11-06 22:25:55,420 INFO L262 CegarLoopResult]: At program point L178(line 178) the Hoare annotation is: (or (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-11-06 22:25:55,420 INFO L266 CegarLoopResult]: For program point KbFilter_PnPEXIT(lines 75 287) no Hoare annotation was computed. [2020-11-06 22:25:55,420 INFO L262 CegarLoopResult]: At program point L236(line 236) the Hoare annotation is: (or (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-11-06 22:25:55,420 INFO L266 CegarLoopResult]: For program point L236-1(lines 232 238) no Hoare annotation was computed. [2020-11-06 22:25:55,420 INFO L266 CegarLoopResult]: For program point L162(lines 162 264) no Hoare annotation was computed. [2020-11-06 22:25:55,421 INFO L266 CegarLoopResult]: For program point L129(lines 129 275) no Hoare annotation was computed. [2020-11-06 22:25:55,421 INFO L262 CegarLoopResult]: At program point L220(line 220) the Hoare annotation is: (or (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-11-06 22:25:55,421 INFO L262 CegarLoopResult]: At program point L187(lines 187 188) the Hoare annotation is: (let ((.cse0 (not (<= 5 ~MPR1~0))) (.cse1 (not (= |old(~compRegistered~0)| 0))) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse3 (not (<= 3 ~SKIP1~0))) (.cse4 (not (= ~NP~0 1))) (.cse5 (not (<= 4 ~SKIP2~0))) (.cse6 (not (<= ~SKIP1~0 3))) (.cse7 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ ~myStatus~0 1073741637) 0) (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse7) (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)|) (not (= ~compRegistered~0 0)))))) [2020-11-06 22:25:55,421 INFO L266 CegarLoopResult]: For program point L220-1(lines 216 222) no Hoare annotation was computed. [2020-11-06 22:25:55,421 INFO L266 CegarLoopResult]: For program point L187-1(lines 187 188) no Hoare annotation was computed. [2020-11-06 22:25:55,421 INFO L262 CegarLoopResult]: At program point KbFilter_PnPENTRY(lines 75 287) 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 (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-11-06 22:25:55,421 INFO L266 CegarLoopResult]: For program point L171(lines 171 183) no Hoare annotation was computed. [2020-11-06 22:25:55,421 INFO L266 CegarLoopResult]: For program point L138(lines 138 272) no Hoare annotation was computed. [2020-11-06 22:25:55,422 INFO L266 CegarLoopResult]: For program point L105(lines 105 283) no Hoare annotation was computed. [2020-11-06 22:25:55,422 INFO L266 CegarLoopResult]: For program point KbFilter_PnPFINAL(lines 75 287) no Hoare annotation was computed. [2020-11-06 22:25:55,422 INFO L269 CegarLoopResult]: At program point L262(lines 166 263) the Hoare annotation is: true [2020-11-06 22:25:55,422 INFO L266 CegarLoopResult]: For program point L147(lines 147 269) no Hoare annotation was computed. [2020-11-06 22:25:55,422 INFO L266 CegarLoopResult]: For program point L114(lines 114 280) no Hoare annotation was computed. [2020-11-06 22:25:55,422 INFO L262 CegarLoopResult]: At program point L106(lines 105 283) 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 (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-11-06 22:25:55,422 INFO L266 CegarLoopResult]: For program point L156(lines 156 266) no Hoare annotation was computed. [2020-11-06 22:25:55,422 INFO L266 CegarLoopResult]: For program point L123(lines 123 277) no Hoare annotation was computed. [2020-11-06 22:25:55,422 INFO L262 CegarLoopResult]: At program point L173(line 173) the Hoare annotation is: (or (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-11-06 22:25:55,423 INFO L262 CegarLoopResult]: At program point L165(lines 111 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 (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-11-06 22:25:55,423 INFO L266 CegarLoopResult]: For program point L132(lines 132 274) no Hoare annotation was computed. [2020-11-06 22:25:55,423 INFO L266 CegarLoopResult]: For program point L141(lines 141 271) no Hoare annotation was computed. [2020-11-06 22:25:55,423 INFO L266 CegarLoopResult]: For program point L108(lines 108 282) no Hoare annotation was computed. [2020-11-06 22:25:55,423 INFO L266 CegarLoopResult]: For program point L232(lines 232 238) no Hoare annotation was computed. [2020-11-06 22:25:55,423 INFO L262 CegarLoopResult]: At program point L257(lines 257 258) the Hoare annotation is: (or (and (= ~compRegistered~0 0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0)) (not (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-11-06 22:25:55,423 INFO L266 CegarLoopResult]: For program point L257-1(lines 257 258) no Hoare annotation was computed. [2020-11-06 22:25:55,423 INFO L266 CegarLoopResult]: For program point L216(lines 216 222) no Hoare annotation was computed. [2020-11-06 22:25:55,423 INFO L266 CegarLoopResult]: For program point L150(lines 150 268) no Hoare annotation was computed. [2020-11-06 22:25:55,423 INFO L266 CegarLoopResult]: For program point L117(lines 117 279) no Hoare annotation was computed. [2020-11-06 22:25:55,424 INFO L262 CegarLoopResult]: At program point L109(lines 108 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 (<= 5 ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 3 ~SKIP1~0)) (not (= ~NP~0 1)) (not (<= 4 ~SKIP2~0)) (not (<= ~SKIP1~0 3)) (not (= ~pended~0 0))) [2020-11-06 22:25:55,424 INFO L266 CegarLoopResult]: For program point L200(lines 200 206) no Hoare annotation was computed. [2020-11-06 22:25:55,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:25:55 BoogieIcfgContainer [2020-11-06 22:25:55,457 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-06 22:25:55,458 INFO L168 Benchmark]: Toolchain (without parser) took 30357.97 ms. Allocated memory was 151.0 MB in the beginning and 388.0 MB in the end (delta: 237.0 MB). Free memory was 126.1 MB in the beginning and 254.2 MB in the end (delta: -128.0 MB). Peak memory consumption was 228.8 MB. Max. memory is 8.0 GB. [2020-11-06 22:25:55,459 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 151.0 MB. Free memory is still 124.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-06 22:25:55,459 INFO L168 Benchmark]: CACSL2BoogieTranslator took 524.36 ms. Allocated memory is still 151.0 MB. Free memory was 125.5 MB in the beginning and 111.2 MB in the end (delta: 14.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-11-06 22:25:55,460 INFO L168 Benchmark]: Boogie Preprocessor took 63.19 ms. Allocated memory is still 151.0 MB. Free memory was 111.2 MB in the beginning and 108.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-06 22:25:55,460 INFO L168 Benchmark]: RCFGBuilder took 1156.39 ms. Allocated memory is still 151.0 MB. Free memory was 108.9 MB in the beginning and 95.8 MB in the end (delta: 13.1 MB). Peak memory consumption was 12.8 MB. Max. memory is 8.0 GB. [2020-11-06 22:25:55,461 INFO L168 Benchmark]: TraceAbstraction took 28598.71 ms. Allocated memory was 151.0 MB in the beginning and 388.0 MB in the end (delta: 237.0 MB). Free memory was 95.3 MB in the beginning and 254.2 MB in the end (delta: -158.9 MB). Peak memory consumption was 198.1 MB. Max. memory is 8.0 GB. [2020-11-06 22:25:55,463 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 151.0 MB. Free memory is still 124.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 524.36 ms. Allocated memory is still 151.0 MB. Free memory was 125.5 MB in the beginning and 111.2 MB in the end (delta: 14.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 63.19 ms. Allocated memory is still 151.0 MB. Free memory was 111.2 MB in the beginning and 108.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1156.39 ms. Allocated memory is still 151.0 MB. Free memory was 108.9 MB in the beginning and 95.8 MB in the end (delta: 13.1 MB). Peak memory consumption was 12.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 28598.71 ms. Allocated memory was 151.0 MB in the beginning and 388.0 MB in the end (delta: 237.0 MB). Free memory was 95.3 MB in the beginning and 254.2 MB in the end (delta: -158.9 MB). Peak memory consumption was 198.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: 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: 105]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || !(5 <= MPR1)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(3 <= SKIP1)) || !(NP == 1)) || !(4 <= SKIP2)) || !(SKIP1 <= 3)) || !(pended == 0) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: (((((!(\old(s) == \old(MPR3)) || !(\old(pended) == 0)) || (((((((((NP == 1 && pended == 0) && 4 <= SKIP2) && compRegistered == 0) && s == NP) && status == 0) && SKIP1 <= 3) && __cil_tmp8 == 1) && 3 <= SKIP1) && 5 <= MPR1)) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP)) - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: ((((((((MPR1 == s || compRegistered == 0) || !(5 <= MPR1)) || !(NP == \old(s))) || !(3 <= SKIP1)) || !(NP == 1)) || !(4 <= SKIP2)) || !(SKIP1 <= 3)) || !(pended == 0)) && (((((((((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s) || !(3 <= SKIP1)) || !(NP == 1)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) || !(SKIP1 <= 3)) || !(pended == 0)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: ((((((((((pended == 0 && NP == 1) && 4 <= SKIP2) && SKIP1 <= 3) && __cil_tmp8 == 1) && 3 <= SKIP1) || !(\old(s) == \old(MPR3))) || !(\old(pended) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP)) - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: ((((((((!(\old(setEventCalled) == 1) || compRegistered == 0) || s == NP) || !(5 <= MPR1)) || !(3 <= SKIP1)) || !(NP == 1)) || !(MPR3 == \old(s))) || !(4 <= SKIP2)) || !(SKIP1 <= 3)) || !(pended == 0) - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: (((((!(\old(s) == \old(MPR3)) || !(\old(pended) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || (((((NP == 1 && pended == 0) && 4 <= SKIP2) && SKIP1 <= 3) && __cil_tmp8 == 1) && 3 <= SKIP1) - InvariantResult [Line: 297]: Loop Invariant Derived loop invariant: (((((!(\old(s) == \old(MPR3)) || !(\old(pended) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || (((((NP == 1 && pended == 0) && 4 <= SKIP2) && SKIP1 <= 3) && __cil_tmp8 == 1) && 3 <= SKIP1) - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: (((((!(\old(s) == \old(MPR3)) || !(\old(pended) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || status == 0) || !(\old(s) == \old(NP)) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || !(5 <= MPR1)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(3 <= SKIP1)) || !(NP == 1)) || !(4 <= SKIP2)) || !(SKIP1 <= 3)) || !(pended == 0) - InvariantResult [Line: 444]: Loop Invariant Derived loop invariant: (((((((((compRegistered == 0 || !(5 <= MPR1)) || !(NP == \old(s))) || !(3 <= SKIP1)) || !(NP == 1)) || (((MPR1 == s && setEventCalled == 1) && returnVal2 <= 259) && 259 <= returnVal2)) || (returnVal2 <= 0 && MPR1 == s)) || !(4 <= SKIP2)) || !(SKIP1 <= 3)) || !(pended == 0)) && (((((((((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s) || !(3 <= SKIP1)) || !(NP == 1)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) || !(SKIP1 <= 3)) || !(pended == 0)) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: (((((((!(\old(setEventCalled) == 1) || compRegistered == 0) || !(5 <= MPR1)) || !(3 <= SKIP1)) || !(NP == 1)) || !(MPR3 == \old(s))) || !(4 <= SKIP2)) || !(SKIP1 <= 3)) || !(pended == 0) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || !(5 <= MPR1)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(3 <= SKIP1)) || !(NP == 1)) || !(4 <= SKIP2)) || !(SKIP1 <= 3)) || !(pended == 0) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: ((((((((MPR1 == s || compRegistered == 0) || !(5 <= MPR1)) || !(NP == \old(s))) || !(3 <= SKIP1)) || !(NP == 1)) || !(4 <= SKIP2)) || !(SKIP1 <= 3)) || !(pended == 0)) && (((((((((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s) || !(3 <= SKIP1)) || !(NP == 1)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) || !(SKIP1 <= 3)) || !(pended == 0)) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((((((((((((lowerDriverReturn == \old(lowerDriverReturn) && \old(compRegistered) == compRegistered) && setEventCalled == \old(setEventCalled)) && s == NP) && \old(customIrp) == customIrp) && myStatus == \old(myStatus)) || !(5 <= MPR1)) || !(\old(compRegistered) == 0)) || !(NP == \old(s))) || !(3 <= SKIP1)) || !(NP == 1)) || !(4 <= SKIP2)) || !(SKIP1 <= 3)) || !(pended == 0) - InvariantResult [Line: 458]: Loop Invariant Derived loop invariant: (((((((((MPR1 == s && setEventCalled == 1) || compRegistered == 0) || !(5 <= MPR1)) || !(NP == \old(s))) || !(3 <= SKIP1)) || !(NP == 1)) || !(4 <= SKIP2)) || !(SKIP1 <= 3)) || !(pended == 0)) && (((((((((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && SKIP1 == s) || !(3 <= SKIP1)) || !(NP == 1)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(compRegistered == 0)) || !(SKIP1 <= 3)) || !(pended == 0)) - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: ((((((((!(\old(setEventCalled) == 1) || compRegistered == 0) || s == NP) || !(5 <= MPR1)) || !(3 <= SKIP1)) || !(NP == 1)) || !(MPR3 == \old(s))) || !(4 <= SKIP2)) || !(SKIP1 <= 3)) || !(pended == 0) - InvariantResult [Line: 377]: Loop Invariant Derived loop invariant: (((((!(\old(s) == \old(MPR3)) || !(\old(pended) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || (((((NP == 1 && pended == 0) && 4 <= SKIP2) && SKIP1 <= 3) && __cil_tmp8 == 1) && 3 <= SKIP1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 14 procedures, 155 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 19.9s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2255 SDtfs, 3154 SDslu, 2727 SDs, 0 SdLazy, 5811 SolverSat, 872 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 356 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred 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.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 198 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 54 LocationsWithAnnotation, 305 PreInvPairs, 372 NumberOfFragments, 2525 HoareAnnotationTreeSize, 305 FomulaSimplifications, 9337 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 54 FomulaSimplificationsInter, 6864 FormulaSimplificationTreeSizeReductionInter, 7.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 937 NumberOfCodeBlocks, 937 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 919 ConstructedInterpolants, 0 QuantifiedInterpolants, 245663 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...