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-112bae1 [2019-09-09 05:46:29,955 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:46:29,957 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:46:29,970 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:46:29,970 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:46:29,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:46:29,972 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:46:29,974 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:46:29,976 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:46:29,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:46:29,978 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:46:29,979 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:46:29,980 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:46:29,980 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:46:29,981 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:46:29,983 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:46:29,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:46:29,984 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:46:29,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:46:29,988 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:46:29,989 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:46:29,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:46:29,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:46:29,992 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:46:29,995 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:46:29,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:46:29,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:46:29,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:46:29,997 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:46:29,998 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:46:29,998 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:46:29,999 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:46:29,999 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:46:30,000 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:46:30,001 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:46:30,002 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:46:30,002 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:46:30,002 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:46:30,003 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:46:30,004 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:46:30,004 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:46:30,005 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-09-09 05:46:30,020 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:46:30,020 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:46:30,020 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:46:30,021 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:46:30,021 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:46:30,021 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:46:30,022 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:46:30,022 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:46:30,022 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:46:30,022 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:46:30,023 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:46:30,023 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:46:30,023 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:46:30,024 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:46:30,024 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:46:30,024 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:46:30,024 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:46:30,024 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:46:30,024 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:46:30,025 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:46:30,025 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:46:30,025 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:46:30,025 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:46:30,026 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:46:30,026 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:46:30,026 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:46:30,027 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:46:30,028 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:46:30,028 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:46:30,028 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:46:30,080 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:46:30,095 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:46:30,099 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:46:30,101 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:46:30,102 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:46:30,103 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-09-09 05:46:30,179 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0256b892c/c379ee43c06946d0954dc33d55eb4927/FLAG77745faf6 [2019-09-09 05:46:30,625 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:46:30,625 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2019-09-09 05:46:30,638 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0256b892c/c379ee43c06946d0954dc33d55eb4927/FLAG77745faf6 [2019-09-09 05:46:30,972 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0256b892c/c379ee43c06946d0954dc33d55eb4927 [2019-09-09 05:46:30,982 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:46:30,983 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:46:30,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:46:30,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:46:30,991 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:46:30,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:46:30" (1/1) ... [2019-09-09 05:46:30,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4de14efe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:30, skipping insertion in model container [2019-09-09 05:46:30,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:46:30" (1/1) ... [2019-09-09 05:46:31,003 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:46:31,064 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:46:31,372 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:46:31,378 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:46:31,535 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:46:31,553 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:46:31,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:31 WrapperNode [2019-09-09 05:46:31,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:46:31,555 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:46:31,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:46:31,555 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:46:31,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:31" (1/1) ... [2019-09-09 05:46:31,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:31" (1/1) ... [2019-09-09 05:46:31,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:31" (1/1) ... [2019-09-09 05:46:31,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:31" (1/1) ... [2019-09-09 05:46:31,589 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:31" (1/1) ... [2019-09-09 05:46:31,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:31" (1/1) ... [2019-09-09 05:46:31,600 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:31" (1/1) ... [2019-09-09 05:46:31,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:46:31,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:46:31,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:46:31,606 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:46:31,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:31" (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-09-09 05:46:31,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:46:31,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:46:31,671 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-09-09 05:46:31,671 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-09-09 05:46:31,671 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2019-09-09 05:46:31,671 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:46:31,671 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-09-09 05:46:31,671 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-09-09 05:46:31,671 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-09-09 05:46:31,671 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-09-09 05:46:31,671 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-09-09 05:46:31,672 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2019-09-09 05:46:31,672 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-09-09 05:46:31,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:46:31,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-09 05:46:31,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:46:31,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-09 05:46:31,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-09 05:46:31,673 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2019-09-09 05:46:31,673 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-09-09 05:46:31,673 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-09-09 05:46:31,673 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-09-09 05:46:31,673 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2019-09-09 05:46:31,674 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-09-09 05:46:31,674 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-09-09 05:46:31,674 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-09-09 05:46:31,674 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-09-09 05:46:31,674 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:46:31,674 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-09-09 05:46:31,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:46:31,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:46:31,954 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:32,082 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2019-09-09 05:46:32,082 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2019-09-09 05:46:32,083 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:32,148 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2019-09-09 05:46:32,149 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2019-09-09 05:46:32,171 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:32,203 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-09-09 05:46:32,203 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-09-09 05:46:32,220 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:32,352 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2019-09-09 05:46:32,352 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2019-09-09 05:46:32,364 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:46:32,365 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-09 05:46:32,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:46:32 BoogieIcfgContainer [2019-09-09 05:46:32,367 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:46:32,368 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:46:32,368 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:46:32,371 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:46:32,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:46:30" (1/3) ... [2019-09-09 05:46:32,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364f64d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:46:32, skipping insertion in model container [2019-09-09 05:46:32,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:31" (2/3) ... [2019-09-09 05:46:32,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364f64d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:46:32, skipping insertion in model container [2019-09-09 05:46:32,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:46:32" (3/3) ... [2019-09-09 05:46:32,377 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2019-09-09 05:46:32,388 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:46:32,403 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:46:32,420 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:46:32,444 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:46:32,444 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:46:32,444 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:46:32,444 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:46:32,445 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:46:32,445 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:46:32,445 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:46:32,445 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:46:32,466 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2019-09-09 05:46:32,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-09 05:46:32,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:32,478 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:32,480 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:32,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:32,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1530382191, now seen corresponding path program 1 times [2019-09-09 05:46:32,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:32,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:32,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:32,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:32,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:32,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:32,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:32,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:32,726 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:32,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:32,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:32,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:32,753 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 3 states. [2019-09-09 05:46:32,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:32,845 INFO L93 Difference]: Finished difference Result 152 states and 213 transitions. [2019-09-09 05:46:32,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:32,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-09 05:46:32,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:32,861 INFO L225 Difference]: With dead ends: 152 [2019-09-09 05:46:32,861 INFO L226 Difference]: Without dead ends: 140 [2019-09-09 05:46:32,863 INFO L628 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-09-09 05:46:32,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-09 05:46:32,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-09-09 05:46:32,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-09 05:46:32,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2019-09-09 05:46:32,925 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 20 [2019-09-09 05:46:32,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:32,925 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2019-09-09 05:46:32,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:32,926 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2019-09-09 05:46:32,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-09 05:46:32,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:32,927 INFO L399 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-09-09 05:46:32,928 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:32,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:32,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1141575010, now seen corresponding path program 1 times [2019-09-09 05:46:32,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:32,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:32,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:32,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:32,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:33,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:33,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:33,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:33,129 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:33,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:33,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:33,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:33,133 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand 3 states. [2019-09-09 05:46:33,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:33,311 INFO L93 Difference]: Finished difference Result 203 states and 268 transitions. [2019-09-09 05:46:33,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:33,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-09 05:46:33,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:33,315 INFO L225 Difference]: With dead ends: 203 [2019-09-09 05:46:33,316 INFO L226 Difference]: Without dead ends: 202 [2019-09-09 05:46:33,317 INFO L628 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-09-09 05:46:33,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-09 05:46:33,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 189. [2019-09-09 05:46:33,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-09 05:46:33,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 252 transitions. [2019-09-09 05:46:33,340 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 252 transitions. Word has length 26 [2019-09-09 05:46:33,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:33,341 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 252 transitions. [2019-09-09 05:46:33,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:33,341 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 252 transitions. [2019-09-09 05:46:33,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-09 05:46:33,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:33,342 INFO L399 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-09-09 05:46:33,343 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:33,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:33,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1029098174, now seen corresponding path program 1 times [2019-09-09 05:46:33,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:33,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:33,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:33,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:33,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:33,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:33,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:33,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:46:33,544 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:33,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:46:33,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:46:33,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:46:33,545 INFO L87 Difference]: Start difference. First operand 189 states and 252 transitions. Second operand 4 states. [2019-09-09 05:46:33,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:33,628 INFO L93 Difference]: Finished difference Result 248 states and 328 transitions. [2019-09-09 05:46:33,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:46:33,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-09-09 05:46:33,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:33,634 INFO L225 Difference]: With dead ends: 248 [2019-09-09 05:46:33,635 INFO L226 Difference]: Without dead ends: 248 [2019-09-09 05:46:33,641 INFO L628 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-09-09 05:46:33,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-09-09 05:46:33,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 211. [2019-09-09 05:46:33,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-09 05:46:33,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 282 transitions. [2019-09-09 05:46:33,685 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 282 transitions. Word has length 27 [2019-09-09 05:46:33,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:33,686 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 282 transitions. [2019-09-09 05:46:33,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:46:33,686 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 282 transitions. [2019-09-09 05:46:33,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-09 05:46:33,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:33,689 INFO L399 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-09-09 05:46:33,689 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:33,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:33,690 INFO L82 PathProgramCache]: Analyzing trace with hash 742933031, now seen corresponding path program 1 times [2019-09-09 05:46:33,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:33,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:33,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:33,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:33,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:33,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:33,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:33,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:46:33,854 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:33,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:46:33,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:46:33,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:46:33,857 INFO L87 Difference]: Start difference. First operand 211 states and 282 transitions. Second operand 4 states. [2019-09-09 05:46:34,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:34,008 INFO L93 Difference]: Finished difference Result 211 states and 281 transitions. [2019-09-09 05:46:34,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:46:34,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-09-09 05:46:34,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:34,011 INFO L225 Difference]: With dead ends: 211 [2019-09-09 05:46:34,011 INFO L226 Difference]: Without dead ends: 211 [2019-09-09 05:46:34,012 INFO L628 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-09-09 05:46:34,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-09 05:46:34,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-09-09 05:46:34,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-09 05:46:34,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 281 transitions. [2019-09-09 05:46:34,029 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 281 transitions. Word has length 37 [2019-09-09 05:46:34,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:34,029 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 281 transitions. [2019-09-09 05:46:34,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:46:34,030 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 281 transitions. [2019-09-09 05:46:34,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-09 05:46:34,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:34,034 INFO L399 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-09-09 05:46:34,036 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:34,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:34,037 INFO L82 PathProgramCache]: Analyzing trace with hash 324263340, now seen corresponding path program 1 times [2019-09-09 05:46:34,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:34,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:34,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:34,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:34,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:34,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:34,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:34,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:46:34,108 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:34,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:46:34,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:46:34,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:46:34,109 INFO L87 Difference]: Start difference. First operand 211 states and 281 transitions. Second operand 4 states. [2019-09-09 05:46:34,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:34,188 INFO L93 Difference]: Finished difference Result 202 states and 264 transitions. [2019-09-09 05:46:34,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:46:34,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-09-09 05:46:34,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:34,190 INFO L225 Difference]: With dead ends: 202 [2019-09-09 05:46:34,190 INFO L226 Difference]: Without dead ends: 202 [2019-09-09 05:46:34,191 INFO L628 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-09-09 05:46:34,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-09 05:46:34,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 184. [2019-09-09 05:46:34,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-09 05:46:34,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 243 transitions. [2019-09-09 05:46:34,202 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 243 transitions. Word has length 45 [2019-09-09 05:46:34,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:34,202 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 243 transitions. [2019-09-09 05:46:34,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:46:34,202 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 243 transitions. [2019-09-09 05:46:34,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-09 05:46:34,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:34,205 INFO L399 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-09-09 05:46:34,205 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:34,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:34,206 INFO L82 PathProgramCache]: Analyzing trace with hash 726030577, now seen corresponding path program 1 times [2019-09-09 05:46:34,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:34,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:34,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:34,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:34,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:34,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:34,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:34,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:34,260 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:34,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:34,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:34,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:34,261 INFO L87 Difference]: Start difference. First operand 184 states and 243 transitions. Second operand 3 states. [2019-09-09 05:46:34,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:34,323 INFO L93 Difference]: Finished difference Result 182 states and 239 transitions. [2019-09-09 05:46:34,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:34,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-09-09 05:46:34,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:34,326 INFO L225 Difference]: With dead ends: 182 [2019-09-09 05:46:34,326 INFO L226 Difference]: Without dead ends: 182 [2019-09-09 05:46:34,326 INFO L628 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-09-09 05:46:34,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-09 05:46:34,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2019-09-09 05:46:34,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-09 05:46:34,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 239 transitions. [2019-09-09 05:46:34,336 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 239 transitions. Word has length 51 [2019-09-09 05:46:34,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:34,336 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 239 transitions. [2019-09-09 05:46:34,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:34,337 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 239 transitions. [2019-09-09 05:46:34,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-09 05:46:34,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:34,340 INFO L399 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-09-09 05:46:34,340 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:34,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:34,341 INFO L82 PathProgramCache]: Analyzing trace with hash 572107035, now seen corresponding path program 1 times [2019-09-09 05:46:34,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:34,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:34,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:34,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:34,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:34,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:34,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:34,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:34,411 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:34,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:34,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:34,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:34,414 INFO L87 Difference]: Start difference. First operand 182 states and 239 transitions. Second operand 3 states. [2019-09-09 05:46:34,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:34,437 INFO L93 Difference]: Finished difference Result 178 states and 232 transitions. [2019-09-09 05:46:34,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:34,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-09-09 05:46:34,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:34,450 INFO L225 Difference]: With dead ends: 178 [2019-09-09 05:46:34,451 INFO L226 Difference]: Without dead ends: 91 [2019-09-09 05:46:34,451 INFO L628 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-09-09 05:46:34,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-09 05:46:34,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-09-09 05:46:34,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-09 05:46:34,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2019-09-09 05:46:34,459 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 50 [2019-09-09 05:46:34,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:34,460 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2019-09-09 05:46:34,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:34,460 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2019-09-09 05:46:34,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-09 05:46:34,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:34,462 INFO L399 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-09-09 05:46:34,462 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:34,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:34,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1516710605, now seen corresponding path program 1 times [2019-09-09 05:46:34,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:34,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:34,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:34,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:34,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:34,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:34,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:34,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:46:34,556 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:34,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:46:34,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:46:34,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:34,557 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 6 states. [2019-09-09 05:46:34,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:34,605 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2019-09-09 05:46:34,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:34,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-09-09 05:46:34,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:34,608 INFO L225 Difference]: With dead ends: 108 [2019-09-09 05:46:34,608 INFO L226 Difference]: Without dead ends: 101 [2019-09-09 05:46:34,608 INFO L628 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-09-09 05:46:34,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-09 05:46:34,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2019-09-09 05:46:34,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-09 05:46:34,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2019-09-09 05:46:34,615 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 59 [2019-09-09 05:46:34,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:34,615 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2019-09-09 05:46:34,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:46:34,616 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2019-09-09 05:46:34,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-09 05:46:34,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:34,617 INFO L399 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-09-09 05:46:34,617 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:34,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:34,619 INFO L82 PathProgramCache]: Analyzing trace with hash -367309916, now seen corresponding path program 1 times [2019-09-09 05:46:34,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:34,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:34,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:34,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:34,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:34,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:34,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:34,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:46:34,700 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:34,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:46:34,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:46:34,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:34,701 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand 6 states. [2019-09-09 05:46:34,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:34,747 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2019-09-09 05:46:34,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:34,748 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-09-09 05:46:34,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:34,749 INFO L225 Difference]: With dead ends: 100 [2019-09-09 05:46:34,749 INFO L226 Difference]: Without dead ends: 100 [2019-09-09 05:46:34,750 INFO L628 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-09-09 05:46:34,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-09 05:46:34,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-09-09 05:46:34,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-09 05:46:34,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2019-09-09 05:46:34,753 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 59 [2019-09-09 05:46:34,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:34,754 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2019-09-09 05:46:34,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:46:34,754 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2019-09-09 05:46:34,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-09 05:46:34,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:34,755 INFO L399 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-09-09 05:46:34,756 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:34,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:34,756 INFO L82 PathProgramCache]: Analyzing trace with hash 857146700, now seen corresponding path program 1 times [2019-09-09 05:46:34,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:34,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:34,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:34,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:34,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:34,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:34,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:34,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:34,802 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:34,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:34,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:34,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:34,804 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 3 states. [2019-09-09 05:46:34,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:34,825 INFO L93 Difference]: Finished difference Result 180 states and 200 transitions. [2019-09-09 05:46:34,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:34,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-09 05:46:34,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:34,827 INFO L225 Difference]: With dead ends: 180 [2019-09-09 05:46:34,828 INFO L226 Difference]: Without dead ends: 180 [2019-09-09 05:46:34,828 INFO L628 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-09-09 05:46:34,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-09 05:46:34,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 168. [2019-09-09 05:46:34,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-09 05:46:34,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 188 transitions. [2019-09-09 05:46:34,838 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 188 transitions. Word has length 60 [2019-09-09 05:46:34,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:34,839 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 188 transitions. [2019-09-09 05:46:34,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:34,839 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 188 transitions. [2019-09-09 05:46:34,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-09 05:46:34,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:34,840 INFO L399 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-09-09 05:46:34,841 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:34,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:34,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1662813234, now seen corresponding path program 1 times [2019-09-09 05:46:34,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:34,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:34,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:34,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:34,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:34,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:34,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:34,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:34,950 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:34,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:34,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:34,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:34,952 INFO L87 Difference]: Start difference. First operand 168 states and 188 transitions. Second operand 5 states. [2019-09-09 05:46:35,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:35,082 INFO L93 Difference]: Finished difference Result 156 states and 172 transitions. [2019-09-09 05:46:35,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:46:35,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-09-09 05:46:35,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:35,085 INFO L225 Difference]: With dead ends: 156 [2019-09-09 05:46:35,085 INFO L226 Difference]: Without dead ends: 152 [2019-09-09 05:46:35,086 INFO L628 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-09-09 05:46:35,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-09 05:46:35,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-09-09 05:46:35,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-09 05:46:35,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 168 transitions. [2019-09-09 05:46:35,092 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 168 transitions. Word has length 60 [2019-09-09 05:46:35,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:35,093 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 168 transitions. [2019-09-09 05:46:35,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:35,093 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 168 transitions. [2019-09-09 05:46:35,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-09 05:46:35,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:35,095 INFO L399 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-09-09 05:46:35,095 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:35,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:35,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1935953947, now seen corresponding path program 1 times [2019-09-09 05:46:35,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:35,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:35,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:35,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:35,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:35,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:35,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:35,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:35,145 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:35,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:35,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:35,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:35,147 INFO L87 Difference]: Start difference. First operand 152 states and 168 transitions. Second operand 3 states. [2019-09-09 05:46:35,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:35,161 INFO L93 Difference]: Finished difference Result 164 states and 180 transitions. [2019-09-09 05:46:35,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:35,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-09-09 05:46:35,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:35,163 INFO L225 Difference]: With dead ends: 164 [2019-09-09 05:46:35,163 INFO L226 Difference]: Without dead ends: 164 [2019-09-09 05:46:35,164 INFO L628 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-09-09 05:46:35,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-09 05:46:35,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 158. [2019-09-09 05:46:35,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-09 05:46:35,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 174 transitions. [2019-09-09 05:46:35,171 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 174 transitions. Word has length 62 [2019-09-09 05:46:35,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:35,171 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 174 transitions. [2019-09-09 05:46:35,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:35,172 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 174 transitions. [2019-09-09 05:46:35,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-09 05:46:35,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:35,173 INFO L399 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-09-09 05:46:35,173 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:35,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:35,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1349147933, now seen corresponding path program 1 times [2019-09-09 05:46:35,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:35,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:35,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:35,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:35,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:35,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:35,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:35,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:35,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:35,228 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:35,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:35,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:35,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:35,232 INFO L87 Difference]: Start difference. First operand 158 states and 174 transitions. Second operand 3 states. [2019-09-09 05:46:35,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:35,273 INFO L93 Difference]: Finished difference Result 175 states and 192 transitions. [2019-09-09 05:46:35,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:35,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-09-09 05:46:35,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:35,275 INFO L225 Difference]: With dead ends: 175 [2019-09-09 05:46:35,275 INFO L226 Difference]: Without dead ends: 173 [2019-09-09 05:46:35,275 INFO L628 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-09-09 05:46:35,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-09 05:46:35,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 162. [2019-09-09 05:46:35,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-09 05:46:35,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 177 transitions. [2019-09-09 05:46:35,286 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 177 transitions. Word has length 62 [2019-09-09 05:46:35,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:35,287 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 177 transitions. [2019-09-09 05:46:35,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:35,287 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 177 transitions. [2019-09-09 05:46:35,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-09 05:46:35,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:35,289 INFO L399 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-09-09 05:46:35,289 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:35,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:35,290 INFO L82 PathProgramCache]: Analyzing trace with hash 475938380, now seen corresponding path program 1 times [2019-09-09 05:46:35,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:35,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:35,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:35,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:35,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:35,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:35,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:35,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:35,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-09 05:46:35,403 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:35,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-09 05:46:35,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-09 05:46:35,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:35,404 INFO L87 Difference]: Start difference. First operand 162 states and 177 transitions. Second operand 7 states. [2019-09-09 05:46:35,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:35,449 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2019-09-09 05:46:35,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:35,450 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-09-09 05:46:35,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:35,451 INFO L225 Difference]: With dead ends: 162 [2019-09-09 05:46:35,451 INFO L226 Difference]: Without dead ends: 162 [2019-09-09 05:46:35,452 INFO L628 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-09-09 05:46:35,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-09 05:46:35,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-09-09 05:46:35,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-09 05:46:35,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2019-09-09 05:46:35,459 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 62 [2019-09-09 05:46:35,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:35,460 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2019-09-09 05:46:35,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-09 05:46:35,460 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2019-09-09 05:46:35,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:46:35,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:35,461 INFO L399 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-09-09 05:46:35,462 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:35,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:35,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1363732376, now seen corresponding path program 1 times [2019-09-09 05:46:35,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:35,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:35,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:35,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:35,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:35,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:35,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:35,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-09 05:46:35,612 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:35,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-09 05:46:35,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-09 05:46:35,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:35,613 INFO L87 Difference]: Start difference. First operand 162 states and 173 transitions. Second operand 7 states. [2019-09-09 05:46:35,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:35,779 INFO L93 Difference]: Finished difference Result 170 states and 180 transitions. [2019-09-09 05:46:35,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 05:46:35,780 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-09-09 05:46:35,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:35,781 INFO L225 Difference]: With dead ends: 170 [2019-09-09 05:46:35,781 INFO L226 Difference]: Without dead ends: 151 [2019-09-09 05:46:35,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-09-09 05:46:35,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-09-09 05:46:35,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 140. [2019-09-09 05:46:35,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-09 05:46:35,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions. [2019-09-09 05:46:35,788 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 63 [2019-09-09 05:46:35,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:35,788 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions. [2019-09-09 05:46:35,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-09 05:46:35,788 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2019-09-09 05:46:35,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:46:35,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:35,790 INFO L399 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-09-09 05:46:35,790 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:35,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:35,791 INFO L82 PathProgramCache]: Analyzing trace with hash 359859562, now seen corresponding path program 1 times [2019-09-09 05:46:35,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:35,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:35,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:35,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:35,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:35,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:35,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:35,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:35,924 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:35,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:35,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:35,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:35,925 INFO L87 Difference]: Start difference. First operand 140 states and 149 transitions. Second operand 5 states. [2019-09-09 05:46:36,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:36,034 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2019-09-09 05:46:36,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:36,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-09 05:46:36,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:36,035 INFO L225 Difference]: With dead ends: 135 [2019-09-09 05:46:36,036 INFO L226 Difference]: Without dead ends: 133 [2019-09-09 05:46:36,036 INFO L628 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-09-09 05:46:36,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-09 05:46:36,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-09-09 05:46:36,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-09-09 05:46:36,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2019-09-09 05:46:36,043 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 63 [2019-09-09 05:46:36,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:36,044 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2019-09-09 05:46:36,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:36,044 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2019-09-09 05:46:36,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-09 05:46:36,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:36,046 INFO L399 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-09-09 05:46:36,047 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:36,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:36,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1291919834, now seen corresponding path program 1 times [2019-09-09 05:46:36,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:36,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:36,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:36,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:36,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:36,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:36,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:36,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:36,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:46:36,154 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:36,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:46:36,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:46:36,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:36,156 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 6 states. [2019-09-09 05:46:36,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:36,187 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2019-09-09 05:46:36,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:36,188 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-09-09 05:46:36,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:36,189 INFO L225 Difference]: With dead ends: 133 [2019-09-09 05:46:36,190 INFO L226 Difference]: Without dead ends: 133 [2019-09-09 05:46:36,190 INFO L628 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-09-09 05:46:36,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-09 05:46:36,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-09-09 05:46:36,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-09-09 05:46:36,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2019-09-09 05:46:36,198 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 63 [2019-09-09 05:46:36,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:36,199 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2019-09-09 05:46:36,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:46:36,199 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2019-09-09 05:46:36,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-09 05:46:36,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:36,201 INFO L399 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-09-09 05:46:36,201 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:36,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:36,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1154361885, now seen corresponding path program 1 times [2019-09-09 05:46:36,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:36,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:36,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:36,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:36,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:36,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:36,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:36,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:46:36,306 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:36,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:46:36,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:46:36,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:36,307 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand 6 states. [2019-09-09 05:46:36,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:36,408 INFO L93 Difference]: Finished difference Result 104 states and 103 transitions. [2019-09-09 05:46:36,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:46:36,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-09-09 05:46:36,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:36,409 INFO L225 Difference]: With dead ends: 104 [2019-09-09 05:46:36,409 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:46:36,409 INFO L628 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-09-09 05:46:36,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:46:36,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:46:36,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:46:36,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:46:36,410 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2019-09-09 05:46:36,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:36,411 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:46:36,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:46:36,411 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:46:36,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:46:36,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:46:36 BoogieIcfgContainer [2019-09-09 05:46:36,419 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:46:36,423 INFO L168 Benchmark]: Toolchain (without parser) took 5438.10 ms. Allocated memory was 134.2 MB in the beginning and 307.2 MB in the end (delta: 173.0 MB). Free memory was 90.0 MB in the beginning and 252.0 MB in the end (delta: -162.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2019-09-09 05:46:36,425 INFO L168 Benchmark]: CDTParser took 1.21 ms. Allocated memory is still 134.2 MB. Free memory was 108.7 MB in the beginning and 108.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 05:46:36,431 INFO L168 Benchmark]: CACSL2BoogieTranslator took 570.04 ms. Allocated memory was 134.2 MB in the beginning and 201.3 MB in the end (delta: 67.1 MB). Free memory was 89.6 MB in the beginning and 175.2 MB in the end (delta: -85.6 MB). Peak memory consumption was 28.0 MB. Max. memory is 7.1 GB. [2019-09-09 05:46:36,432 INFO L168 Benchmark]: Boogie Preprocessor took 50.14 ms. Allocated memory is still 201.3 MB. Free memory was 175.2 MB in the beginning and 172.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-09-09 05:46:36,433 INFO L168 Benchmark]: RCFGBuilder took 761.33 ms. Allocated memory is still 201.3 MB. Free memory was 172.8 MB in the beginning and 128.9 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. [2019-09-09 05:46:36,434 INFO L168 Benchmark]: TraceAbstraction took 4051.61 ms. Allocated memory was 201.3 MB in the beginning and 307.2 MB in the end (delta: 105.9 MB). Free memory was 128.9 MB in the beginning and 252.0 MB in the end (delta: -123.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-09-09 05:46:36,449 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.21 ms. Allocated memory is still 134.2 MB. Free memory was 108.7 MB in the beginning and 108.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 570.04 ms. Allocated memory was 134.2 MB in the beginning and 201.3 MB in the end (delta: 67.1 MB). Free memory was 89.6 MB in the beginning and 175.2 MB in the end (delta: -85.6 MB). Peak memory consumption was 28.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.14 ms. Allocated memory is still 201.3 MB. Free memory was 175.2 MB in the beginning and 172.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 761.33 ms. Allocated memory is still 201.3 MB. Free memory was 172.8 MB in the beginning and 128.9 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4051.61 ms. Allocated memory was 201.3 MB in the beginning and 307.2 MB in the end (delta: 105.9 MB). Free memory was 128.9 MB in the beginning and 252.0 MB in the end (delta: -123.1 MB). There was no memory consumed. 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: 2243 SDtfs, 1294 SDslu, 2856 SDs, 0 SdLazy, 602 SolverSat, 185 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 52 SyntacticMatches, 11 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s 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.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 943 NumberOfCodeBlocks, 943 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 925 ConstructedInterpolants, 0 QuantifiedInterpolants, 91783 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...