/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:20:10,194 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:20:10,198 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:20:10,215 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:20:10,216 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:20:10,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:20:10,221 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:20:10,228 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:20:10,232 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:20:10,233 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:20:10,234 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:20:10,236 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:20:10,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:20:10,237 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:20:10,239 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:20:10,240 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:20:10,241 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:20:10,242 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:20:10,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:20:10,245 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:20:10,246 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:20:10,247 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:20:10,249 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:20:10,249 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:20:10,251 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:20:10,252 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:20:10,252 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:20:10,253 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:20:10,253 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:20:10,254 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:20:10,254 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:20:10,255 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:20:10,256 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:20:10,256 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:20:10,257 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:20:10,257 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:20:10,258 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:20:10,258 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:20:10,258 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:20:10,259 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:20:10,260 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:20:10,261 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 [2019-11-23 22:20:10,275 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:20:10,275 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:20:10,276 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:20:10,276 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:20:10,277 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:20:10,277 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:20:10,277 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:20:10,277 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:20:10,277 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:20:10,278 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:20:10,278 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:20:10,278 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:20:10,278 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:20:10,278 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:20:10,278 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:20:10,279 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:20:10,279 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:20:10,279 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:20:10,279 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:20:10,279 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:20:10,280 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:20:10,280 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:20:10,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:20:10,280 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:20:10,280 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:20:10,281 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:20:10,281 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:20:10,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:20:10,281 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:20:10,281 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:20:10,553 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:20:10,566 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:20:10,569 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:20:10,571 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:20:10,571 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:20:10,572 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2019-11-23 22:20:10,643 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0954c40c6/af6cf2129c0a49c3b4bf143b1ff8a8ba/FLAGff247dbd6 [2019-11-23 22:20:11,182 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:20:11,185 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2019-11-23 22:20:11,204 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0954c40c6/af6cf2129c0a49c3b4bf143b1ff8a8ba/FLAGff247dbd6 [2019-11-23 22:20:11,465 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0954c40c6/af6cf2129c0a49c3b4bf143b1ff8a8ba [2019-11-23 22:20:11,473 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:20:11,474 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:20:11,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:20:11,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:20:11,480 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:20:11,481 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:20:11" (1/1) ... [2019-11-23 22:20:11,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58e7c61f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:20:11, skipping insertion in model container [2019-11-23 22:20:11,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:20:11" (1/1) ... [2019-11-23 22:20:11,493 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:20:11,547 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:20:11,907 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:20:11,915 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:20:12,070 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:20:12,091 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:20:12,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:20:12 WrapperNode [2019-11-23 22:20:12,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:20:12,093 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:20:12,093 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:20:12,093 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:20:12,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:20:12" (1/1) ... [2019-11-23 22:20:12,124 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:20:12" (1/1) ... [2019-11-23 22:20:12,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:20:12,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:20:12,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:20:12,206 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:20:12,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:20:12" (1/1) ... [2019-11-23 22:20:12,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:20:12" (1/1) ... [2019-11-23 22:20:12,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:20:12" (1/1) ... [2019-11-23 22:20:12,224 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:20:12" (1/1) ... [2019-11-23 22:20:12,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:20:12" (1/1) ... [2019-11-23 22:20:12,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:20:12" (1/1) ... [2019-11-23 22:20:12,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:20:12" (1/1) ... [2019-11-23 22:20:12,301 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:20:12,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:20:12,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:20:12,305 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:20:12,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:20:12" (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 [2019-11-23 22:20:12,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:20:12,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:20:12,647 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:20:12,657 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:20:12,667 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:20:12,673 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:20:12,676 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:20:12,683 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:20:12,691 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:20:12,701 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:20:12,705 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:20:12,712 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:20:12,717 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:20:12,726 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:20:13,755 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2019-11-23 22:20:13,755 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2019-11-23 22:20:13,755 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2019-11-23 22:20:13,756 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2019-11-23 22:20:13,756 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##219: assume false; [2019-11-23 22:20:13,756 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##220: assume !false; [2019-11-23 22:20:13,756 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2019-11-23 22:20:13,756 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2019-11-23 22:20:13,757 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##322: assume !false; [2019-11-23 22:20:13,757 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##321: assume false; [2019-11-23 22:20:13,757 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-23 22:20:13,758 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-23 22:20:13,758 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2019-11-23 22:20:13,758 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2019-11-23 22:20:13,758 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume !false; [2019-11-23 22:20:13,759 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##45: assume false; [2019-11-23 22:20:13,759 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##140: assume false; [2019-11-23 22:20:13,759 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##141: assume !false; [2019-11-23 22:20:13,759 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##389: assume !false; [2019-11-23 22:20:13,759 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##388: assume false; [2019-11-23 22:20:13,759 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-11-23 22:20:13,760 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-11-23 22:20:13,760 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##162: assume !false; [2019-11-23 22:20:13,760 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##161: assume false; [2019-11-23 22:20:13,762 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:20:13,762 INFO L284 CfgBuilder]: Removed 154 assume(true) statements. [2019-11-23 22:20:13,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:20:13 BoogieIcfgContainer [2019-11-23 22:20:13,763 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:20:13,765 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:20:13,765 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:20:13,767 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:20:13,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:20:11" (1/3) ... [2019-11-23 22:20:13,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ac2a90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:20:13, skipping insertion in model container [2019-11-23 22:20:13,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:20:12" (2/3) ... [2019-11-23 22:20:13,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ac2a90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:20:13, skipping insertion in model container [2019-11-23 22:20:13,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:20:13" (3/3) ... [2019-11-23 22:20:13,770 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-2.c [2019-11-23 22:20:13,778 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:20:13,786 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 30 error locations. [2019-11-23 22:20:13,798 INFO L249 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2019-11-23 22:20:13,829 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:20:13,829 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:20:13,830 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:20:13,830 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:20:13,830 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:20:13,830 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:20:13,830 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:20:13,830 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:20:13,865 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states. [2019-11-23 22:20:13,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-23 22:20:13,873 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:13,874 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:13,875 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:13,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:13,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1766777508, now seen corresponding path program 1 times [2019-11-23 22:20:13,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:13,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823859869] [2019-11-23 22:20:13,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:14,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:14,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823859869] [2019-11-23 22:20:14,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:14,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:20:14,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530953563] [2019-11-23 22:20:14,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:20:14,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:14,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:20:14,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:14,088 INFO L87 Difference]: Start difference. First operand 330 states. Second operand 3 states. [2019-11-23 22:20:14,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:14,235 INFO L93 Difference]: Finished difference Result 578 states and 842 transitions. [2019-11-23 22:20:14,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:20:14,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-23 22:20:14,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:14,254 INFO L225 Difference]: With dead ends: 578 [2019-11-23 22:20:14,255 INFO L226 Difference]: Without dead ends: 324 [2019-11-23 22:20:14,260 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:14,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-11-23 22:20:14,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2019-11-23 22:20:14,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-11-23 22:20:14,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 442 transitions. [2019-11-23 22:20:14,367 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 442 transitions. Word has length 11 [2019-11-23 22:20:14,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:14,367 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 442 transitions. [2019-11-23 22:20:14,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:20:14,368 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 442 transitions. [2019-11-23 22:20:14,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-23 22:20:14,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:14,371 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:14,372 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:14,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:14,372 INFO L82 PathProgramCache]: Analyzing trace with hash 557701687, now seen corresponding path program 1 times [2019-11-23 22:20:14,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:14,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667481893] [2019-11-23 22:20:14,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:14,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:14,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667481893] [2019-11-23 22:20:14,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:14,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:20:14,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490159409] [2019-11-23 22:20:14,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:20:14,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:14,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:20:14,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:14,503 INFO L87 Difference]: Start difference. First operand 324 states and 442 transitions. Second operand 3 states. [2019-11-23 22:20:14,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:14,748 INFO L93 Difference]: Finished difference Result 433 states and 577 transitions. [2019-11-23 22:20:14,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:20:14,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-23 22:20:14,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:14,752 INFO L225 Difference]: With dead ends: 433 [2019-11-23 22:20:14,752 INFO L226 Difference]: Without dead ends: 368 [2019-11-23 22:20:14,754 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:14,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-11-23 22:20:14,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 351. [2019-11-23 22:20:14,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-11-23 22:20:14,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 479 transitions. [2019-11-23 22:20:14,794 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 479 transitions. Word has length 13 [2019-11-23 22:20:14,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:14,795 INFO L462 AbstractCegarLoop]: Abstraction has 351 states and 479 transitions. [2019-11-23 22:20:14,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:20:14,795 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 479 transitions. [2019-11-23 22:20:14,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 22:20:14,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:14,797 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:14,797 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:14,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:14,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1900748477, now seen corresponding path program 1 times [2019-11-23 22:20:14,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:14,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076586168] [2019-11-23 22:20:14,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:14,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:14,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076586168] [2019-11-23 22:20:14,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:14,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:20:14,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307121941] [2019-11-23 22:20:14,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:20:14,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:14,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:20:14,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:14,864 INFO L87 Difference]: Start difference. First operand 351 states and 479 transitions. Second operand 3 states. [2019-11-23 22:20:14,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:14,928 INFO L93 Difference]: Finished difference Result 554 states and 735 transitions. [2019-11-23 22:20:14,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:20:14,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-23 22:20:14,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:14,932 INFO L225 Difference]: With dead ends: 554 [2019-11-23 22:20:14,932 INFO L226 Difference]: Without dead ends: 362 [2019-11-23 22:20:14,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:14,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-11-23 22:20:14,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 307. [2019-11-23 22:20:14,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-11-23 22:20:14,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 421 transitions. [2019-11-23 22:20:14,966 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 421 transitions. Word has length 15 [2019-11-23 22:20:14,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:14,967 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 421 transitions. [2019-11-23 22:20:14,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:20:14,967 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 421 transitions. [2019-11-23 22:20:14,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 22:20:14,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:15,001 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:15,001 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:15,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:15,002 INFO L82 PathProgramCache]: Analyzing trace with hash 306593718, now seen corresponding path program 1 times [2019-11-23 22:20:15,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:15,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059129728] [2019-11-23 22:20:15,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:15,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:15,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059129728] [2019-11-23 22:20:15,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:15,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:20:15,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136980953] [2019-11-23 22:20:15,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:20:15,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:15,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:20:15,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:15,079 INFO L87 Difference]: Start difference. First operand 307 states and 421 transitions. Second operand 3 states. [2019-11-23 22:20:15,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:15,209 INFO L93 Difference]: Finished difference Result 307 states and 421 transitions. [2019-11-23 22:20:15,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:20:15,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-23 22:20:15,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:15,212 INFO L225 Difference]: With dead ends: 307 [2019-11-23 22:20:15,212 INFO L226 Difference]: Without dead ends: 293 [2019-11-23 22:20:15,213 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:15,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-11-23 22:20:15,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2019-11-23 22:20:15,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-11-23 22:20:15,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 407 transitions. [2019-11-23 22:20:15,228 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 407 transitions. Word has length 21 [2019-11-23 22:20:15,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:15,229 INFO L462 AbstractCegarLoop]: Abstraction has 293 states and 407 transitions. [2019-11-23 22:20:15,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:20:15,229 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 407 transitions. [2019-11-23 22:20:15,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:20:15,230 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:15,230 INFO L410 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] [2019-11-23 22:20:15,231 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:15,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:15,231 INFO L82 PathProgramCache]: Analyzing trace with hash 847063989, now seen corresponding path program 1 times [2019-11-23 22:20:15,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:15,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966781642] [2019-11-23 22:20:15,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:15,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:15,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966781642] [2019-11-23 22:20:15,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:15,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:20:15,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420678008] [2019-11-23 22:20:15,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:20:15,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:15,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:20:15,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:15,286 INFO L87 Difference]: Start difference. First operand 293 states and 407 transitions. Second operand 3 states. [2019-11-23 22:20:15,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:15,314 INFO L93 Difference]: Finished difference Result 304 states and 421 transitions. [2019-11-23 22:20:15,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:20:15,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-23 22:20:15,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:15,317 INFO L225 Difference]: With dead ends: 304 [2019-11-23 22:20:15,317 INFO L226 Difference]: Without dead ends: 288 [2019-11-23 22:20:15,317 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:15,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-11-23 22:20:15,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 264. [2019-11-23 22:20:15,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-11-23 22:20:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 376 transitions. [2019-11-23 22:20:15,334 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 376 transitions. Word has length 26 [2019-11-23 22:20:15,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:15,336 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 376 transitions. [2019-11-23 22:20:15,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:20:15,336 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 376 transitions. [2019-11-23 22:20:15,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:20:15,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:15,337 INFO L410 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] [2019-11-23 22:20:15,338 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:15,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:15,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1660315800, now seen corresponding path program 1 times [2019-11-23 22:20:15,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:15,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14227291] [2019-11-23 22:20:15,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:15,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:15,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14227291] [2019-11-23 22:20:15,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:15,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:20:15,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940994188] [2019-11-23 22:20:15,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:20:15,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:15,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:20:15,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:15,414 INFO L87 Difference]: Start difference. First operand 264 states and 376 transitions. Second operand 3 states. [2019-11-23 22:20:15,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:15,528 INFO L93 Difference]: Finished difference Result 307 states and 430 transitions. [2019-11-23 22:20:15,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:20:15,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-23 22:20:15,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:15,530 INFO L225 Difference]: With dead ends: 307 [2019-11-23 22:20:15,530 INFO L226 Difference]: Without dead ends: 261 [2019-11-23 22:20:15,531 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:15,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-11-23 22:20:15,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2019-11-23 22:20:15,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-11-23 22:20:15,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 372 transitions. [2019-11-23 22:20:15,547 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 372 transitions. Word has length 27 [2019-11-23 22:20:15,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:15,547 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 372 transitions. [2019-11-23 22:20:15,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:20:15,548 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 372 transitions. [2019-11-23 22:20:15,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:20:15,549 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:15,549 INFO L410 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] [2019-11-23 22:20:15,549 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:15,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:15,550 INFO L82 PathProgramCache]: Analyzing trace with hash -23036524, now seen corresponding path program 1 times [2019-11-23 22:20:15,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:15,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419922625] [2019-11-23 22:20:15,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:15,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:15,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419922625] [2019-11-23 22:20:15,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:15,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:20:15,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687833982] [2019-11-23 22:20:15,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:20:15,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:15,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:20:15,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:15,580 INFO L87 Difference]: Start difference. First operand 261 states and 372 transitions. Second operand 3 states. [2019-11-23 22:20:15,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:15,625 INFO L93 Difference]: Finished difference Result 325 states and 450 transitions. [2019-11-23 22:20:15,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:20:15,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-23 22:20:15,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:15,628 INFO L225 Difference]: With dead ends: 325 [2019-11-23 22:20:15,628 INFO L226 Difference]: Without dead ends: 275 [2019-11-23 22:20:15,628 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:15,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-11-23 22:20:15,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2019-11-23 22:20:15,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-11-23 22:20:15,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 371 transitions. [2019-11-23 22:20:15,643 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 371 transitions. Word has length 27 [2019-11-23 22:20:15,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:15,643 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 371 transitions. [2019-11-23 22:20:15,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:20:15,644 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 371 transitions. [2019-11-23 22:20:15,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:20:15,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:15,645 INFO L410 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] [2019-11-23 22:20:15,645 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:15,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:15,646 INFO L82 PathProgramCache]: Analyzing trace with hash 489558487, now seen corresponding path program 1 times [2019-11-23 22:20:15,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:15,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403040324] [2019-11-23 22:20:15,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:15,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:15,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:15,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403040324] [2019-11-23 22:20:15,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:15,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:20:15,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204164414] [2019-11-23 22:20:15,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:20:15,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:15,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:20:15,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:15,688 INFO L87 Difference]: Start difference. First operand 261 states and 371 transitions. Second operand 3 states. [2019-11-23 22:20:15,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:15,815 INFO L93 Difference]: Finished difference Result 276 states and 387 transitions. [2019-11-23 22:20:15,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:20:15,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-23 22:20:15,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:15,817 INFO L225 Difference]: With dead ends: 276 [2019-11-23 22:20:15,817 INFO L226 Difference]: Without dead ends: 249 [2019-11-23 22:20:15,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:15,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-11-23 22:20:15,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2019-11-23 22:20:15,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-11-23 22:20:15,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 347 transitions. [2019-11-23 22:20:15,831 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 347 transitions. Word has length 27 [2019-11-23 22:20:15,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:15,831 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 347 transitions. [2019-11-23 22:20:15,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:20:15,832 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 347 transitions. [2019-11-23 22:20:15,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 22:20:15,833 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:15,833 INFO L410 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] [2019-11-23 22:20:15,833 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:15,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:15,834 INFO L82 PathProgramCache]: Analyzing trace with hash 403678015, now seen corresponding path program 1 times [2019-11-23 22:20:15,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:15,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651012155] [2019-11-23 22:20:15,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:15,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:15,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651012155] [2019-11-23 22:20:15,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:15,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:20:15,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723166029] [2019-11-23 22:20:15,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:20:15,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:15,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:20:15,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:20:15,882 INFO L87 Difference]: Start difference. First operand 249 states and 347 transitions. Second operand 5 states. [2019-11-23 22:20:16,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:16,107 INFO L93 Difference]: Finished difference Result 410 states and 537 transitions. [2019-11-23 22:20:16,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:20:16,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-23 22:20:16,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:16,110 INFO L225 Difference]: With dead ends: 410 [2019-11-23 22:20:16,110 INFO L226 Difference]: Without dead ends: 359 [2019-11-23 22:20:16,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:20:16,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-11-23 22:20:16,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 284. [2019-11-23 22:20:16,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-11-23 22:20:16,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 399 transitions. [2019-11-23 22:20:16,134 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 399 transitions. Word has length 30 [2019-11-23 22:20:16,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:16,141 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 399 transitions. [2019-11-23 22:20:16,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:20:16,142 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 399 transitions. [2019-11-23 22:20:16,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 22:20:16,143 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:16,143 INFO L410 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] [2019-11-23 22:20:16,143 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:16,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:16,144 INFO L82 PathProgramCache]: Analyzing trace with hash 361661719, now seen corresponding path program 1 times [2019-11-23 22:20:16,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:16,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972520214] [2019-11-23 22:20:16,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:16,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:16,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972520214] [2019-11-23 22:20:16,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:16,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:20:16,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466926815] [2019-11-23 22:20:16,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:20:16,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:16,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:20:16,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:20:16,194 INFO L87 Difference]: Start difference. First operand 284 states and 399 transitions. Second operand 5 states. [2019-11-23 22:20:16,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:16,403 INFO L93 Difference]: Finished difference Result 341 states and 456 transitions. [2019-11-23 22:20:16,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:20:16,404 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-23 22:20:16,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:16,407 INFO L225 Difference]: With dead ends: 341 [2019-11-23 22:20:16,407 INFO L226 Difference]: Without dead ends: 315 [2019-11-23 22:20:16,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:20:16,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-23 22:20:16,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 271. [2019-11-23 22:20:16,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-11-23 22:20:16,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 381 transitions. [2019-11-23 22:20:16,425 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 381 transitions. Word has length 30 [2019-11-23 22:20:16,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:16,425 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 381 transitions. [2019-11-23 22:20:16,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:20:16,426 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 381 transitions. [2019-11-23 22:20:16,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 22:20:16,427 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:16,427 INFO L410 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] [2019-11-23 22:20:16,427 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:16,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:16,428 INFO L82 PathProgramCache]: Analyzing trace with hash -959450186, now seen corresponding path program 1 times [2019-11-23 22:20:16,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:16,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641253112] [2019-11-23 22:20:16,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:16,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:16,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641253112] [2019-11-23 22:20:16,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:16,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:20:16,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873438435] [2019-11-23 22:20:16,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:20:16,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:16,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:20:16,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:20:16,496 INFO L87 Difference]: Start difference. First operand 271 states and 381 transitions. Second operand 7 states. [2019-11-23 22:20:16,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:16,797 INFO L93 Difference]: Finished difference Result 304 states and 414 transitions. [2019-11-23 22:20:16,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 22:20:16,798 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-11-23 22:20:16,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:16,799 INFO L225 Difference]: With dead ends: 304 [2019-11-23 22:20:16,800 INFO L226 Difference]: Without dead ends: 241 [2019-11-23 22:20:16,800 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-23 22:20:16,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-23 22:20:16,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 219. [2019-11-23 22:20:16,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-11-23 22:20:16,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 307 transitions. [2019-11-23 22:20:16,817 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 307 transitions. Word has length 31 [2019-11-23 22:20:16,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:16,817 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 307 transitions. [2019-11-23 22:20:16,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:20:16,818 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 307 transitions. [2019-11-23 22:20:16,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 22:20:16,818 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:16,819 INFO L410 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] [2019-11-23 22:20:16,819 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:16,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:16,820 INFO L82 PathProgramCache]: Analyzing trace with hash -378484437, now seen corresponding path program 1 times [2019-11-23 22:20:16,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:16,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241522886] [2019-11-23 22:20:16,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:16,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:16,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241522886] [2019-11-23 22:20:16,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:16,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:20:16,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304973941] [2019-11-23 22:20:16,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:20:16,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:16,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:20:16,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:16,860 INFO L87 Difference]: Start difference. First operand 219 states and 307 transitions. Second operand 3 states. [2019-11-23 22:20:16,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:16,892 INFO L93 Difference]: Finished difference Result 435 states and 610 transitions. [2019-11-23 22:20:16,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:20:16,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-23 22:20:16,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:16,897 INFO L225 Difference]: With dead ends: 435 [2019-11-23 22:20:16,897 INFO L226 Difference]: Without dead ends: 431 [2019-11-23 22:20:16,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:16,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-11-23 22:20:16,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 269. [2019-11-23 22:20:16,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-11-23 22:20:16,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 371 transitions. [2019-11-23 22:20:16,916 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 371 transitions. Word has length 31 [2019-11-23 22:20:16,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:16,916 INFO L462 AbstractCegarLoop]: Abstraction has 269 states and 371 transitions. [2019-11-23 22:20:16,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:20:16,916 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 371 transitions. [2019-11-23 22:20:16,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 22:20:16,917 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:16,917 INFO L410 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] [2019-11-23 22:20:16,917 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:16,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:16,918 INFO L82 PathProgramCache]: Analyzing trace with hash -378424855, now seen corresponding path program 1 times [2019-11-23 22:20:16,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:16,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830136879] [2019-11-23 22:20:16,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:16,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:16,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830136879] [2019-11-23 22:20:16,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:16,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:20:16,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281099300] [2019-11-23 22:20:16,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:20:16,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:16,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:20:16,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:20:16,987 INFO L87 Difference]: Start difference. First operand 269 states and 371 transitions. Second operand 4 states. [2019-11-23 22:20:17,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:17,031 INFO L93 Difference]: Finished difference Result 315 states and 426 transitions. [2019-11-23 22:20:17,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:20:17,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-23 22:20:17,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:17,034 INFO L225 Difference]: With dead ends: 315 [2019-11-23 22:20:17,034 INFO L226 Difference]: Without dead ends: 257 [2019-11-23 22:20:17,035 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:20:17,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-11-23 22:20:17,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2019-11-23 22:20:17,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-23 22:20:17,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 353 transitions. [2019-11-23 22:20:17,051 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 353 transitions. Word has length 31 [2019-11-23 22:20:17,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:17,051 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 353 transitions. [2019-11-23 22:20:17,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:20:17,051 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 353 transitions. [2019-11-23 22:20:17,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:20:17,053 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:17,053 INFO L410 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] [2019-11-23 22:20:17,054 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:17,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:17,055 INFO L82 PathProgramCache]: Analyzing trace with hash -329006014, now seen corresponding path program 1 times [2019-11-23 22:20:17,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:17,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861962200] [2019-11-23 22:20:17,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:17,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:17,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861962200] [2019-11-23 22:20:17,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:17,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:20:17,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504699475] [2019-11-23 22:20:17,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:20:17,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:17,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:20:17,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:20:17,110 INFO L87 Difference]: Start difference. First operand 257 states and 353 transitions. Second operand 4 states. [2019-11-23 22:20:17,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:17,244 INFO L93 Difference]: Finished difference Result 291 states and 396 transitions. [2019-11-23 22:20:17,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:20:17,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-23 22:20:17,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:17,246 INFO L225 Difference]: With dead ends: 291 [2019-11-23 22:20:17,246 INFO L226 Difference]: Without dead ends: 245 [2019-11-23 22:20:17,247 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:20:17,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-11-23 22:20:17,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2019-11-23 22:20:17,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-11-23 22:20:17,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 337 transitions. [2019-11-23 22:20:17,266 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 337 transitions. Word has length 32 [2019-11-23 22:20:17,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:17,266 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 337 transitions. [2019-11-23 22:20:17,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:20:17,267 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 337 transitions. [2019-11-23 22:20:17,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:20:17,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:17,268 INFO L410 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] [2019-11-23 22:20:17,269 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:17,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:17,269 INFO L82 PathProgramCache]: Analyzing trace with hash -793600864, now seen corresponding path program 1 times [2019-11-23 22:20:17,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:17,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638765008] [2019-11-23 22:20:17,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:17,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:17,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638765008] [2019-11-23 22:20:17,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:17,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:20:17,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827856790] [2019-11-23 22:20:17,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:20:17,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:17,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:20:17,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:20:17,333 INFO L87 Difference]: Start difference. First operand 245 states and 337 transitions. Second operand 5 states. [2019-11-23 22:20:17,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:17,553 INFO L93 Difference]: Finished difference Result 276 states and 367 transitions. [2019-11-23 22:20:17,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:20:17,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-23 22:20:17,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:17,555 INFO L225 Difference]: With dead ends: 276 [2019-11-23 22:20:17,555 INFO L226 Difference]: Without dead ends: 271 [2019-11-23 22:20:17,558 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:20:17,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-23 22:20:17,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 265. [2019-11-23 22:20:17,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-11-23 22:20:17,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 357 transitions. [2019-11-23 22:20:17,586 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 357 transitions. Word has length 32 [2019-11-23 22:20:17,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:17,586 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 357 transitions. [2019-11-23 22:20:17,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:20:17,587 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 357 transitions. [2019-11-23 22:20:17,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 22:20:17,587 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:17,588 INFO L410 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] [2019-11-23 22:20:17,588 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:17,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:17,588 INFO L82 PathProgramCache]: Analyzing trace with hash 778121725, now seen corresponding path program 1 times [2019-11-23 22:20:17,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:17,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072105810] [2019-11-23 22:20:17,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:17,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:17,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072105810] [2019-11-23 22:20:17,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:17,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:20:17,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187362051] [2019-11-23 22:20:17,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:20:17,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:17,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:20:17,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:20:17,629 INFO L87 Difference]: Start difference. First operand 265 states and 357 transitions. Second operand 4 states. [2019-11-23 22:20:17,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:17,739 INFO L93 Difference]: Finished difference Result 271 states and 362 transitions. [2019-11-23 22:20:17,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:20:17,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-23 22:20:17,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:17,741 INFO L225 Difference]: With dead ends: 271 [2019-11-23 22:20:17,741 INFO L226 Difference]: Without dead ends: 245 [2019-11-23 22:20:17,742 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:20:17,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-11-23 22:20:17,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2019-11-23 22:20:17,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-11-23 22:20:17,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 328 transitions. [2019-11-23 22:20:17,758 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 328 transitions. Word has length 33 [2019-11-23 22:20:17,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:17,759 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 328 transitions. [2019-11-23 22:20:17,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:20:17,759 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 328 transitions. [2019-11-23 22:20:17,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-23 22:20:17,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:17,760 INFO L410 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] [2019-11-23 22:20:17,760 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:17,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:17,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1781478438, now seen corresponding path program 1 times [2019-11-23 22:20:17,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:17,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936274572] [2019-11-23 22:20:17,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:17,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:17,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936274572] [2019-11-23 22:20:17,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:17,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:20:17,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822656177] [2019-11-23 22:20:17,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:20:17,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:17,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:20:17,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:17,799 INFO L87 Difference]: Start difference. First operand 245 states and 328 transitions. Second operand 3 states. [2019-11-23 22:20:17,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:17,881 INFO L93 Difference]: Finished difference Result 356 states and 458 transitions. [2019-11-23 22:20:17,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:20:17,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-23 22:20:17,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:17,883 INFO L225 Difference]: With dead ends: 356 [2019-11-23 22:20:17,884 INFO L226 Difference]: Without dead ends: 299 [2019-11-23 22:20:17,884 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:17,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-23 22:20:17,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 247. [2019-11-23 22:20:17,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-11-23 22:20:17,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 330 transitions. [2019-11-23 22:20:17,903 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 330 transitions. Word has length 34 [2019-11-23 22:20:17,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:17,903 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 330 transitions. [2019-11-23 22:20:17,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:20:17,903 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 330 transitions. [2019-11-23 22:20:17,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-23 22:20:17,904 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:17,904 INFO L410 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] [2019-11-23 22:20:17,905 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:17,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:17,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1662125936, now seen corresponding path program 1 times [2019-11-23 22:20:17,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:17,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600693591] [2019-11-23 22:20:17,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:17,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:17,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600693591] [2019-11-23 22:20:17,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:17,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:20:17,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84289423] [2019-11-23 22:20:17,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:20:17,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:17,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:20:17,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:17,939 INFO L87 Difference]: Start difference. First operand 247 states and 330 transitions. Second operand 3 states. [2019-11-23 22:20:18,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:18,023 INFO L93 Difference]: Finished difference Result 263 states and 349 transitions. [2019-11-23 22:20:18,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:20:18,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-23 22:20:18,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:18,025 INFO L225 Difference]: With dead ends: 263 [2019-11-23 22:20:18,025 INFO L226 Difference]: Without dead ends: 259 [2019-11-23 22:20:18,026 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:18,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-23 22:20:18,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 251. [2019-11-23 22:20:18,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-11-23 22:20:18,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 333 transitions. [2019-11-23 22:20:18,047 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 333 transitions. Word has length 34 [2019-11-23 22:20:18,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:18,047 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 333 transitions. [2019-11-23 22:20:18,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:20:18,048 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 333 transitions. [2019-11-23 22:20:18,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-23 22:20:18,048 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:18,049 INFO L410 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] [2019-11-23 22:20:18,049 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:18,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:18,049 INFO L82 PathProgramCache]: Analyzing trace with hash -822248422, now seen corresponding path program 1 times [2019-11-23 22:20:18,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:18,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714173882] [2019-11-23 22:20:18,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:18,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:18,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714173882] [2019-11-23 22:20:18,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:18,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:20:18,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269550051] [2019-11-23 22:20:18,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:20:18,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:18,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:20:18,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:20:18,087 INFO L87 Difference]: Start difference. First operand 251 states and 333 transitions. Second operand 5 states. [2019-11-23 22:20:18,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:18,228 INFO L93 Difference]: Finished difference Result 304 states and 384 transitions. [2019-11-23 22:20:18,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:20:18,229 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-11-23 22:20:18,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:18,231 INFO L225 Difference]: With dead ends: 304 [2019-11-23 22:20:18,231 INFO L226 Difference]: Without dead ends: 300 [2019-11-23 22:20:18,231 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:20:18,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-23 22:20:18,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 251. [2019-11-23 22:20:18,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-11-23 22:20:18,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 331 transitions. [2019-11-23 22:20:18,268 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 331 transitions. Word has length 34 [2019-11-23 22:20:18,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:18,268 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 331 transitions. [2019-11-23 22:20:18,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:20:18,268 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 331 transitions. [2019-11-23 22:20:18,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-23 22:20:18,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:18,269 INFO L410 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] [2019-11-23 22:20:18,269 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:18,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:18,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1935189253, now seen corresponding path program 1 times [2019-11-23 22:20:18,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:18,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77787784] [2019-11-23 22:20:18,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:18,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:18,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77787784] [2019-11-23 22:20:18,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:18,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:20:18,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788953157] [2019-11-23 22:20:18,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:20:18,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:18,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:20:18,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:20:18,370 INFO L87 Difference]: Start difference. First operand 251 states and 331 transitions. Second operand 7 states. [2019-11-23 22:20:18,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:18,538 INFO L93 Difference]: Finished difference Result 269 states and 351 transitions. [2019-11-23 22:20:18,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:20:18,538 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-11-23 22:20:18,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:18,540 INFO L225 Difference]: With dead ends: 269 [2019-11-23 22:20:18,540 INFO L226 Difference]: Without dead ends: 250 [2019-11-23 22:20:18,540 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:20:18,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-11-23 22:20:18,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2019-11-23 22:20:18,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-23 22:20:18,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 329 transitions. [2019-11-23 22:20:18,558 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 329 transitions. Word has length 34 [2019-11-23 22:20:18,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:18,558 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 329 transitions. [2019-11-23 22:20:18,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:20:18,558 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 329 transitions. [2019-11-23 22:20:18,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 22:20:18,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:18,559 INFO L410 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] [2019-11-23 22:20:18,559 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:18,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:18,560 INFO L82 PathProgramCache]: Analyzing trace with hash -21362253, now seen corresponding path program 1 times [2019-11-23 22:20:18,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:18,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248571609] [2019-11-23 22:20:18,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:18,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:18,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248571609] [2019-11-23 22:20:18,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:18,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:20:18,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899933719] [2019-11-23 22:20:18,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:20:18,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:18,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:20:18,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:18,600 INFO L87 Difference]: Start difference. First operand 250 states and 329 transitions. Second operand 3 states. [2019-11-23 22:20:18,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:18,622 INFO L93 Difference]: Finished difference Result 268 states and 349 transitions. [2019-11-23 22:20:18,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:20:18,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-23 22:20:18,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:18,624 INFO L225 Difference]: With dead ends: 268 [2019-11-23 22:20:18,624 INFO L226 Difference]: Without dead ends: 231 [2019-11-23 22:20:18,624 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:18,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-11-23 22:20:18,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2019-11-23 22:20:18,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-23 22:20:18,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 303 transitions. [2019-11-23 22:20:18,641 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 303 transitions. Word has length 35 [2019-11-23 22:20:18,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:18,641 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 303 transitions. [2019-11-23 22:20:18,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:20:18,641 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 303 transitions. [2019-11-23 22:20:18,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 22:20:18,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:18,642 INFO L410 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] [2019-11-23 22:20:18,642 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:18,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:18,643 INFO L82 PathProgramCache]: Analyzing trace with hash 272561262, now seen corresponding path program 1 times [2019-11-23 22:20:18,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:18,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649893875] [2019-11-23 22:20:18,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:18,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:18,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649893875] [2019-11-23 22:20:18,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:18,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:20:18,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36438875] [2019-11-23 22:20:18,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:20:18,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:18,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:20:18,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:20:18,719 INFO L87 Difference]: Start difference. First operand 231 states and 303 transitions. Second operand 5 states. [2019-11-23 22:20:18,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:18,850 INFO L93 Difference]: Finished difference Result 289 states and 361 transitions. [2019-11-23 22:20:18,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:20:18,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-11-23 22:20:18,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:18,853 INFO L225 Difference]: With dead ends: 289 [2019-11-23 22:20:18,854 INFO L226 Difference]: Without dead ends: 258 [2019-11-23 22:20:18,854 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:20:18,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-23 22:20:18,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 231. [2019-11-23 22:20:18,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-23 22:20:18,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 297 transitions. [2019-11-23 22:20:18,870 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 297 transitions. Word has length 35 [2019-11-23 22:20:18,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:18,871 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 297 transitions. [2019-11-23 22:20:18,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:20:18,871 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 297 transitions. [2019-11-23 22:20:18,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 22:20:18,872 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:18,872 INFO L410 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] [2019-11-23 22:20:18,872 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:18,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:18,873 INFO L82 PathProgramCache]: Analyzing trace with hash -2102888975, now seen corresponding path program 1 times [2019-11-23 22:20:18,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:18,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346530753] [2019-11-23 22:20:18,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:18,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:18,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346530753] [2019-11-23 22:20:18,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:18,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:20:18,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857759942] [2019-11-23 22:20:18,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:20:18,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:18,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:20:18,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:20:18,914 INFO L87 Difference]: Start difference. First operand 231 states and 297 transitions. Second operand 7 states. [2019-11-23 22:20:19,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:19,105 INFO L93 Difference]: Finished difference Result 255 states and 321 transitions. [2019-11-23 22:20:19,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 22:20:19,106 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-11-23 22:20:19,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:19,107 INFO L225 Difference]: With dead ends: 255 [2019-11-23 22:20:19,107 INFO L226 Difference]: Without dead ends: 187 [2019-11-23 22:20:19,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-23 22:20:19,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-23 22:20:19,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 176. [2019-11-23 22:20:19,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-11-23 22:20:19,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 214 transitions. [2019-11-23 22:20:19,121 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 214 transitions. Word has length 35 [2019-11-23 22:20:19,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:19,122 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 214 transitions. [2019-11-23 22:20:19,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:20:19,122 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 214 transitions. [2019-11-23 22:20:19,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 22:20:19,123 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:19,123 INFO L410 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] [2019-11-23 22:20:19,123 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:19,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:19,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1804254012, now seen corresponding path program 1 times [2019-11-23 22:20:19,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:19,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692735833] [2019-11-23 22:20:19,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:19,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692735833] [2019-11-23 22:20:19,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:19,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:20:19,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733137625] [2019-11-23 22:20:19,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:20:19,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:19,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:20:19,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:20:19,230 INFO L87 Difference]: Start difference. First operand 176 states and 214 transitions. Second operand 6 states. [2019-11-23 22:20:19,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:19,344 INFO L93 Difference]: Finished difference Result 187 states and 225 transitions. [2019-11-23 22:20:19,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:20:19,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-11-23 22:20:19,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:19,346 INFO L225 Difference]: With dead ends: 187 [2019-11-23 22:20:19,346 INFO L226 Difference]: Without dead ends: 155 [2019-11-23 22:20:19,346 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:20:19,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-23 22:20:19,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-11-23 22:20:19,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-23 22:20:19,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 184 transitions. [2019-11-23 22:20:19,360 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 184 transitions. Word has length 35 [2019-11-23 22:20:19,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:19,360 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 184 transitions. [2019-11-23 22:20:19,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:20:19,361 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 184 transitions. [2019-11-23 22:20:19,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-23 22:20:19,361 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:19,361 INFO L410 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] [2019-11-23 22:20:19,361 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:19,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:19,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1398430965, now seen corresponding path program 1 times [2019-11-23 22:20:19,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:19,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250602389] [2019-11-23 22:20:19,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:19,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:19,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250602389] [2019-11-23 22:20:19,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:19,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:20:19,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053286192] [2019-11-23 22:20:19,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:20:19,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:19,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:20:19,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:20:19,431 INFO L87 Difference]: Start difference. First operand 155 states and 184 transitions. Second operand 7 states. [2019-11-23 22:20:19,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:19,600 INFO L93 Difference]: Finished difference Result 193 states and 224 transitions. [2019-11-23 22:20:19,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 22:20:19,600 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-11-23 22:20:19,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:19,602 INFO L225 Difference]: With dead ends: 193 [2019-11-23 22:20:19,602 INFO L226 Difference]: Without dead ends: 173 [2019-11-23 22:20:19,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-23 22:20:19,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-23 22:20:19,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 154. [2019-11-23 22:20:19,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-23 22:20:19,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 182 transitions. [2019-11-23 22:20:19,614 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 182 transitions. Word has length 36 [2019-11-23 22:20:19,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:19,615 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 182 transitions. [2019-11-23 22:20:19,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:20:19,615 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 182 transitions. [2019-11-23 22:20:19,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 22:20:19,615 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:19,616 INFO L410 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] [2019-11-23 22:20:19,616 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:19,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:19,616 INFO L82 PathProgramCache]: Analyzing trace with hash 287352256, now seen corresponding path program 1 times [2019-11-23 22:20:19,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:19,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211912852] [2019-11-23 22:20:19,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:19,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:19,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211912852] [2019-11-23 22:20:19,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:19,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:20:19,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714177399] [2019-11-23 22:20:19,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:20:19,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:19,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:20:19,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:20:19,668 INFO L87 Difference]: Start difference. First operand 154 states and 182 transitions. Second operand 6 states. [2019-11-23 22:20:19,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:19,835 INFO L93 Difference]: Finished difference Result 197 states and 224 transitions. [2019-11-23 22:20:19,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:20:19,835 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-11-23 22:20:19,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:19,837 INFO L225 Difference]: With dead ends: 197 [2019-11-23 22:20:19,837 INFO L226 Difference]: Without dead ends: 192 [2019-11-23 22:20:19,838 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:20:19,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-23 22:20:19,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 167. [2019-11-23 22:20:19,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-11-23 22:20:19,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 195 transitions. [2019-11-23 22:20:19,855 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 195 transitions. Word has length 37 [2019-11-23 22:20:19,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:19,856 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 195 transitions. [2019-11-23 22:20:19,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:20:19,856 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 195 transitions. [2019-11-23 22:20:19,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 22:20:19,857 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:19,857 INFO L410 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] [2019-11-23 22:20:19,857 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:19,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:19,857 INFO L82 PathProgramCache]: Analyzing trace with hash 724480386, now seen corresponding path program 1 times [2019-11-23 22:20:19,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:19,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362432434] [2019-11-23 22:20:19,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-23 22:20:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-23 22:20:19,940 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-23 22:20:19,940 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-23 22:20:20,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:20:20 BoogieIcfgContainer [2019-11-23 22:20:20,037 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:20:20,043 INFO L168 Benchmark]: Toolchain (without parser) took 8568.36 ms. Allocated memory was 138.4 MB in the beginning and 324.5 MB in the end (delta: 186.1 MB). Free memory was 103.0 MB in the beginning and 148.4 MB in the end (delta: -45.4 MB). Peak memory consumption was 140.7 MB. Max. memory is 7.1 GB. [2019-11-23 22:20:20,044 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 22:20:20,044 INFO L168 Benchmark]: CACSL2BoogieTranslator took 617.12 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 102.6 MB in the beginning and 175.2 MB in the end (delta: -72.6 MB). Peak memory consumption was 29.5 MB. Max. memory is 7.1 GB. [2019-11-23 22:20:20,045 INFO L168 Benchmark]: Boogie Procedure Inliner took 112.88 ms. Allocated memory is still 201.9 MB. Free memory was 175.2 MB in the beginning and 168.0 MB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 7.1 GB. [2019-11-23 22:20:20,045 INFO L168 Benchmark]: Boogie Preprocessor took 97.79 ms. Allocated memory is still 201.9 MB. Free memory was 168.0 MB in the beginning and 163.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. [2019-11-23 22:20:20,046 INFO L168 Benchmark]: RCFGBuilder took 1459.53 ms. Allocated memory was 201.9 MB in the beginning and 235.4 MB in the end (delta: 33.6 MB). Free memory was 163.7 MB in the beginning and 170.9 MB in the end (delta: -7.1 MB). Peak memory consumption was 83.2 MB. Max. memory is 7.1 GB. [2019-11-23 22:20:20,047 INFO L168 Benchmark]: TraceAbstraction took 6273.00 ms. Allocated memory was 235.4 MB in the beginning and 324.5 MB in the end (delta: 89.1 MB). Free memory was 169.4 MB in the beginning and 148.4 MB in the end (delta: 21.0 MB). Peak memory consumption was 110.1 MB. Max. memory is 7.1 GB. [2019-11-23 22:20:20,050 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 617.12 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 102.6 MB in the beginning and 175.2 MB in the end (delta: -72.6 MB). Peak memory consumption was 29.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 112.88 ms. Allocated memory is still 201.9 MB. Free memory was 175.2 MB in the beginning and 168.0 MB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 97.79 ms. Allocated memory is still 201.9 MB. Free memory was 168.0 MB in the beginning and 163.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1459.53 ms. Allocated memory was 201.9 MB in the beginning and 235.4 MB in the end (delta: 33.6 MB). Free memory was 163.7 MB in the beginning and 170.9 MB in the end (delta: -7.1 MB). Peak memory consumption was 83.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6273.00 ms. Allocated memory was 235.4 MB in the beginning and 324.5 MB in the end (delta: 89.1 MB). Free memory was 169.4 MB in the beginning and 148.4 MB in the end (delta: 21.0 MB). Peak memory consumption was 110.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1011]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L21] int KernelMode ; [L22] int Executive ; [L23] int DevicePowerState ; [L24] int s ; [L25] int UNLOADED ; [L26] int NP ; [L27] int DC ; [L28] int SKIP1 ; [L29] int SKIP2 ; [L30] int MPR1 ; [L31] int MPR3 ; [L32] int IPC ; [L33] int pended ; [L34] int compFptr ; [L35] int compRegistered ; [L36] int lowerDriverReturn ; [L37] int setEventCalled ; [L38] int customIrp ; [L39] int myStatus ; VAL [compFptr=0, compRegistered=0, customIrp=0, DC=0, DevicePowerState=0, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, UNLOADED=0] [L292] int status ; [L293] int irp = __VERIFIER_nondet_int() ; [L294] int pirp ; [L295] int pirp__IoStatus__Status ; [L296] int irp_choice = __VERIFIER_nondet_int() ; [L297] int devobj = __VERIFIER_nondet_int() ; [L298] int __cil_tmp8 ; [L300] KernelMode = 0 [L301] Executive = 0 [L302] DevicePowerState = 1 [L303] s = 0 [L304] UNLOADED = 0 [L305] NP = 0 [L306] DC = 0 [L307] SKIP1 = 0 [L308] SKIP2 = 0 [L309] MPR1 = 0 [L310] MPR3 = 0 [L311] IPC = 0 [L312] pended = 0 [L313] compFptr = 0 [L314] compRegistered = 0 [L315] lowerDriverReturn = 0 [L316] setEventCalled = 0 [L317] customIrp = 0 [L318] myStatus = 0 [L322] status = 0 [L323] pirp = irp [L59] UNLOADED = 0 [L60] NP = 1 [L61] DC = 2 [L62] SKIP1 = 3 [L63] SKIP2 = 4 [L64] MPR1 = 5 [L65] MPR3 = 6 [L66] IPC = 7 [L67] s = UNLOADED [L68] pended = 0 [L69] compFptr = 0 [L70] compRegistered = 0 [L71] lowerDriverReturn = 0 [L72] setEventCalled = 0 [L73] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L326] COND TRUE status >= 0 [L327] s = NP [L328] customIrp = 0 [L329] setEventCalled = customIrp [L330] lowerDriverReturn = setEventCalled [L331] compRegistered = lowerDriverReturn [L332] pended = compRegistered [L333] pirp__IoStatus__Status = 0 [L334] myStatus = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L335] COND TRUE irp_choice == 0 [L336] pirp__IoStatus__Status = -1073741637 [L337] myStatus = -1073741637 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L45] s = NP [L46] pended = 0 [L47] compFptr = 0 [L48] compRegistered = 0 [L49] lowerDriverReturn = 0 [L50] setEventCalled = 0 [L51] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L343] COND FALSE !(status < 0) [L347] int tmp_ndt_1; [L348] tmp_ndt_1 = __VERIFIER_nondet_int() [L349] COND FALSE !(tmp_ndt_1 == 0) [L352] int tmp_ndt_2; [L353] tmp_ndt_2 = __VERIFIER_nondet_int() [L354] COND FALSE !(tmp_ndt_2 == 1) [L357] int tmp_ndt_3; [L358] tmp_ndt_3 = __VERIFIER_nondet_int() [L359] COND TRUE tmp_ndt_3 == 3 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L78] int devExt ; [L79] int irpStack ; [L80] int status ; [L81] int event = __VERIFIER_nondet_int() ; [L82] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L83] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L84] int irpStack__MinorFunction = __VERIFIER_nondet_int() ; [L85] int devExt__TopOfStack = __VERIFIER_nondet_int() ; [L86] int devExt__Started ; [L87] int devExt__Removed ; [L88] int devExt__SurpriseRemoved ; [L89] int Irp__IoStatus__Status ; [L90] int Irp__IoStatus__Information ; [L91] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L92] int irpSp ; [L93] int nextIrpSp ; [L94] int nextIrpSp__Control ; [L95] int irpSp___0 ; [L96] int irpSp__Context ; [L97] int irpSp__Control ; [L98] long __cil_tmp23 ; [L101] status = 0 [L102] devExt = DeviceObject__DeviceExtension [L103] irpStack = Irp__Tail__Overlay__CurrentStackLocation VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L104] COND FALSE !(irpStack__MinorFunction == 0) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L107] COND FALSE !(irpStack__MinorFunction == 23) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L110] COND TRUE irpStack__MinorFunction == 2 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L234] devExt__Removed = 1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L235] COND TRUE s == NP [L236] s = SKIP1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L243] Irp__CurrentLocation ++ [L244] Irp__Tail__Overlay__CurrentStackLocation ++ [L481] int returnVal2 ; [L482] int compRetStatus ; [L483] int lcontext = __VERIFIER_nondet_int() ; [L484] long long __cil_tmp7 ; VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L487] COND FALSE !(\read(compRegistered)) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L500] int tmp_ndt_6; [L501] tmp_ndt_6 = __VERIFIER_nondet_int() [L502] COND FALSE !(tmp_ndt_6 == 0) [L505] int tmp_ndt_7; [L506] tmp_ndt_7 = __VERIFIER_nondet_int() [L507] COND TRUE tmp_ndt_7 == 1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L516] returnVal2 = -1073741823 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L526] COND FALSE !(s == NP) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L530] COND FALSE !(s == MPR1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L539] COND TRUE s == SKIP1 [L540] s = SKIP2 [L541] lowerDriverReturn = returnVal2 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L549] return (returnVal2); VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L246] status = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L288] return (status); VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L386] status = KbFilter_PnP(devobj, pirp) [L410] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L418] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L426] COND TRUE s != UNLOADED VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L427] COND TRUE status != -1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L428] COND FALSE !(s != SKIP2) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L438] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L445] COND FALSE !(s == DC) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L450] COND TRUE status != lowerDriverReturn VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L1011] __VERIFIER_error() VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 330 locations, 30 error locations. Result: UNSAFE, OverallTime: 6.1s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7293 SDtfs, 4529 SDslu, 10689 SDs, 0 SdLazy, 2185 SolverSat, 305 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=351occurred in iteration=2, 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, 26 MinimizatonAttempts, 610 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 803 NumberOfCodeBlocks, 803 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 740 ConstructedInterpolants, 0 QuantifiedInterpolants, 55626 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...