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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 23:01:08,092 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:01:08,094 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:01:08,105 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:01:08,106 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:01:08,107 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:01:08,108 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:01:08,110 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:01:08,111 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:01:08,112 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:01:08,113 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:01:08,114 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:01:08,115 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:01:08,116 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:01:08,116 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:01:08,118 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:01:08,118 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:01:08,119 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:01:08,121 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:01:08,123 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:01:08,127 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:01:08,131 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:01:08,133 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:01:08,135 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:01:08,139 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:01:08,140 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:01:08,140 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:01:08,141 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:01:08,141 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:01:08,142 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:01:08,143 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:01:08,143 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:01:08,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:01:08,146 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:01:08,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:01:08,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:01:08,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:01:08,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:01:08,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:01:08,149 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:01:08,152 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:01:08,153 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 23:01:08,174 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:01:08,174 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:01:08,176 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:01:08,176 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:01:08,177 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:01:08,177 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:01:08,177 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:01:08,177 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:01:08,177 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:01:08,178 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:01:08,178 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:01:08,179 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:01:08,179 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:01:08,179 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:01:08,179 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:01:08,180 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:01:08,180 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:01:08,180 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:01:08,180 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:01:08,180 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:01:08,181 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:01:08,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:01:08,181 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:01:08,181 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:01:08,182 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:01:08,182 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:01:08,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:01:08,182 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:01:08,182 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 23:01:08,453 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:01:08,465 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:01:08,469 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:01:08,470 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:01:08,470 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:01:08,471 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2019-10-13 23:01:08,529 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/584d50405/ec767277ff944e0ab24e7f697f801d1d/FLAG7cc1a4a20 [2019-10-13 23:01:09,039 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:01:09,042 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2019-10-13 23:01:09,063 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/584d50405/ec767277ff944e0ab24e7f697f801d1d/FLAG7cc1a4a20 [2019-10-13 23:01:09,342 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/584d50405/ec767277ff944e0ab24e7f697f801d1d [2019-10-13 23:01:09,351 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:01:09,353 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:01:09,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:01:09,354 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:01:09,357 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:01:09,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:01:09" (1/1) ... [2019-10-13 23:01:09,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f913358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:09, skipping insertion in model container [2019-10-13 23:01:09,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:01:09" (1/1) ... [2019-10-13 23:01:09,368 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:01:09,423 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:01:09,768 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:01:09,778 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:01:09,972 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:01:09,996 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:01:09,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:09 WrapperNode [2019-10-13 23:01:09,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:01:09,997 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:01:09,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:01:09,997 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:01:10,012 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:09" (1/1) ... [2019-10-13 23:01:10,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:09" (1/1) ... [2019-10-13 23:01:10,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:09" (1/1) ... [2019-10-13 23:01:10,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:09" (1/1) ... [2019-10-13 23:01:10,050 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:09" (1/1) ... [2019-10-13 23:01:10,064 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:09" (1/1) ... [2019-10-13 23:01:10,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:09" (1/1) ... [2019-10-13 23:01:10,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:01:10,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:01:10,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:01:10,077 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:01:10,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:01:10,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:01:10,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:01:10,141 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-13 23:01:10,142 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-13 23:01:10,142 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2019-10-13 23:01:10,143 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2019-10-13 23:01:10,143 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2019-10-13 23:01:10,143 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2019-10-13 23:01:10,144 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2019-10-13 23:01:10,144 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2019-10-13 23:01:10,144 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2019-10-13 23:01:10,145 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2019-10-13 23:01:10,145 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2019-10-13 23:01:10,146 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2019-10-13 23:01:10,146 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2019-10-13 23:01:10,146 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2019-10-13 23:01:10,148 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2019-10-13 23:01:10,148 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2019-10-13 23:01:10,149 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-13 23:01:10,149 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:01:10,149 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-10-13 23:01:10,150 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-13 23:01:10,150 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-13 23:01:10,150 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-13 23:01:10,150 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-13 23:01:10,152 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-13 23:01:10,152 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-10-13 23:01:10,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:01:10,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 23:01:10,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 23:01:10,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-13 23:01:10,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-13 23:01:10,153 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2019-10-13 23:01:10,153 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2019-10-13 23:01:10,153 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2019-10-13 23:01:10,153 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2019-10-13 23:01:10,154 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2019-10-13 23:01:10,154 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2019-10-13 23:01:10,154 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2019-10-13 23:01:10,154 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2019-10-13 23:01:10,154 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2019-10-13 23:01:10,154 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2019-10-13 23:01:10,154 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2019-10-13 23:01:10,155 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2019-10-13 23:01:10,155 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-10-13 23:01:10,155 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-13 23:01:10,155 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-13 23:01:10,155 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-13 23:01:10,155 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-10-13 23:01:10,155 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-13 23:01:10,156 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-13 23:01:10,156 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-13 23:01:10,156 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2019-10-13 23:01:10,156 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2019-10-13 23:01:10,156 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-13 23:01:10,156 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:01:10,156 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-13 23:01:10,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:01:10,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:01:10,466 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:10,622 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-10-13 23:01:10,622 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-10-13 23:01:10,633 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:10,722 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-10-13 23:01:10,723 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-10-13 23:01:10,747 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:10,775 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-13 23:01:10,775 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-13 23:01:10,781 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:10,792 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-13 23:01:10,792 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-13 23:01:11,007 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:11,048 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2019-10-13 23:01:11,049 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2019-10-13 23:01:11,098 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:11,121 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-10-13 23:01:11,122 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-10-13 23:01:11,340 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:01:11,340 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 23:01:11,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:01:11 BoogieIcfgContainer [2019-10-13 23:01:11,342 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:01:11,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:01:11,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:01:11,347 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:01:11,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:01:09" (1/3) ... [2019-10-13 23:01:11,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a064bee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:01:11, skipping insertion in model container [2019-10-13 23:01:11,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:09" (2/3) ... [2019-10-13 23:01:11,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a064bee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:01:11, skipping insertion in model container [2019-10-13 23:01:11,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:01:11" (3/3) ... [2019-10-13 23:01:11,351 INFO L109 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.c [2019-10-13 23:01:11,362 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:01:11,370 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 23:01:11,382 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 23:01:11,411 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:01:11,411 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:01:11,411 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:01:11,411 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:01:11,412 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:01:11,412 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:01:11,412 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:01:11,412 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:01:11,441 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states. [2019-10-13 23:01:11,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 23:01:11,451 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:11,452 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:11,454 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:11,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:11,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1191172788, now seen corresponding path program 1 times [2019-10-13 23:01:11,470 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:11,471 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750337120] [2019-10-13 23:01:11,471 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:11,471 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:11,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:11,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:11,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:11,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750337120] [2019-10-13 23:01:11,746 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:11,747 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:11,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428868265] [2019-10-13 23:01:11,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:11,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:11,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:11,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:11,768 INFO L87 Difference]: Start difference. First operand 251 states. Second operand 3 states. [2019-10-13 23:01:11,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:12,000 INFO L93 Difference]: Finished difference Result 455 states and 668 transitions. [2019-10-13 23:01:12,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:12,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 23:01:12,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:12,016 INFO L225 Difference]: With dead ends: 455 [2019-10-13 23:01:12,016 INFO L226 Difference]: Without dead ends: 245 [2019-10-13 23:01:12,023 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:12,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-10-13 23:01:12,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2019-10-13 23:01:12,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-10-13 23:01:12,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 326 transitions. [2019-10-13 23:01:12,101 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 326 transitions. Word has length 18 [2019-10-13 23:01:12,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:12,102 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 326 transitions. [2019-10-13 23:01:12,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:12,102 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 326 transitions. [2019-10-13 23:01:12,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 23:01:12,104 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:12,104 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:12,104 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:12,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:12,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1675982491, now seen corresponding path program 1 times [2019-10-13 23:01:12,105 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:12,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377732447] [2019-10-13 23:01:12,106 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:12,106 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:12,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:12,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:12,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377732447] [2019-10-13 23:01:12,289 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:12,289 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:12,290 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947460379] [2019-10-13 23:01:12,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:12,294 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:12,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:12,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:12,295 INFO L87 Difference]: Start difference. First operand 245 states and 326 transitions. Second operand 3 states. [2019-10-13 23:01:12,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:12,478 INFO L93 Difference]: Finished difference Result 476 states and 652 transitions. [2019-10-13 23:01:12,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:12,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 23:01:12,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:12,486 INFO L225 Difference]: With dead ends: 476 [2019-10-13 23:01:12,486 INFO L226 Difference]: Without dead ends: 322 [2019-10-13 23:01:12,489 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:12,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-10-13 23:01:12,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 319. [2019-10-13 23:01:12,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-10-13 23:01:12,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 431 transitions. [2019-10-13 23:01:12,561 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 431 transitions. Word has length 21 [2019-10-13 23:01:12,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:12,561 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 431 transitions. [2019-10-13 23:01:12,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:12,561 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 431 transitions. [2019-10-13 23:01:12,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 23:01:12,563 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:12,563 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:12,564 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:12,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:12,564 INFO L82 PathProgramCache]: Analyzing trace with hash 2009387554, now seen corresponding path program 1 times [2019-10-13 23:01:12,564 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:12,565 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239430114] [2019-10-13 23:01:12,565 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:12,565 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:12,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:12,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:12,679 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239430114] [2019-10-13 23:01:12,679 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:12,679 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:12,680 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306698521] [2019-10-13 23:01:12,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:12,680 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:12,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:12,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:12,681 INFO L87 Difference]: Start difference. First operand 319 states and 431 transitions. Second operand 3 states. [2019-10-13 23:01:12,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:12,734 INFO L93 Difference]: Finished difference Result 697 states and 983 transitions. [2019-10-13 23:01:12,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:12,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 23:01:12,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:12,743 INFO L225 Difference]: With dead ends: 697 [2019-10-13 23:01:12,743 INFO L226 Difference]: Without dead ends: 482 [2019-10-13 23:01:12,746 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:12,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-10-13 23:01:12,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 445. [2019-10-13 23:01:12,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-10-13 23:01:12,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 625 transitions. [2019-10-13 23:01:12,799 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 625 transitions. Word has length 27 [2019-10-13 23:01:12,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:12,800 INFO L462 AbstractCegarLoop]: Abstraction has 445 states and 625 transitions. [2019-10-13 23:01:12,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:12,800 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 625 transitions. [2019-10-13 23:01:12,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 23:01:12,808 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:12,808 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:12,808 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:12,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:12,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1753868575, now seen corresponding path program 1 times [2019-10-13 23:01:12,809 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:12,809 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234361984] [2019-10-13 23:01:12,810 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:12,810 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:12,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:12,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:12,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234361984] [2019-10-13 23:01:12,889 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:12,890 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:12,890 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135102301] [2019-10-13 23:01:12,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:12,891 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:12,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:12,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:12,891 INFO L87 Difference]: Start difference. First operand 445 states and 625 transitions. Second operand 3 states. [2019-10-13 23:01:12,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:12,967 INFO L93 Difference]: Finished difference Result 454 states and 636 transitions. [2019-10-13 23:01:12,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:12,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-13 23:01:12,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:12,972 INFO L225 Difference]: With dead ends: 454 [2019-10-13 23:01:12,972 INFO L226 Difference]: Without dead ends: 450 [2019-10-13 23:01:12,972 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:12,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-10-13 23:01:12,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2019-10-13 23:01:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-10-13 23:01:13,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 631 transitions. [2019-10-13 23:01:13,002 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 631 transitions. Word has length 30 [2019-10-13 23:01:13,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:13,002 INFO L462 AbstractCegarLoop]: Abstraction has 450 states and 631 transitions. [2019-10-13 23:01:13,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:13,002 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 631 transitions. [2019-10-13 23:01:13,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-13 23:01:13,004 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:13,004 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:13,004 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:13,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:13,005 INFO L82 PathProgramCache]: Analyzing trace with hash -641221973, now seen corresponding path program 1 times [2019-10-13 23:01:13,005 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:13,005 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128163319] [2019-10-13 23:01:13,006 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:13,006 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:13,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:13,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:13,055 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128163319] [2019-10-13 23:01:13,055 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:13,055 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:13,055 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056017537] [2019-10-13 23:01:13,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:13,056 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:13,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:13,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:13,057 INFO L87 Difference]: Start difference. First operand 450 states and 631 transitions. Second operand 3 states. [2019-10-13 23:01:13,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:13,111 INFO L93 Difference]: Finished difference Result 784 states and 1130 transitions. [2019-10-13 23:01:13,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:13,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-13 23:01:13,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:13,117 INFO L225 Difference]: With dead ends: 784 [2019-10-13 23:01:13,118 INFO L226 Difference]: Without dead ends: 765 [2019-10-13 23:01:13,118 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:13,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2019-10-13 23:01:13,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 755. [2019-10-13 23:01:13,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-10-13 23:01:13,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1092 transitions. [2019-10-13 23:01:13,161 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1092 transitions. Word has length 34 [2019-10-13 23:01:13,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:13,162 INFO L462 AbstractCegarLoop]: Abstraction has 755 states and 1092 transitions. [2019-10-13 23:01:13,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:13,162 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1092 transitions. [2019-10-13 23:01:13,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-13 23:01:13,163 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:13,163 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:13,163 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:13,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:13,164 INFO L82 PathProgramCache]: Analyzing trace with hash -655566882, now seen corresponding path program 1 times [2019-10-13 23:01:13,164 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:13,164 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871494785] [2019-10-13 23:01:13,164 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:13,165 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:13,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:13,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:13,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871494785] [2019-10-13 23:01:13,202 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:13,202 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:13,203 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240870242] [2019-10-13 23:01:13,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:13,203 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:13,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:13,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:13,204 INFO L87 Difference]: Start difference. First operand 755 states and 1092 transitions. Second operand 3 states. [2019-10-13 23:01:13,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:13,306 INFO L93 Difference]: Finished difference Result 781 states and 1121 transitions. [2019-10-13 23:01:13,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:13,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-13 23:01:13,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:13,312 INFO L225 Difference]: With dead ends: 781 [2019-10-13 23:01:13,312 INFO L226 Difference]: Without dead ends: 776 [2019-10-13 23:01:13,313 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:13,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2019-10-13 23:01:13,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 774. [2019-10-13 23:01:13,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-10-13 23:01:13,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1113 transitions. [2019-10-13 23:01:13,379 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1113 transitions. Word has length 34 [2019-10-13 23:01:13,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:13,379 INFO L462 AbstractCegarLoop]: Abstraction has 774 states and 1113 transitions. [2019-10-13 23:01:13,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:13,380 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1113 transitions. [2019-10-13 23:01:13,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-13 23:01:13,381 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:13,381 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:13,381 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:13,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:13,382 INFO L82 PathProgramCache]: Analyzing trace with hash 409313685, now seen corresponding path program 1 times [2019-10-13 23:01:13,382 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:13,382 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111963972] [2019-10-13 23:01:13,382 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:13,382 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:13,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:13,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:13,440 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111963972] [2019-10-13 23:01:13,440 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:13,440 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:13,441 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028202484] [2019-10-13 23:01:13,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:13,441 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:13,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:13,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:13,442 INFO L87 Difference]: Start difference. First operand 774 states and 1113 transitions. Second operand 3 states. [2019-10-13 23:01:13,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:13,484 INFO L93 Difference]: Finished difference Result 1072 states and 1575 transitions. [2019-10-13 23:01:13,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:13,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-10-13 23:01:13,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:13,488 INFO L225 Difference]: With dead ends: 1072 [2019-10-13 23:01:13,488 INFO L226 Difference]: Without dead ends: 446 [2019-10-13 23:01:13,492 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:13,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-10-13 23:01:13,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2019-10-13 23:01:13,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-10-13 23:01:13,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 619 transitions. [2019-10-13 23:01:13,517 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 619 transitions. Word has length 37 [2019-10-13 23:01:13,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:13,518 INFO L462 AbstractCegarLoop]: Abstraction has 446 states and 619 transitions. [2019-10-13 23:01:13,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:13,518 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 619 transitions. [2019-10-13 23:01:13,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-13 23:01:13,519 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:13,519 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:13,519 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:13,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:13,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1604989566, now seen corresponding path program 1 times [2019-10-13 23:01:13,520 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:13,520 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347147885] [2019-10-13 23:01:13,520 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:13,520 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:13,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:13,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:13,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347147885] [2019-10-13 23:01:13,588 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:13,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:13,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427545728] [2019-10-13 23:01:13,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:13,589 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:13,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:13,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:13,590 INFO L87 Difference]: Start difference. First operand 446 states and 619 transitions. Second operand 5 states. [2019-10-13 23:01:13,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:13,649 INFO L93 Difference]: Finished difference Result 461 states and 637 transitions. [2019-10-13 23:01:13,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:01:13,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-10-13 23:01:13,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:13,653 INFO L225 Difference]: With dead ends: 461 [2019-10-13 23:01:13,654 INFO L226 Difference]: Without dead ends: 440 [2019-10-13 23:01:13,654 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:13,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-10-13 23:01:13,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2019-10-13 23:01:13,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-10-13 23:01:13,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 611 transitions. [2019-10-13 23:01:13,683 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 611 transitions. Word has length 35 [2019-10-13 23:01:13,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:13,683 INFO L462 AbstractCegarLoop]: Abstraction has 440 states and 611 transitions. [2019-10-13 23:01:13,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:13,684 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 611 transitions. [2019-10-13 23:01:13,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-13 23:01:13,685 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:13,685 INFO L380 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] [2019-10-13 23:01:13,685 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:13,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:13,686 INFO L82 PathProgramCache]: Analyzing trace with hash -367438247, now seen corresponding path program 1 times [2019-10-13 23:01:13,686 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:13,686 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637858803] [2019-10-13 23:01:13,686 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:13,686 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:13,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:13,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:13,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:13,733 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637858803] [2019-10-13 23:01:13,734 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:13,734 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:13,734 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717356068] [2019-10-13 23:01:13,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:13,735 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:13,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:13,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:13,735 INFO L87 Difference]: Start difference. First operand 440 states and 611 transitions. Second operand 3 states. [2019-10-13 23:01:13,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:13,895 INFO L93 Difference]: Finished difference Result 636 states and 933 transitions. [2019-10-13 23:01:13,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:13,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-13 23:01:13,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:13,901 INFO L225 Difference]: With dead ends: 636 [2019-10-13 23:01:13,901 INFO L226 Difference]: Without dead ends: 628 [2019-10-13 23:01:13,901 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:13,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-10-13 23:01:13,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 496. [2019-10-13 23:01:13,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-10-13 23:01:13,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 699 transitions. [2019-10-13 23:01:13,939 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 699 transitions. Word has length 39 [2019-10-13 23:01:13,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:13,939 INFO L462 AbstractCegarLoop]: Abstraction has 496 states and 699 transitions. [2019-10-13 23:01:13,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:13,939 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 699 transitions. [2019-10-13 23:01:13,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-13 23:01:13,941 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:13,941 INFO L380 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] [2019-10-13 23:01:13,941 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:13,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:13,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1695097799, now seen corresponding path program 1 times [2019-10-13 23:01:13,942 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:13,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011544030] [2019-10-13 23:01:13,942 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:13,942 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:13,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:14,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:14,015 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011544030] [2019-10-13 23:01:14,015 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:14,016 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:01:14,016 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624958693] [2019-10-13 23:01:14,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:01:14,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:14,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:01:14,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:01:14,017 INFO L87 Difference]: Start difference. First operand 496 states and 699 transitions. Second operand 4 states. [2019-10-13 23:01:14,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:14,233 INFO L93 Difference]: Finished difference Result 555 states and 759 transitions. [2019-10-13 23:01:14,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:01:14,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-10-13 23:01:14,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:14,237 INFO L225 Difference]: With dead ends: 555 [2019-10-13 23:01:14,237 INFO L226 Difference]: Without dead ends: 354 [2019-10-13 23:01:14,241 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:01:14,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-10-13 23:01:14,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 337. [2019-10-13 23:01:14,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-10-13 23:01:14,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 430 transitions. [2019-10-13 23:01:14,262 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 430 transitions. Word has length 43 [2019-10-13 23:01:14,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:14,262 INFO L462 AbstractCegarLoop]: Abstraction has 337 states and 430 transitions. [2019-10-13 23:01:14,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:01:14,263 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 430 transitions. [2019-10-13 23:01:14,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-13 23:01:14,263 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:14,264 INFO L380 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] [2019-10-13 23:01:14,264 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:14,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:14,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1729441489, now seen corresponding path program 1 times [2019-10-13 23:01:14,264 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:14,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311183067] [2019-10-13 23:01:14,265 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:14,265 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:14,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:14,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:14,371 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311183067] [2019-10-13 23:01:14,371 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:14,371 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 23:01:14,371 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197200000] [2019-10-13 23:01:14,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 23:01:14,372 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:14,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 23:01:14,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:01:14,372 INFO L87 Difference]: Start difference. First operand 337 states and 430 transitions. Second operand 10 states. [2019-10-13 23:01:15,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:15,147 INFO L93 Difference]: Finished difference Result 366 states and 462 transitions. [2019-10-13 23:01:15,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:01:15,147 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-10-13 23:01:15,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:15,150 INFO L225 Difference]: With dead ends: 366 [2019-10-13 23:01:15,150 INFO L226 Difference]: Without dead ends: 360 [2019-10-13 23:01:15,150 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-10-13 23:01:15,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-10-13 23:01:15,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 337. [2019-10-13 23:01:15,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-10-13 23:01:15,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 429 transitions. [2019-10-13 23:01:15,171 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 429 transitions. Word has length 40 [2019-10-13 23:01:15,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:15,172 INFO L462 AbstractCegarLoop]: Abstraction has 337 states and 429 transitions. [2019-10-13 23:01:15,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 23:01:15,172 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 429 transitions. [2019-10-13 23:01:15,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-13 23:01:15,173 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:15,173 INFO L380 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] [2019-10-13 23:01:15,173 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:15,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:15,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1947319489, now seen corresponding path program 1 times [2019-10-13 23:01:15,174 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:15,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013858699] [2019-10-13 23:01:15,174 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:15,174 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:15,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:15,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:15,232 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013858699] [2019-10-13 23:01:15,232 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:15,232 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:15,232 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780783941] [2019-10-13 23:01:15,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:15,233 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:15,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:15,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:15,233 INFO L87 Difference]: Start difference. First operand 337 states and 429 transitions. Second operand 5 states. [2019-10-13 23:01:15,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:15,706 INFO L93 Difference]: Finished difference Result 451 states and 605 transitions. [2019-10-13 23:01:15,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:01:15,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-10-13 23:01:15,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:15,710 INFO L225 Difference]: With dead ends: 451 [2019-10-13 23:01:15,710 INFO L226 Difference]: Without dead ends: 443 [2019-10-13 23:01:15,711 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:01:15,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-10-13 23:01:15,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 337. [2019-10-13 23:01:15,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-10-13 23:01:15,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 428 transitions. [2019-10-13 23:01:15,734 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 428 transitions. Word has length 40 [2019-10-13 23:01:15,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:15,735 INFO L462 AbstractCegarLoop]: Abstraction has 337 states and 428 transitions. [2019-10-13 23:01:15,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:15,735 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 428 transitions. [2019-10-13 23:01:15,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-13 23:01:15,736 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:15,736 INFO L380 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] [2019-10-13 23:01:15,736 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:15,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:15,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1332761529, now seen corresponding path program 1 times [2019-10-13 23:01:15,737 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:15,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356189836] [2019-10-13 23:01:15,737 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:15,737 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:15,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:15,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:15,841 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356189836] [2019-10-13 23:01:15,842 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:15,842 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 23:01:15,842 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244776149] [2019-10-13 23:01:15,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 23:01:15,842 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:15,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 23:01:15,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:01:15,843 INFO L87 Difference]: Start difference. First operand 337 states and 428 transitions. Second operand 10 states. [2019-10-13 23:01:16,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:16,578 INFO L93 Difference]: Finished difference Result 366 states and 459 transitions. [2019-10-13 23:01:16,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:01:16,579 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2019-10-13 23:01:16,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:16,582 INFO L225 Difference]: With dead ends: 366 [2019-10-13 23:01:16,582 INFO L226 Difference]: Without dead ends: 360 [2019-10-13 23:01:16,583 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-10-13 23:01:16,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-10-13 23:01:16,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 337. [2019-10-13 23:01:16,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-10-13 23:01:16,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 427 transitions. [2019-10-13 23:01:16,612 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 427 transitions. Word has length 41 [2019-10-13 23:01:16,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:16,613 INFO L462 AbstractCegarLoop]: Abstraction has 337 states and 427 transitions. [2019-10-13 23:01:16,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 23:01:16,613 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 427 transitions. [2019-10-13 23:01:16,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-13 23:01:16,614 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:16,615 INFO L380 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] [2019-10-13 23:01:16,615 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:16,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:16,615 INFO L82 PathProgramCache]: Analyzing trace with hash -660070045, now seen corresponding path program 1 times [2019-10-13 23:01:16,616 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:16,616 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315000437] [2019-10-13 23:01:16,616 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:16,616 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:16,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:16,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:16,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315000437] [2019-10-13 23:01:16,725 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:16,726 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 23:01:16,726 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556204979] [2019-10-13 23:01:16,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 23:01:16,726 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:16,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 23:01:16,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:01:16,727 INFO L87 Difference]: Start difference. First operand 337 states and 427 transitions. Second operand 8 states. [2019-10-13 23:01:16,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:16,948 INFO L93 Difference]: Finished difference Result 353 states and 445 transitions. [2019-10-13 23:01:16,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 23:01:16,949 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-10-13 23:01:16,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:16,952 INFO L225 Difference]: With dead ends: 353 [2019-10-13 23:01:16,953 INFO L226 Difference]: Without dead ends: 349 [2019-10-13 23:01:16,954 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:01:16,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-10-13 23:01:16,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 345. [2019-10-13 23:01:16,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-10-13 23:01:16,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 437 transitions. [2019-10-13 23:01:16,988 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 437 transitions. Word has length 41 [2019-10-13 23:01:16,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:16,989 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 437 transitions. [2019-10-13 23:01:16,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 23:01:16,990 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 437 transitions. [2019-10-13 23:01:16,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-13 23:01:16,991 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:16,991 INFO L380 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] [2019-10-13 23:01:16,992 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:16,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:16,992 INFO L82 PathProgramCache]: Analyzing trace with hash -660346875, now seen corresponding path program 1 times [2019-10-13 23:01:16,992 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:16,992 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150483873] [2019-10-13 23:01:16,993 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:16,993 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:16,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:17,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:17,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150483873] [2019-10-13 23:01:17,126 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:17,126 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:17,127 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995978323] [2019-10-13 23:01:17,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:17,128 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:17,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:17,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:17,130 INFO L87 Difference]: Start difference. First operand 345 states and 437 transitions. Second operand 5 states. [2019-10-13 23:01:17,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:17,652 INFO L93 Difference]: Finished difference Result 453 states and 606 transitions. [2019-10-13 23:01:17,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:01:17,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-10-13 23:01:17,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:17,656 INFO L225 Difference]: With dead ends: 453 [2019-10-13 23:01:17,656 INFO L226 Difference]: Without dead ends: 434 [2019-10-13 23:01:17,659 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:01:17,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-10-13 23:01:17,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 334. [2019-10-13 23:01:17,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-10-13 23:01:17,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 422 transitions. [2019-10-13 23:01:17,686 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 422 transitions. Word has length 41 [2019-10-13 23:01:17,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:17,686 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 422 transitions. [2019-10-13 23:01:17,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:17,686 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 422 transitions. [2019-10-13 23:01:17,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-13 23:01:17,689 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:17,689 INFO L380 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] [2019-10-13 23:01:17,689 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:17,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:17,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1579025384, now seen corresponding path program 1 times [2019-10-13 23:01:17,690 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:17,690 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516826747] [2019-10-13 23:01:17,690 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:17,690 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:17,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:17,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:17,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516826747] [2019-10-13 23:01:17,746 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:17,746 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:01:17,746 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836737216] [2019-10-13 23:01:17,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:01:17,747 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:17,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:01:17,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:01:17,750 INFO L87 Difference]: Start difference. First operand 334 states and 422 transitions. Second operand 6 states. [2019-10-13 23:01:17,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:17,807 INFO L93 Difference]: Finished difference Result 357 states and 447 transitions. [2019-10-13 23:01:17,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 23:01:17,808 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-10-13 23:01:17,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:17,811 INFO L225 Difference]: With dead ends: 357 [2019-10-13 23:01:17,811 INFO L226 Difference]: Without dead ends: 332 [2019-10-13 23:01:17,812 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:17,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-10-13 23:01:17,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2019-10-13 23:01:17,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-10-13 23:01:17,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 417 transitions. [2019-10-13 23:01:17,836 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 417 transitions. Word has length 42 [2019-10-13 23:01:17,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:17,836 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 417 transitions. [2019-10-13 23:01:17,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:01:17,836 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 417 transitions. [2019-10-13 23:01:17,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-13 23:01:17,838 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:17,838 INFO L380 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] [2019-10-13 23:01:17,838 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:17,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:17,839 INFO L82 PathProgramCache]: Analyzing trace with hash -488362368, now seen corresponding path program 1 times [2019-10-13 23:01:17,839 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:17,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799807048] [2019-10-13 23:01:17,840 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:17,840 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:17,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:17,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:17,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799807048] [2019-10-13 23:01:17,918 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:17,918 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:01:17,918 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503415771] [2019-10-13 23:01:17,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:01:17,918 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:17,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:01:17,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:17,919 INFO L87 Difference]: Start difference. First operand 332 states and 417 transitions. Second operand 7 states. [2019-10-13 23:01:18,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:18,527 INFO L93 Difference]: Finished difference Result 448 states and 590 transitions. [2019-10-13 23:01:18,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 23:01:18,527 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-10-13 23:01:18,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:18,530 INFO L225 Difference]: With dead ends: 448 [2019-10-13 23:01:18,531 INFO L226 Difference]: Without dead ends: 411 [2019-10-13 23:01:18,531 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-10-13 23:01:18,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-10-13 23:01:18,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 407. [2019-10-13 23:01:18,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-10-13 23:01:18,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 542 transitions. [2019-10-13 23:01:18,565 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 542 transitions. Word has length 42 [2019-10-13 23:01:18,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:18,565 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 542 transitions. [2019-10-13 23:01:18,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:01:18,566 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 542 transitions. [2019-10-13 23:01:18,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-13 23:01:18,567 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:18,567 INFO L380 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] [2019-10-13 23:01:18,567 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:18,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:18,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1359230801, now seen corresponding path program 1 times [2019-10-13 23:01:18,568 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:18,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800732854] [2019-10-13 23:01:18,569 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:18,569 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:18,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:18,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:18,670 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800732854] [2019-10-13 23:01:18,670 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:18,670 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 23:01:18,671 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861475987] [2019-10-13 23:01:18,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 23:01:18,671 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:18,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 23:01:18,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:01:18,672 INFO L87 Difference]: Start difference. First operand 407 states and 542 transitions. Second operand 8 states. [2019-10-13 23:01:18,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:18,830 INFO L93 Difference]: Finished difference Result 421 states and 557 transitions. [2019-10-13 23:01:18,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 23:01:18,831 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2019-10-13 23:01:18,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:18,833 INFO L225 Difference]: With dead ends: 421 [2019-10-13 23:01:18,834 INFO L226 Difference]: Without dead ends: 396 [2019-10-13 23:01:18,834 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:01:18,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2019-10-13 23:01:18,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2019-10-13 23:01:18,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-10-13 23:01:18,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 529 transitions. [2019-10-13 23:01:18,860 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 529 transitions. Word has length 42 [2019-10-13 23:01:18,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:18,860 INFO L462 AbstractCegarLoop]: Abstraction has 396 states and 529 transitions. [2019-10-13 23:01:18,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 23:01:18,860 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 529 transitions. [2019-10-13 23:01:18,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-13 23:01:18,861 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:18,861 INFO L380 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] [2019-10-13 23:01:18,862 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:18,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:18,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1419195772, now seen corresponding path program 1 times [2019-10-13 23:01:18,862 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:18,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13816000] [2019-10-13 23:01:18,862 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:18,863 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:18,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:18,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:18,976 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13816000] [2019-10-13 23:01:18,976 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:18,976 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:01:18,977 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191855916] [2019-10-13 23:01:18,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:01:18,979 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:18,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:01:18,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:01:18,980 INFO L87 Difference]: Start difference. First operand 396 states and 529 transitions. Second operand 9 states. [2019-10-13 23:01:20,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:20,521 INFO L93 Difference]: Finished difference Result 493 states and 684 transitions. [2019-10-13 23:01:20,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-13 23:01:20,522 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2019-10-13 23:01:20,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:20,525 INFO L225 Difference]: With dead ends: 493 [2019-10-13 23:01:20,525 INFO L226 Difference]: Without dead ends: 464 [2019-10-13 23:01:20,526 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2019-10-13 23:01:20,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-10-13 23:01:20,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 374. [2019-10-13 23:01:20,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-10-13 23:01:20,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 505 transitions. [2019-10-13 23:01:20,554 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 505 transitions. Word has length 43 [2019-10-13 23:01:20,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:20,555 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 505 transitions. [2019-10-13 23:01:20,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:01:20,555 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 505 transitions. [2019-10-13 23:01:20,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-13 23:01:20,556 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:20,556 INFO L380 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] [2019-10-13 23:01:20,556 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:20,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:20,556 INFO L82 PathProgramCache]: Analyzing trace with hash 693673709, now seen corresponding path program 1 times [2019-10-13 23:01:20,557 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:20,557 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846106009] [2019-10-13 23:01:20,557 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:20,557 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:20,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:20,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:20,614 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846106009] [2019-10-13 23:01:20,614 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:20,614 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:20,615 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422034229] [2019-10-13 23:01:20,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:20,615 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:20,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:20,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:20,616 INFO L87 Difference]: Start difference. First operand 374 states and 505 transitions. Second operand 3 states. [2019-10-13 23:01:20,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:20,721 INFO L93 Difference]: Finished difference Result 524 states and 775 transitions. [2019-10-13 23:01:20,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:20,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-13 23:01:20,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:20,726 INFO L225 Difference]: With dead ends: 524 [2019-10-13 23:01:20,726 INFO L226 Difference]: Without dead ends: 511 [2019-10-13 23:01:20,726 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:20,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-10-13 23:01:20,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 369. [2019-10-13 23:01:20,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-10-13 23:01:20,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 497 transitions. [2019-10-13 23:01:20,763 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 497 transitions. Word has length 43 [2019-10-13 23:01:20,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:20,763 INFO L462 AbstractCegarLoop]: Abstraction has 369 states and 497 transitions. [2019-10-13 23:01:20,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:20,763 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 497 transitions. [2019-10-13 23:01:20,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-13 23:01:20,764 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:20,764 INFO L380 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] [2019-10-13 23:01:20,764 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:20,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:20,765 INFO L82 PathProgramCache]: Analyzing trace with hash 482051757, now seen corresponding path program 1 times [2019-10-13 23:01:20,765 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:20,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352398843] [2019-10-13 23:01:20,765 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:20,766 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:20,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:20,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:20,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352398843] [2019-10-13 23:01:20,959 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:20,959 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 23:01:20,959 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611390997] [2019-10-13 23:01:20,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 23:01:20,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:20,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 23:01:20,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:01:20,962 INFO L87 Difference]: Start difference. First operand 369 states and 497 transitions. Second operand 8 states. [2019-10-13 23:01:21,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:21,109 INFO L93 Difference]: Finished difference Result 384 states and 514 transitions. [2019-10-13 23:01:21,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 23:01:21,109 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-10-13 23:01:21,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:21,112 INFO L225 Difference]: With dead ends: 384 [2019-10-13 23:01:21,112 INFO L226 Difference]: Without dead ends: 380 [2019-10-13 23:01:21,113 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:01:21,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-10-13 23:01:21,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 376. [2019-10-13 23:01:21,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-10-13 23:01:21,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 506 transitions. [2019-10-13 23:01:21,141 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 506 transitions. Word has length 44 [2019-10-13 23:01:21,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:21,141 INFO L462 AbstractCegarLoop]: Abstraction has 376 states and 506 transitions. [2019-10-13 23:01:21,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 23:01:21,141 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 506 transitions. [2019-10-13 23:01:21,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-13 23:01:21,143 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:21,143 INFO L380 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] [2019-10-13 23:01:21,143 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:21,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:21,144 INFO L82 PathProgramCache]: Analyzing trace with hash 481774927, now seen corresponding path program 1 times [2019-10-13 23:01:21,144 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:21,144 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90689103] [2019-10-13 23:01:21,144 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,144 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:21,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:21,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90689103] [2019-10-13 23:01:21,226 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:21,226 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:21,226 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635591380] [2019-10-13 23:01:21,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:21,227 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:21,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:21,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:21,227 INFO L87 Difference]: Start difference. First operand 376 states and 506 transitions. Second operand 5 states. [2019-10-13 23:01:21,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:21,697 INFO L93 Difference]: Finished difference Result 522 states and 772 transitions. [2019-10-13 23:01:21,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:01:21,699 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-10-13 23:01:21,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:21,703 INFO L225 Difference]: With dead ends: 522 [2019-10-13 23:01:21,703 INFO L226 Difference]: Without dead ends: 492 [2019-10-13 23:01:21,704 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:01:21,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2019-10-13 23:01:21,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 352. [2019-10-13 23:01:21,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-10-13 23:01:21,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 478 transitions. [2019-10-13 23:01:21,737 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 478 transitions. Word has length 44 [2019-10-13 23:01:21,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:21,738 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 478 transitions. [2019-10-13 23:01:21,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:21,738 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 478 transitions. [2019-10-13 23:01:21,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 23:01:21,744 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:21,744 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:21,744 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:21,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:21,744 INFO L82 PathProgramCache]: Analyzing trace with hash -590774519, now seen corresponding path program 1 times [2019-10-13 23:01:21,745 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:21,745 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136769842] [2019-10-13 23:01:21,745 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,745 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:21,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:21,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136769842] [2019-10-13 23:01:21,791 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:21,791 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:21,791 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52993685] [2019-10-13 23:01:21,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:21,792 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:21,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:21,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:21,795 INFO L87 Difference]: Start difference. First operand 352 states and 478 transitions. Second operand 3 states. [2019-10-13 23:01:21,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:21,852 INFO L93 Difference]: Finished difference Result 622 states and 888 transitions. [2019-10-13 23:01:21,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:21,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-13 23:01:21,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:21,855 INFO L225 Difference]: With dead ends: 622 [2019-10-13 23:01:21,856 INFO L226 Difference]: Without dead ends: 351 [2019-10-13 23:01:21,857 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:21,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-10-13 23:01:21,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2019-10-13 23:01:21,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-10-13 23:01:21,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 475 transitions. [2019-10-13 23:01:21,882 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 475 transitions. Word has length 50 [2019-10-13 23:01:21,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:21,882 INFO L462 AbstractCegarLoop]: Abstraction has 351 states and 475 transitions. [2019-10-13 23:01:21,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:21,883 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 475 transitions. [2019-10-13 23:01:21,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-13 23:01:21,883 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:21,883 INFO L380 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] [2019-10-13 23:01:21,884 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:21,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:21,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1094301255, now seen corresponding path program 1 times [2019-10-13 23:01:21,884 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:21,884 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962331941] [2019-10-13 23:01:21,884 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,885 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:21,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:21,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962331941] [2019-10-13 23:01:21,939 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:21,939 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:01:21,939 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002502673] [2019-10-13 23:01:21,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:01:21,940 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:21,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:01:21,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:01:21,941 INFO L87 Difference]: Start difference. First operand 351 states and 475 transitions. Second operand 6 states. [2019-10-13 23:01:21,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:21,987 INFO L93 Difference]: Finished difference Result 366 states and 491 transitions. [2019-10-13 23:01:21,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 23:01:21,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-10-13 23:01:21,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:21,989 INFO L225 Difference]: With dead ends: 366 [2019-10-13 23:01:21,989 INFO L226 Difference]: Without dead ends: 333 [2019-10-13 23:01:21,991 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:21,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-10-13 23:01:22,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2019-10-13 23:01:22,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-10-13 23:01:22,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 455 transitions. [2019-10-13 23:01:22,018 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 455 transitions. Word has length 46 [2019-10-13 23:01:22,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:22,019 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 455 transitions. [2019-10-13 23:01:22,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:01:22,019 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 455 transitions. [2019-10-13 23:01:22,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 23:01:22,020 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:22,020 INFO L380 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] [2019-10-13 23:01:22,020 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:22,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:22,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1328869361, now seen corresponding path program 1 times [2019-10-13 23:01:22,021 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:22,021 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440319617] [2019-10-13 23:01:22,021 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:22,021 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:22,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:22,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:22,078 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440319617] [2019-10-13 23:01:22,078 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:22,078 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:22,079 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563071064] [2019-10-13 23:01:22,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:22,079 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:22,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:22,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:22,080 INFO L87 Difference]: Start difference. First operand 333 states and 455 transitions. Second operand 3 states. [2019-10-13 23:01:22,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:22,190 INFO L93 Difference]: Finished difference Result 430 states and 610 transitions. [2019-10-13 23:01:22,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:22,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-13 23:01:22,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:22,193 INFO L225 Difference]: With dead ends: 430 [2019-10-13 23:01:22,193 INFO L226 Difference]: Without dead ends: 427 [2019-10-13 23:01:22,194 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:22,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-10-13 23:01:22,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 335. [2019-10-13 23:01:22,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-10-13 23:01:22,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 458 transitions. [2019-10-13 23:01:22,228 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 458 transitions. Word has length 54 [2019-10-13 23:01:22,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:22,228 INFO L462 AbstractCegarLoop]: Abstraction has 335 states and 458 transitions. [2019-10-13 23:01:22,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:22,229 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 458 transitions. [2019-10-13 23:01:22,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 23:01:22,229 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:22,230 INFO L380 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] [2019-10-13 23:01:22,230 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:22,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:22,230 INFO L82 PathProgramCache]: Analyzing trace with hash 529879, now seen corresponding path program 1 times [2019-10-13 23:01:22,230 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:22,230 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169762411] [2019-10-13 23:01:22,231 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:22,231 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:22,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:22,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:22,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:22,300 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169762411] [2019-10-13 23:01:22,300 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:22,300 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:22,300 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175673281] [2019-10-13 23:01:22,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:22,301 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:22,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:22,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:22,302 INFO L87 Difference]: Start difference. First operand 335 states and 458 transitions. Second operand 5 states. [2019-10-13 23:01:22,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:22,827 INFO L93 Difference]: Finished difference Result 822 states and 1255 transitions. [2019-10-13 23:01:22,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 23:01:22,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-10-13 23:01:22,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:22,835 INFO L225 Difference]: With dead ends: 822 [2019-10-13 23:01:22,835 INFO L226 Difference]: Without dead ends: 553 [2019-10-13 23:01:22,837 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:22,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-10-13 23:01:22,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 399. [2019-10-13 23:01:22,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-10-13 23:01:22,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 578 transitions. [2019-10-13 23:01:22,886 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 578 transitions. Word has length 54 [2019-10-13 23:01:22,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:22,887 INFO L462 AbstractCegarLoop]: Abstraction has 399 states and 578 transitions. [2019-10-13 23:01:22,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:22,887 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 578 transitions. [2019-10-13 23:01:22,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 23:01:22,888 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:22,888 INFO L380 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] [2019-10-13 23:01:22,888 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:22,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:22,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1194403120, now seen corresponding path program 1 times [2019-10-13 23:01:22,889 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:22,889 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471073645] [2019-10-13 23:01:22,889 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:22,889 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:22,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:23,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:23,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471073645] [2019-10-13 23:01:23,047 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:23,047 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:01:23,047 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738495374] [2019-10-13 23:01:23,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:01:23,048 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:23,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:01:23,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:01:23,048 INFO L87 Difference]: Start difference. First operand 399 states and 578 transitions. Second operand 6 states. [2019-10-13 23:01:23,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:23,113 INFO L93 Difference]: Finished difference Result 630 states and 923 transitions. [2019-10-13 23:01:23,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 23:01:23,114 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-10-13 23:01:23,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:23,122 INFO L225 Difference]: With dead ends: 630 [2019-10-13 23:01:23,123 INFO L226 Difference]: Without dead ends: 307 [2019-10-13 23:01:23,125 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:23,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-10-13 23:01:23,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 283. [2019-10-13 23:01:23,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-10-13 23:01:23,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 374 transitions. [2019-10-13 23:01:23,153 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 374 transitions. Word has length 55 [2019-10-13 23:01:23,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:23,153 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 374 transitions. [2019-10-13 23:01:23,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:01:23,153 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 374 transitions. [2019-10-13 23:01:23,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 23:01:23,154 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:23,154 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:23,154 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:23,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:23,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1129825869, now seen corresponding path program 1 times [2019-10-13 23:01:23,155 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:23,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095939257] [2019-10-13 23:01:23,155 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:23,155 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:23,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:23,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:23,322 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095939257] [2019-10-13 23:01:23,322 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:23,322 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 23:01:23,323 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983166745] [2019-10-13 23:01:23,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 23:01:23,323 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:23,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 23:01:23,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:01:23,324 INFO L87 Difference]: Start difference. First operand 283 states and 374 transitions. Second operand 10 states. [2019-10-13 23:01:23,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:23,517 INFO L93 Difference]: Finished difference Result 285 states and 375 transitions. [2019-10-13 23:01:23,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 23:01:23,518 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-10-13 23:01:23,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:23,520 INFO L225 Difference]: With dead ends: 285 [2019-10-13 23:01:23,520 INFO L226 Difference]: Without dead ends: 251 [2019-10-13 23:01:23,521 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:23,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-10-13 23:01:23,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2019-10-13 23:01:23,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-10-13 23:01:23,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 340 transitions. [2019-10-13 23:01:23,544 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 340 transitions. Word has length 50 [2019-10-13 23:01:23,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:23,544 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 340 transitions. [2019-10-13 23:01:23,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 23:01:23,545 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 340 transitions. [2019-10-13 23:01:23,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 23:01:23,546 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:23,546 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:23,546 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:23,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:23,547 INFO L82 PathProgramCache]: Analyzing trace with hash -854572919, now seen corresponding path program 1 times [2019-10-13 23:01:23,547 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:23,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432814278] [2019-10-13 23:01:23,547 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:23,547 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:23,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:23,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:23,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432814278] [2019-10-13 23:01:23,608 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:23,608 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:23,608 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238725278] [2019-10-13 23:01:23,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:23,608 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:23,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:23,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:23,609 INFO L87 Difference]: Start difference. First operand 251 states and 340 transitions. Second operand 5 states. [2019-10-13 23:01:23,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:23,817 INFO L93 Difference]: Finished difference Result 445 states and 607 transitions. [2019-10-13 23:01:23,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:01:23,818 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-10-13 23:01:23,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:23,820 INFO L225 Difference]: With dead ends: 445 [2019-10-13 23:01:23,820 INFO L226 Difference]: Without dead ends: 228 [2019-10-13 23:01:23,822 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:23,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-10-13 23:01:23,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2019-10-13 23:01:23,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-10-13 23:01:23,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 293 transitions. [2019-10-13 23:01:23,843 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 293 transitions. Word has length 59 [2019-10-13 23:01:23,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:23,844 INFO L462 AbstractCegarLoop]: Abstraction has 228 states and 293 transitions. [2019-10-13 23:01:23,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:23,844 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 293 transitions. [2019-10-13 23:01:23,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 23:01:23,844 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:23,845 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:23,845 INFO L410 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:23,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:23,845 INFO L82 PathProgramCache]: Analyzing trace with hash -862739225, now seen corresponding path program 1 times [2019-10-13 23:01:23,845 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:23,845 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380889737] [2019-10-13 23:01:23,846 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:23,846 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:23,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:23,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:23,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380889737] [2019-10-13 23:01:23,980 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:23,980 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:23,980 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700776163] [2019-10-13 23:01:23,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:23,981 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:23,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:23,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:23,982 INFO L87 Difference]: Start difference. First operand 228 states and 293 transitions. Second operand 5 states. [2019-10-13 23:01:24,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:24,337 INFO L93 Difference]: Finished difference Result 508 states and 677 transitions. [2019-10-13 23:01:24,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 23:01:24,338 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-10-13 23:01:24,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:24,340 INFO L225 Difference]: With dead ends: 508 [2019-10-13 23:01:24,341 INFO L226 Difference]: Without dead ends: 314 [2019-10-13 23:01:24,343 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:01:24,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-10-13 23:01:24,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 276. [2019-10-13 23:01:24,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-10-13 23:01:24,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 362 transitions. [2019-10-13 23:01:24,379 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 362 transitions. Word has length 60 [2019-10-13 23:01:24,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:24,379 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 362 transitions. [2019-10-13 23:01:24,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:24,379 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 362 transitions. [2019-10-13 23:01:24,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 23:01:24,380 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:24,380 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:24,381 INFO L410 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:24,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:24,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1185194923, now seen corresponding path program 1 times [2019-10-13 23:01:24,381 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:24,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540452420] [2019-10-13 23:01:24,381 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:24,382 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:24,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:24,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:24,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540452420] [2019-10-13 23:01:24,580 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:24,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:01:24,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172263398] [2019-10-13 23:01:24,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:01:24,581 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:24,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:01:24,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:24,582 INFO L87 Difference]: Start difference. First operand 276 states and 362 transitions. Second operand 7 states. [2019-10-13 23:01:24,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:24,845 INFO L93 Difference]: Finished difference Result 317 states and 413 transitions. [2019-10-13 23:01:24,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 23:01:24,846 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-10-13 23:01:24,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:24,848 INFO L225 Difference]: With dead ends: 317 [2019-10-13 23:01:24,848 INFO L226 Difference]: Without dead ends: 313 [2019-10-13 23:01:24,849 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:01:24,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-10-13 23:01:24,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 291. [2019-10-13 23:01:24,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-10-13 23:01:24,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 382 transitions. [2019-10-13 23:01:24,883 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 382 transitions. Word has length 60 [2019-10-13 23:01:24,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:24,883 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 382 transitions. [2019-10-13 23:01:24,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:01:24,883 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 382 transitions. [2019-10-13 23:01:24,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-13 23:01:24,884 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:24,884 INFO L380 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] [2019-10-13 23:01:24,885 INFO L410 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:24,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:24,885 INFO L82 PathProgramCache]: Analyzing trace with hash 2073242512, now seen corresponding path program 1 times [2019-10-13 23:01:24,886 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:24,888 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56840147] [2019-10-13 23:01:24,888 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:24,888 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:24,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:25,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:25,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56840147] [2019-10-13 23:01:25,063 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:25,063 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 23:01:25,064 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806521825] [2019-10-13 23:01:25,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 23:01:25,064 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:25,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 23:01:25,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:01:25,065 INFO L87 Difference]: Start difference. First operand 291 states and 382 transitions. Second operand 10 states. [2019-10-13 23:01:25,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:25,508 INFO L93 Difference]: Finished difference Result 488 states and 639 transitions. [2019-10-13 23:01:25,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:01:25,509 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2019-10-13 23:01:25,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:25,510 INFO L225 Difference]: With dead ends: 488 [2019-10-13 23:01:25,511 INFO L226 Difference]: Without dead ends: 262 [2019-10-13 23:01:25,512 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:01:25,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-10-13 23:01:25,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2019-10-13 23:01:25,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-10-13 23:01:25,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 337 transitions. [2019-10-13 23:01:25,540 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 337 transitions. Word has length 68 [2019-10-13 23:01:25,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:25,542 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 337 transitions. [2019-10-13 23:01:25,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 23:01:25,542 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 337 transitions. [2019-10-13 23:01:25,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-13 23:01:25,543 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:25,543 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:25,544 INFO L410 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:25,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:25,544 INFO L82 PathProgramCache]: Analyzing trace with hash 79636294, now seen corresponding path program 1 times [2019-10-13 23:01:25,544 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:25,544 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199995447] [2019-10-13 23:01:25,544 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:25,545 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:25,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:25,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:25,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199995447] [2019-10-13 23:01:25,667 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:25,667 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-13 23:01:25,667 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220435902] [2019-10-13 23:01:25,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 23:01:25,668 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:25,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 23:01:25,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-13 23:01:25,668 INFO L87 Difference]: Start difference. First operand 262 states and 337 transitions. Second operand 13 states. [2019-10-13 23:01:25,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:25,816 INFO L93 Difference]: Finished difference Result 284 states and 360 transitions. [2019-10-13 23:01:25,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 23:01:25,817 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2019-10-13 23:01:25,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:25,819 INFO L225 Difference]: With dead ends: 284 [2019-10-13 23:01:25,819 INFO L226 Difference]: Without dead ends: 260 [2019-10-13 23:01:25,821 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-10-13 23:01:25,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-10-13 23:01:25,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2019-10-13 23:01:25,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-13 23:01:25,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 333 transitions. [2019-10-13 23:01:25,853 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 333 transitions. Word has length 80 [2019-10-13 23:01:25,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:25,853 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 333 transitions. [2019-10-13 23:01:25,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 23:01:25,853 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 333 transitions. [2019-10-13 23:01:25,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-13 23:01:25,855 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:25,855 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:25,855 INFO L410 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:25,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:25,855 INFO L82 PathProgramCache]: Analyzing trace with hash -624277236, now seen corresponding path program 1 times [2019-10-13 23:01:25,856 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:25,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408810240] [2019-10-13 23:01:25,856 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:25,856 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:25,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:26,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:26,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408810240] [2019-10-13 23:01:26,092 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:26,092 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-13 23:01:26,093 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998269087] [2019-10-13 23:01:26,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-13 23:01:26,093 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:26,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-13 23:01:26,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-13 23:01:26,094 INFO L87 Difference]: Start difference. First operand 260 states and 333 transitions. Second operand 14 states. [2019-10-13 23:01:27,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:27,375 INFO L93 Difference]: Finished difference Result 281 states and 354 transitions. [2019-10-13 23:01:27,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 23:01:27,377 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 87 [2019-10-13 23:01:27,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:27,379 INFO L225 Difference]: With dead ends: 281 [2019-10-13 23:01:27,379 INFO L226 Difference]: Without dead ends: 253 [2019-10-13 23:01:27,380 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-10-13 23:01:27,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-10-13 23:01:27,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 251. [2019-10-13 23:01:27,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-10-13 23:01:27,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 321 transitions. [2019-10-13 23:01:27,402 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 321 transitions. Word has length 87 [2019-10-13 23:01:27,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:27,402 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 321 transitions. [2019-10-13 23:01:27,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-13 23:01:27,403 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 321 transitions. [2019-10-13 23:01:27,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-13 23:01:27,404 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:27,404 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:27,404 INFO L410 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:27,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:27,405 INFO L82 PathProgramCache]: Analyzing trace with hash 680639073, now seen corresponding path program 1 times [2019-10-13 23:01:27,405 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:27,405 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535435744] [2019-10-13 23:01:27,405 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:27,405 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:27,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:27,563 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-13 23:01:27,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535435744] [2019-10-13 23:01:27,564 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:27,564 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:01:27,564 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173945798] [2019-10-13 23:01:27,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:01:27,566 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:27,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:01:27,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:27,566 INFO L87 Difference]: Start difference. First operand 251 states and 321 transitions. Second operand 7 states. [2019-10-13 23:01:27,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:27,805 INFO L93 Difference]: Finished difference Result 305 states and 386 transitions. [2019-10-13 23:01:27,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 23:01:27,805 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2019-10-13 23:01:27,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:27,807 INFO L225 Difference]: With dead ends: 305 [2019-10-13 23:01:27,808 INFO L226 Difference]: Without dead ends: 301 [2019-10-13 23:01:27,808 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:01:27,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-10-13 23:01:27,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 256. [2019-10-13 23:01:27,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-10-13 23:01:27,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 328 transitions. [2019-10-13 23:01:27,832 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 328 transitions. Word has length 99 [2019-10-13 23:01:27,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:27,834 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 328 transitions. [2019-10-13 23:01:27,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:01:27,835 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 328 transitions. [2019-10-13 23:01:27,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 23:01:27,836 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:27,836 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:27,836 INFO L410 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:27,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:27,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1503096704, now seen corresponding path program 1 times [2019-10-13 23:01:27,837 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:27,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639919736] [2019-10-13 23:01:27,837 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:27,838 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:27,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:27,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:27,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639919736] [2019-10-13 23:01:27,979 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:27,979 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-13 23:01:27,979 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932182360] [2019-10-13 23:01:27,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 23:01:27,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:27,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 23:01:27,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-13 23:01:27,980 INFO L87 Difference]: Start difference. First operand 256 states and 328 transitions. Second operand 13 states. [2019-10-13 23:01:28,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:28,145 INFO L93 Difference]: Finished difference Result 284 states and 360 transitions. [2019-10-13 23:01:28,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 23:01:28,145 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 92 [2019-10-13 23:01:28,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:28,148 INFO L225 Difference]: With dead ends: 284 [2019-10-13 23:01:28,148 INFO L226 Difference]: Without dead ends: 256 [2019-10-13 23:01:28,149 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-10-13 23:01:28,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-10-13 23:01:28,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 254. [2019-10-13 23:01:28,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-10-13 23:01:28,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 323 transitions. [2019-10-13 23:01:28,185 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 323 transitions. Word has length 92 [2019-10-13 23:01:28,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:28,186 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 323 transitions. [2019-10-13 23:01:28,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 23:01:28,186 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 323 transitions. [2019-10-13 23:01:28,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-13 23:01:28,187 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:28,188 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:28,188 INFO L410 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:28,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:28,188 INFO L82 PathProgramCache]: Analyzing trace with hash 762003235, now seen corresponding path program 1 times [2019-10-13 23:01:28,188 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:28,188 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863321905] [2019-10-13 23:01:28,189 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:28,189 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:28,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:28,286 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 23:01:28,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863321905] [2019-10-13 23:01:28,287 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:28,287 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:28,287 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788782274] [2019-10-13 23:01:28,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:28,288 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:28,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:28,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:28,291 INFO L87 Difference]: Start difference. First operand 254 states and 323 transitions. Second operand 5 states. [2019-10-13 23:01:28,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:28,642 INFO L93 Difference]: Finished difference Result 476 states and 586 transitions. [2019-10-13 23:01:28,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:01:28,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-10-13 23:01:28,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:28,645 INFO L225 Difference]: With dead ends: 476 [2019-10-13 23:01:28,645 INFO L226 Difference]: Without dead ends: 301 [2019-10-13 23:01:28,647 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:01:28,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-10-13 23:01:28,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 264. [2019-10-13 23:01:28,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-10-13 23:01:28,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 319 transitions. [2019-10-13 23:01:28,675 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 319 transitions. Word has length 107 [2019-10-13 23:01:28,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:28,676 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 319 transitions. [2019-10-13 23:01:28,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:28,676 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 319 transitions. [2019-10-13 23:01:28,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-13 23:01:28,677 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:28,677 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:28,677 INFO L410 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:28,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:28,678 INFO L82 PathProgramCache]: Analyzing trace with hash 643818800, now seen corresponding path program 1 times [2019-10-13 23:01:28,678 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:28,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018522308] [2019-10-13 23:01:28,678 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:28,678 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:28,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:28,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:28,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018522308] [2019-10-13 23:01:28,915 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:28,915 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-13 23:01:28,915 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130959575] [2019-10-13 23:01:28,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-13 23:01:28,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:28,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-13 23:01:28,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-13 23:01:28,917 INFO L87 Difference]: Start difference. First operand 264 states and 319 transitions. Second operand 14 states. [2019-10-13 23:01:30,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:30,236 INFO L93 Difference]: Finished difference Result 268 states and 321 transitions. [2019-10-13 23:01:30,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-13 23:01:30,243 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 99 [2019-10-13 23:01:30,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:30,245 INFO L225 Difference]: With dead ends: 268 [2019-10-13 23:01:30,245 INFO L226 Difference]: Without dead ends: 221 [2019-10-13 23:01:30,246 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-10-13 23:01:30,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-10-13 23:01:30,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 182. [2019-10-13 23:01:30,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-10-13 23:01:30,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 206 transitions. [2019-10-13 23:01:30,265 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 206 transitions. Word has length 99 [2019-10-13 23:01:30,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:30,266 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 206 transitions. [2019-10-13 23:01:30,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-13 23:01:30,266 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 206 transitions. [2019-10-13 23:01:30,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-13 23:01:30,268 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:30,268 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:30,268 INFO L410 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:30,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:30,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1156427461, now seen corresponding path program 1 times [2019-10-13 23:01:30,269 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:30,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207078240] [2019-10-13 23:01:30,269 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:30,269 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:30,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:30,465 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-13 23:01:30,465 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207078240] [2019-10-13 23:01:30,466 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:30,466 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:01:30,466 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154987490] [2019-10-13 23:01:30,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:01:30,466 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:30,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:01:30,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:30,467 INFO L87 Difference]: Start difference. First operand 182 states and 206 transitions. Second operand 7 states. [2019-10-13 23:01:30,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:30,690 INFO L93 Difference]: Finished difference Result 246 states and 279 transitions. [2019-10-13 23:01:30,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 23:01:30,691 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2019-10-13 23:01:30,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:30,693 INFO L225 Difference]: With dead ends: 246 [2019-10-13 23:01:30,693 INFO L226 Difference]: Without dead ends: 236 [2019-10-13 23:01:30,693 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:01:30,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-10-13 23:01:30,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 183. [2019-10-13 23:01:30,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-10-13 23:01:30,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 204 transitions. [2019-10-13 23:01:30,717 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 204 transitions. Word has length 132 [2019-10-13 23:01:30,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:30,717 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 204 transitions. [2019-10-13 23:01:30,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:01:30,718 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 204 transitions. [2019-10-13 23:01:30,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-13 23:01:30,719 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:30,720 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:30,720 INFO L410 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:30,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:30,720 INFO L82 PathProgramCache]: Analyzing trace with hash -583705189, now seen corresponding path program 1 times [2019-10-13 23:01:30,720 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:30,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751335638] [2019-10-13 23:01:30,721 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:30,721 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:30,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:30,998 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-13 23:01:30,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751335638] [2019-10-13 23:01:30,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795110861] [2019-10-13 23:01:31,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:01:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:31,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 1425 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-13 23:01:31,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:01:31,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:01:31,588 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-10-13 23:01:31,588 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:01:32,062 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-10-13 23:01:32,062 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 23:01:32,062 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 17 [2019-10-13 23:01:32,062 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347234746] [2019-10-13 23:01:32,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 23:01:32,065 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:32,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 23:01:32,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-10-13 23:01:32,066 INFO L87 Difference]: Start difference. First operand 183 states and 204 transitions. Second operand 11 states. [2019-10-13 23:01:32,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:32,628 INFO L93 Difference]: Finished difference Result 230 states and 257 transitions. [2019-10-13 23:01:32,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 23:01:32,628 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 163 [2019-10-13 23:01:32,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:32,630 INFO L225 Difference]: With dead ends: 230 [2019-10-13 23:01:32,630 INFO L226 Difference]: Without dead ends: 220 [2019-10-13 23:01:32,631 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2019-10-13 23:01:32,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-10-13 23:01:32,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 164. [2019-10-13 23:01:32,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-13 23:01:32,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 180 transitions. [2019-10-13 23:01:32,663 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 180 transitions. Word has length 163 [2019-10-13 23:01:32,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:32,663 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 180 transitions. [2019-10-13 23:01:32,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 23:01:32,663 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 180 transitions. [2019-10-13 23:01:32,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-13 23:01:32,665 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:32,665 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:32,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:01:32,875 INFO L410 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:32,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:32,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1692345567, now seen corresponding path program 1 times [2019-10-13 23:01:32,876 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:32,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728093415] [2019-10-13 23:01:32,876 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:32,876 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:32,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:33,064 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-10-13 23:01:33,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728093415] [2019-10-13 23:01:33,065 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:33,065 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:01:33,065 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030786919] [2019-10-13 23:01:33,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:01:33,066 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:33,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:01:33,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:33,067 INFO L87 Difference]: Start difference. First operand 164 states and 180 transitions. Second operand 7 states. [2019-10-13 23:01:33,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:33,231 INFO L93 Difference]: Finished difference Result 202 states and 224 transitions. [2019-10-13 23:01:33,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 23:01:33,231 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 165 [2019-10-13 23:01:33,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:33,232 INFO L225 Difference]: With dead ends: 202 [2019-10-13 23:01:33,232 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 23:01:33,233 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:01:33,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 23:01:33,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 23:01:33,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 23:01:33,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 23:01:33,234 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 165 [2019-10-13 23:01:33,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:33,234 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 23:01:33,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:01:33,234 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 23:01:33,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 23:01:33,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 23:01:36,459 WARN L191 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 58 [2019-10-13 23:01:36,615 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-10-13 23:01:36,921 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 66 [2019-10-13 23:01:37,266 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 62 [2019-10-13 23:01:37,384 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 63 [2019-10-13 23:01:37,830 WARN L191 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 47 [2019-10-13 23:01:38,055 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 1 [2019-10-13 23:01:38,283 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 61 [2019-10-13 23:01:38,602 WARN L191 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 74 [2019-10-13 23:01:38,957 WARN L191 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 1 [2019-10-13 23:01:39,212 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2019-10-13 23:01:39,320 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 70 [2019-10-13 23:01:39,451 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62