java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:38:01,350 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:38:01,352 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:38:01,364 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:38:01,365 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:38:01,366 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:38:01,367 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:38:01,369 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:38:01,371 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:38:01,372 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:38:01,373 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:38:01,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:38:01,374 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:38:01,375 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:38:01,376 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:38:01,377 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:38:01,378 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:38:01,379 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:38:01,381 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:38:01,384 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:38:01,385 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:38:01,386 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:38:01,388 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:38:01,389 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:38:01,391 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:38:01,391 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:38:01,392 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:38:01,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:38:01,393 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:38:01,394 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:38:01,394 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:38:01,395 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:38:01,396 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:38:01,396 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:38:01,397 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:38:01,398 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:38:01,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:38:01,399 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:38:01,399 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:38:01,400 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:38:01,401 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:38:01,401 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:38:01,417 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:38:01,417 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:38:01,418 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:38:01,418 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:38:01,419 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:38:01,419 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:38:01,419 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:38:01,419 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:38:01,419 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:38:01,420 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:38:01,420 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:38:01,420 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:38:01,421 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:38:01,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:38:01,421 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:38:01,421 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:38:01,421 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:38:01,422 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:38:01,422 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:38:01,422 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:38:01,422 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:38:01,422 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:38:01,423 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:38:01,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:38:01,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:38:01,423 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:38:01,423 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:38:01,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:38:01,424 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:38:01,424 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:38:01,454 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:38:01,466 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:38:01,470 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:38:01,471 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:38:01,472 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:38:01,472 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2019-10-03 02:38:01,546 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b402230a/21f57adf0e9b4bdfbb7f69393fbc4f69/FLAG22afe539b [2019-10-03 02:38:02,056 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:38:02,057 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2019-10-03 02:38:02,075 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b402230a/21f57adf0e9b4bdfbb7f69393fbc4f69/FLAG22afe539b [2019-10-03 02:38:02,388 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b402230a/21f57adf0e9b4bdfbb7f69393fbc4f69 [2019-10-03 02:38:02,398 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:38:02,400 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:38:02,401 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:38:02,401 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:38:02,405 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:38:02,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:38:02" (1/1) ... [2019-10-03 02:38:02,409 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65342265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:02, skipping insertion in model container [2019-10-03 02:38:02,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:38:02" (1/1) ... [2019-10-03 02:38:02,417 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:38:02,455 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:38:02,682 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:38:02,687 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:38:02,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:38:02,868 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:38:02,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:02 WrapperNode [2019-10-03 02:38:02,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:38:02,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:38:02,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:38:02,870 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:38:02,880 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:02" (1/1) ... [2019-10-03 02:38:02,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:02" (1/1) ... [2019-10-03 02:38:02,890 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:02" (1/1) ... [2019-10-03 02:38:02,891 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:02" (1/1) ... [2019-10-03 02:38:02,908 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:02" (1/1) ... [2019-10-03 02:38:02,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:02" (1/1) ... [2019-10-03 02:38:02,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:02" (1/1) ... [2019-10-03 02:38:02,942 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:38:02,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:38:02,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:38:02,944 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:38:02,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:02" (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-10-03 02:38:03,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:38:03,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:38:03,016 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-03 02:38:03,017 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-03 02:38:03,017 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2019-10-03 02:38:03,017 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:38:03,017 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-03 02:38:03,017 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-03 02:38:03,017 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-03 02:38:03,018 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-03 02:38:03,018 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-03 02:38:03,018 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2019-10-03 02:38:03,018 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-03 02:38:03,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:38:03,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-03 02:38:03,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:38:03,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-03 02:38:03,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-03 02:38:03,021 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2019-10-03 02:38:03,021 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-03 02:38:03,021 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-03 02:38:03,021 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-03 02:38:03,021 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2019-10-03 02:38:03,021 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-03 02:38:03,021 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-03 02:38:03,022 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-03 02:38:03,022 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-03 02:38:03,023 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:38:03,023 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-03 02:38:03,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:38:03,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:38:03,287 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:03,428 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2019-10-03 02:38:03,429 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2019-10-03 02:38:03,430 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:03,492 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2019-10-03 02:38:03,492 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2019-10-03 02:38:03,505 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:03,525 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-03 02:38:03,525 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-03 02:38:03,538 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:38:03,734 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2019-10-03 02:38:03,734 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2019-10-03 02:38:03,744 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:38:03,745 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-03 02:38:03,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:38:03 BoogieIcfgContainer [2019-10-03 02:38:03,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:38:03,753 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:38:03,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:38:03,759 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:38:03,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:38:02" (1/3) ... [2019-10-03 02:38:03,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bcd0f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:38:03, skipping insertion in model container [2019-10-03 02:38:03,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:38:02" (2/3) ... [2019-10-03 02:38:03,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bcd0f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:38:03, skipping insertion in model container [2019-10-03 02:38:03,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:38:03" (3/3) ... [2019-10-03 02:38:03,768 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2019-10-03 02:38:03,782 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:38:03,790 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:38:03,807 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:38:03,835 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:38:03,835 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:38:03,835 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:38:03,835 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:38:03,836 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:38:03,836 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:38:03,836 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:38:03,836 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:38:03,857 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2019-10-03 02:38:03,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-03 02:38:03,868 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:03,870 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:03,872 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:03,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:03,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1530382191, now seen corresponding path program 1 times [2019-10-03 02:38:03,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:03,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:03,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:03,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:03,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:04,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:04,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:04,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:38:04,193 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:04,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:38:04,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:38:04,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:04,218 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 3 states. [2019-10-03 02:38:04,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:04,317 INFO L93 Difference]: Finished difference Result 152 states and 213 transitions. [2019-10-03 02:38:04,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:38:04,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-03 02:38:04,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:04,346 INFO L225 Difference]: With dead ends: 152 [2019-10-03 02:38:04,346 INFO L226 Difference]: Without dead ends: 140 [2019-10-03 02:38:04,350 INFO L640 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-10-03 02:38:04,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-10-03 02:38:04,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-10-03 02:38:04,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-03 02:38:04,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2019-10-03 02:38:04,456 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 20 [2019-10-03 02:38:04,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:04,457 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2019-10-03 02:38:04,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:38:04,457 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2019-10-03 02:38:04,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-03 02:38:04,459 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:04,459 INFO L411 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-10-03 02:38:04,460 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:04,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:04,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1141575010, now seen corresponding path program 1 times [2019-10-03 02:38:04,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:04,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:04,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:04,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:04,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:04,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:04,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:04,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:38:04,701 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:04,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:38:04,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:38:04,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:04,704 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand 3 states. [2019-10-03 02:38:04,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:04,864 INFO L93 Difference]: Finished difference Result 203 states and 268 transitions. [2019-10-03 02:38:04,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:38:04,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-03 02:38:04,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:04,868 INFO L225 Difference]: With dead ends: 203 [2019-10-03 02:38:04,868 INFO L226 Difference]: Without dead ends: 202 [2019-10-03 02:38:04,869 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:04,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-03 02:38:04,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 189. [2019-10-03 02:38:04,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-10-03 02:38:04,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 252 transitions. [2019-10-03 02:38:04,915 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 252 transitions. Word has length 26 [2019-10-03 02:38:04,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:04,915 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 252 transitions. [2019-10-03 02:38:04,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:38:04,916 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 252 transitions. [2019-10-03 02:38:04,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-03 02:38:04,917 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:04,917 INFO L411 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-10-03 02:38:04,917 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:04,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:04,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1029098174, now seen corresponding path program 1 times [2019-10-03 02:38:04,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:04,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:04,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:04,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:04,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:05,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:05,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:05,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:38:05,026 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:05,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:38:05,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:38:05,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:38:05,028 INFO L87 Difference]: Start difference. First operand 189 states and 252 transitions. Second operand 4 states. [2019-10-03 02:38:05,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:05,101 INFO L93 Difference]: Finished difference Result 248 states and 328 transitions. [2019-10-03 02:38:05,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:38:05,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-10-03 02:38:05,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:05,106 INFO L225 Difference]: With dead ends: 248 [2019-10-03 02:38:05,107 INFO L226 Difference]: Without dead ends: 248 [2019-10-03 02:38:05,107 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:38:05,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-10-03 02:38:05,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 211. [2019-10-03 02:38:05,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-03 02:38:05,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 282 transitions. [2019-10-03 02:38:05,141 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 282 transitions. Word has length 27 [2019-10-03 02:38:05,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:05,142 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 282 transitions. [2019-10-03 02:38:05,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:38:05,142 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 282 transitions. [2019-10-03 02:38:05,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-03 02:38:05,146 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:05,147 INFO L411 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-10-03 02:38:05,147 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:05,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:05,148 INFO L82 PathProgramCache]: Analyzing trace with hash 742933031, now seen corresponding path program 1 times [2019-10-03 02:38:05,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:05,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:05,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:05,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:05,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:05,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:05,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:05,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:38:05,285 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:05,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:38:05,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:38:05,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:38:05,286 INFO L87 Difference]: Start difference. First operand 211 states and 282 transitions. Second operand 4 states. [2019-10-03 02:38:05,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:05,425 INFO L93 Difference]: Finished difference Result 211 states and 281 transitions. [2019-10-03 02:38:05,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:38:05,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-10-03 02:38:05,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:05,428 INFO L225 Difference]: With dead ends: 211 [2019-10-03 02:38:05,428 INFO L226 Difference]: Without dead ends: 211 [2019-10-03 02:38:05,428 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-10-03 02:38:05,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-10-03 02:38:05,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-10-03 02:38:05,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-03 02:38:05,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 281 transitions. [2019-10-03 02:38:05,441 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 281 transitions. Word has length 37 [2019-10-03 02:38:05,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:05,441 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 281 transitions. [2019-10-03 02:38:05,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:38:05,441 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 281 transitions. [2019-10-03 02:38:05,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-03 02:38:05,444 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:05,444 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:05,444 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:05,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:05,445 INFO L82 PathProgramCache]: Analyzing trace with hash 324263340, now seen corresponding path program 1 times [2019-10-03 02:38:05,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:05,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:05,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:05,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:05,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:05,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:05,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:05,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:05,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:38:05,508 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:05,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:38:05,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:38:05,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:38:05,509 INFO L87 Difference]: Start difference. First operand 211 states and 281 transitions. Second operand 4 states. [2019-10-03 02:38:05,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:05,600 INFO L93 Difference]: Finished difference Result 202 states and 264 transitions. [2019-10-03 02:38:05,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:38:05,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-10-03 02:38:05,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:05,603 INFO L225 Difference]: With dead ends: 202 [2019-10-03 02:38:05,603 INFO L226 Difference]: Without dead ends: 202 [2019-10-03 02:38:05,604 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:38:05,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-03 02:38:05,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 184. [2019-10-03 02:38:05,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-10-03 02:38:05,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 243 transitions. [2019-10-03 02:38:05,620 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 243 transitions. Word has length 45 [2019-10-03 02:38:05,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:05,623 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 243 transitions. [2019-10-03 02:38:05,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:38:05,624 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 243 transitions. [2019-10-03 02:38:05,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-03 02:38:05,629 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:05,629 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:05,634 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:05,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:05,634 INFO L82 PathProgramCache]: Analyzing trace with hash 726030577, now seen corresponding path program 1 times [2019-10-03 02:38:05,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:05,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:05,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:05,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:05,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:05,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:05,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:05,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:38:05,707 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:05,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:38:05,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:38:05,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:05,711 INFO L87 Difference]: Start difference. First operand 184 states and 243 transitions. Second operand 3 states. [2019-10-03 02:38:05,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:05,764 INFO L93 Difference]: Finished difference Result 182 states and 239 transitions. [2019-10-03 02:38:05,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:38:05,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-10-03 02:38:05,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:05,767 INFO L225 Difference]: With dead ends: 182 [2019-10-03 02:38:05,768 INFO L226 Difference]: Without dead ends: 182 [2019-10-03 02:38:05,768 INFO L640 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-10-03 02:38:05,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-10-03 02:38:05,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2019-10-03 02:38:05,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-10-03 02:38:05,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 239 transitions. [2019-10-03 02:38:05,784 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 239 transitions. Word has length 51 [2019-10-03 02:38:05,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:05,784 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 239 transitions. [2019-10-03 02:38:05,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:38:05,785 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 239 transitions. [2019-10-03 02:38:05,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-03 02:38:05,787 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:05,787 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:05,787 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:05,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:05,788 INFO L82 PathProgramCache]: Analyzing trace with hash 572107035, now seen corresponding path program 1 times [2019-10-03 02:38:05,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:05,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:05,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:05,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:05,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:05,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:05,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:05,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:38:05,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:05,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:38:05,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:38:05,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:05,862 INFO L87 Difference]: Start difference. First operand 182 states and 239 transitions. Second operand 3 states. [2019-10-03 02:38:05,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:05,883 INFO L93 Difference]: Finished difference Result 178 states and 232 transitions. [2019-10-03 02:38:05,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:38:05,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-03 02:38:05,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:05,885 INFO L225 Difference]: With dead ends: 178 [2019-10-03 02:38:05,885 INFO L226 Difference]: Without dead ends: 91 [2019-10-03 02:38:05,886 INFO L640 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-10-03 02:38:05,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-03 02:38:05,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-10-03 02:38:05,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-03 02:38:05,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2019-10-03 02:38:05,890 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 50 [2019-10-03 02:38:05,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:05,890 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2019-10-03 02:38:05,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:38:05,891 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2019-10-03 02:38:05,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 02:38:05,892 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:05,892 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:05,892 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:05,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:05,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1516710605, now seen corresponding path program 1 times [2019-10-03 02:38:05,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:05,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:05,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:05,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:05,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:05,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:05,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:05,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:38:05,977 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:05,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:38:05,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:38:05,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:38:05,978 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 6 states. [2019-10-03 02:38:06,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:06,028 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2019-10-03 02:38:06,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:38:06,028 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-10-03 02:38:06,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:06,029 INFO L225 Difference]: With dead ends: 108 [2019-10-03 02:38:06,030 INFO L226 Difference]: Without dead ends: 101 [2019-10-03 02:38:06,030 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:38:06,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-03 02:38:06,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2019-10-03 02:38:06,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-03 02:38:06,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2019-10-03 02:38:06,034 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 59 [2019-10-03 02:38:06,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:06,035 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2019-10-03 02:38:06,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:38:06,035 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2019-10-03 02:38:06,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 02:38:06,036 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:06,036 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:06,036 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:06,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:06,036 INFO L82 PathProgramCache]: Analyzing trace with hash -367309916, now seen corresponding path program 1 times [2019-10-03 02:38:06,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:06,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:06,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:06,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:06,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:06,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:06,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:06,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:38:06,112 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:06,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:38:06,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:38:06,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:38:06,113 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand 6 states. [2019-10-03 02:38:06,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:06,160 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2019-10-03 02:38:06,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:38:06,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-10-03 02:38:06,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:06,161 INFO L225 Difference]: With dead ends: 100 [2019-10-03 02:38:06,162 INFO L226 Difference]: Without dead ends: 100 [2019-10-03 02:38:06,162 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:38:06,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-03 02:38:06,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-10-03 02:38:06,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-10-03 02:38:06,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2019-10-03 02:38:06,166 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 59 [2019-10-03 02:38:06,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:06,166 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2019-10-03 02:38:06,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:38:06,167 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2019-10-03 02:38:06,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 02:38:06,167 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:06,168 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:06,168 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:06,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:06,168 INFO L82 PathProgramCache]: Analyzing trace with hash 857146700, now seen corresponding path program 1 times [2019-10-03 02:38:06,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:06,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:06,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:06,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:06,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:06,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:06,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:06,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:38:06,213 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:06,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:38:06,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:38:06,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:06,214 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 3 states. [2019-10-03 02:38:06,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:06,228 INFO L93 Difference]: Finished difference Result 180 states and 200 transitions. [2019-10-03 02:38:06,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:38:06,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-03 02:38:06,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:06,230 INFO L225 Difference]: With dead ends: 180 [2019-10-03 02:38:06,230 INFO L226 Difference]: Without dead ends: 180 [2019-10-03 02:38:06,230 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-10-03 02:38:06,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-03 02:38:06,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 168. [2019-10-03 02:38:06,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-10-03 02:38:06,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 188 transitions. [2019-10-03 02:38:06,236 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 188 transitions. Word has length 60 [2019-10-03 02:38:06,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:06,237 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 188 transitions. [2019-10-03 02:38:06,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:38:06,237 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 188 transitions. [2019-10-03 02:38:06,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 02:38:06,238 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:06,238 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:06,238 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:06,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:06,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1662813234, now seen corresponding path program 1 times [2019-10-03 02:38:06,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:06,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:06,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:06,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:06,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:06,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:06,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:06,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:06,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:38:06,298 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:06,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:38:06,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:38:06,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:38:06,299 INFO L87 Difference]: Start difference. First operand 168 states and 188 transitions. Second operand 5 states. [2019-10-03 02:38:06,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:06,410 INFO L93 Difference]: Finished difference Result 156 states and 172 transitions. [2019-10-03 02:38:06,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:38:06,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-10-03 02:38:06,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:06,412 INFO L225 Difference]: With dead ends: 156 [2019-10-03 02:38:06,412 INFO L226 Difference]: Without dead ends: 152 [2019-10-03 02:38:06,412 INFO L640 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-10-03 02:38:06,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-03 02:38:06,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-10-03 02:38:06,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-03 02:38:06,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 168 transitions. [2019-10-03 02:38:06,417 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 168 transitions. Word has length 60 [2019-10-03 02:38:06,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:06,418 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 168 transitions. [2019-10-03 02:38:06,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:38:06,418 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 168 transitions. [2019-10-03 02:38:06,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-03 02:38:06,419 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:06,419 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:06,420 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:06,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:06,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1935953947, now seen corresponding path program 1 times [2019-10-03 02:38:06,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:06,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:06,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:06,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:06,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:06,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:06,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:06,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:38:06,460 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:06,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:38:06,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:38:06,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:06,461 INFO L87 Difference]: Start difference. First operand 152 states and 168 transitions. Second operand 3 states. [2019-10-03 02:38:06,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:06,473 INFO L93 Difference]: Finished difference Result 164 states and 180 transitions. [2019-10-03 02:38:06,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:38:06,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-10-03 02:38:06,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:06,475 INFO L225 Difference]: With dead ends: 164 [2019-10-03 02:38:06,475 INFO L226 Difference]: Without dead ends: 164 [2019-10-03 02:38:06,475 INFO L640 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-10-03 02:38:06,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-03 02:38:06,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 158. [2019-10-03 02:38:06,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-10-03 02:38:06,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 174 transitions. [2019-10-03 02:38:06,481 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 174 transitions. Word has length 62 [2019-10-03 02:38:06,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:06,482 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 174 transitions. [2019-10-03 02:38:06,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:38:06,482 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 174 transitions. [2019-10-03 02:38:06,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-03 02:38:06,483 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:06,483 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:06,484 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:06,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:06,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1349147933, now seen corresponding path program 1 times [2019-10-03 02:38:06,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:06,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:06,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:06,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:06,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:06,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:06,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:06,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:38:06,524 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:06,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:38:06,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:38:06,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:38:06,525 INFO L87 Difference]: Start difference. First operand 158 states and 174 transitions. Second operand 3 states. [2019-10-03 02:38:06,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:06,550 INFO L93 Difference]: Finished difference Result 175 states and 192 transitions. [2019-10-03 02:38:06,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:38:06,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-10-03 02:38:06,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:06,551 INFO L225 Difference]: With dead ends: 175 [2019-10-03 02:38:06,551 INFO L226 Difference]: Without dead ends: 173 [2019-10-03 02:38:06,552 INFO L640 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-10-03 02:38:06,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-10-03 02:38:06,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 162. [2019-10-03 02:38:06,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-10-03 02:38:06,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 177 transitions. [2019-10-03 02:38:06,559 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 177 transitions. Word has length 62 [2019-10-03 02:38:06,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:06,559 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 177 transitions. [2019-10-03 02:38:06,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:38:06,559 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 177 transitions. [2019-10-03 02:38:06,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-03 02:38:06,561 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:06,561 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:06,561 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:06,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:06,562 INFO L82 PathProgramCache]: Analyzing trace with hash 475938380, now seen corresponding path program 1 times [2019-10-03 02:38:06,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:06,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:06,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:06,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:06,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:06,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:06,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:06,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:38:06,650 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:06,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:38:06,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:38:06,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:38:06,652 INFO L87 Difference]: Start difference. First operand 162 states and 177 transitions. Second operand 7 states. [2019-10-03 02:38:06,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:06,712 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2019-10-03 02:38:06,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:38:06,713 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-10-03 02:38:06,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:06,714 INFO L225 Difference]: With dead ends: 162 [2019-10-03 02:38:06,714 INFO L226 Difference]: Without dead ends: 162 [2019-10-03 02:38:06,715 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:38:06,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-10-03 02:38:06,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-10-03 02:38:06,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-10-03 02:38:06,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2019-10-03 02:38:06,721 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 62 [2019-10-03 02:38:06,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:06,722 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2019-10-03 02:38:06,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:38:06,722 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2019-10-03 02:38:06,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-03 02:38:06,724 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:06,724 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:06,725 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:06,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:06,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1363732376, now seen corresponding path program 1 times [2019-10-03 02:38:06,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:06,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:06,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:06,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:06,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:06,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:06,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:06,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:38:06,928 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:06,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:38:06,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:38:06,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:38:06,929 INFO L87 Difference]: Start difference. First operand 162 states and 173 transitions. Second operand 11 states. [2019-10-03 02:38:07,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:07,173 INFO L93 Difference]: Finished difference Result 170 states and 180 transitions. [2019-10-03 02:38:07,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:38:07,174 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-10-03 02:38:07,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:07,175 INFO L225 Difference]: With dead ends: 170 [2019-10-03 02:38:07,175 INFO L226 Difference]: Without dead ends: 151 [2019-10-03 02:38:07,176 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:38:07,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-10-03 02:38:07,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 140. [2019-10-03 02:38:07,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-03 02:38:07,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions. [2019-10-03 02:38:07,184 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 63 [2019-10-03 02:38:07,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:07,185 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions. [2019-10-03 02:38:07,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:38:07,185 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2019-10-03 02:38:07,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-03 02:38:07,186 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:07,186 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:07,187 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:07,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:07,187 INFO L82 PathProgramCache]: Analyzing trace with hash 359859562, now seen corresponding path program 1 times [2019-10-03 02:38:07,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:07,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:07,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:07,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:07,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:07,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:07,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:07,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:38:07,313 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:07,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:38:07,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:38:07,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:38:07,315 INFO L87 Difference]: Start difference. First operand 140 states and 149 transitions. Second operand 5 states. [2019-10-03 02:38:07,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:07,420 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2019-10-03 02:38:07,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:38:07,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-10-03 02:38:07,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:07,422 INFO L225 Difference]: With dead ends: 135 [2019-10-03 02:38:07,422 INFO L226 Difference]: Without dead ends: 133 [2019-10-03 02:38:07,422 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:38:07,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-03 02:38:07,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-10-03 02:38:07,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-10-03 02:38:07,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2019-10-03 02:38:07,428 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 63 [2019-10-03 02:38:07,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:07,429 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2019-10-03 02:38:07,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:38:07,429 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2019-10-03 02:38:07,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-03 02:38:07,430 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:07,430 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:07,430 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:07,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:07,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1291919834, now seen corresponding path program 1 times [2019-10-03 02:38:07,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:07,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:07,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:07,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:07,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:07,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:07,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:07,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:38:07,531 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:07,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:38:07,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:38:07,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:38:07,533 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 6 states. [2019-10-03 02:38:07,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:07,567 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2019-10-03 02:38:07,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:38:07,567 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-10-03 02:38:07,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:07,569 INFO L225 Difference]: With dead ends: 133 [2019-10-03 02:38:07,569 INFO L226 Difference]: Without dead ends: 133 [2019-10-03 02:38:07,569 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:38:07,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-03 02:38:07,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-10-03 02:38:07,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-10-03 02:38:07,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2019-10-03 02:38:07,579 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 63 [2019-10-03 02:38:07,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:07,579 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2019-10-03 02:38:07,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:38:07,579 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2019-10-03 02:38:07,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-03 02:38:07,582 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:07,582 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:07,583 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:07,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:07,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1154361885, now seen corresponding path program 1 times [2019-10-03 02:38:07,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:07,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:07,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:07,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:07,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:07,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:38:07,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:07,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:38:07,677 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:07,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:38:07,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:38:07,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:38:07,678 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand 6 states. [2019-10-03 02:38:07,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:07,776 INFO L93 Difference]: Finished difference Result 104 states and 103 transitions. [2019-10-03 02:38:07,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:38:07,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-10-03 02:38:07,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:07,777 INFO L225 Difference]: With dead ends: 104 [2019-10-03 02:38:07,777 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:38:07,777 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-10-03 02:38:07,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:38:07,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:38:07,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:38:07,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:38:07,778 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2019-10-03 02:38:07,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:07,778 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:38:07,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:38:07,779 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:38:07,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:38:07,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:38:07 BoogieIcfgContainer [2019-10-03 02:38:07,786 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:38:07,790 INFO L168 Benchmark]: Toolchain (without parser) took 5387.98 ms. Allocated memory was 130.5 MB in the beginning and 272.6 MB in the end (delta: 142.1 MB). Free memory was 86.2 MB in the beginning and 74.2 MB in the end (delta: 11.9 MB). Peak memory consumption was 154.0 MB. Max. memory is 7.1 GB. [2019-10-03 02:38:07,792 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 130.5 MB. Free memory was 104.8 MB in the beginning and 104.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:38:07,796 INFO L168 Benchmark]: CACSL2BoogieTranslator took 468.48 ms. Allocated memory was 130.5 MB in the beginning and 198.7 MB in the end (delta: 68.2 MB). Free memory was 86.0 MB in the beginning and 172.0 MB in the end (delta: -86.0 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:38:07,796 INFO L168 Benchmark]: Boogie Preprocessor took 72.83 ms. Allocated memory is still 198.7 MB. Free memory was 172.0 MB in the beginning and 169.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-10-03 02:38:07,797 INFO L168 Benchmark]: RCFGBuilder took 809.06 ms. Allocated memory is still 198.7 MB. Free memory was 169.3 MB in the beginning and 124.6 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:38:07,798 INFO L168 Benchmark]: TraceAbstraction took 4032.74 ms. Allocated memory was 198.7 MB in the beginning and 272.6 MB in the end (delta: 73.9 MB). Free memory was 124.6 MB in the beginning and 74.2 MB in the end (delta: 50.4 MB). Peak memory consumption was 124.3 MB. Max. memory is 7.1 GB. [2019-10-03 02:38:07,801 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.21 ms. Allocated memory is still 130.5 MB. Free memory was 104.8 MB in the beginning and 104.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 468.48 ms. Allocated memory was 130.5 MB in the beginning and 198.7 MB in the end (delta: 68.2 MB). Free memory was 86.0 MB in the beginning and 172.0 MB in the end (delta: -86.0 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 72.83 ms. Allocated memory is still 198.7 MB. Free memory was 172.0 MB in the beginning and 169.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 809.06 ms. Allocated memory is still 198.7 MB. Free memory was 169.3 MB in the beginning and 124.6 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4032.74 ms. Allocated memory was 198.7 MB in the beginning and 272.6 MB in the end (delta: 73.9 MB). Free memory was 124.6 MB in the beginning and 74.2 MB in the end (delta: 50.4 MB). Peak memory consumption was 124.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 151 locations, 1 error locations. SAFE Result, 3.9s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2242 SDtfs, 1327 SDslu, 2975 SDs, 0 SdLazy, 661 SolverSat, 192 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 52 SyntacticMatches, 11 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 114 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 943 NumberOfCodeBlocks, 943 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 925 ConstructedInterpolants, 0 QuantifiedInterpolants, 94387 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...