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/cdaudio_simpl1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 23:01:06,828 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:01:06,831 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:01:06,850 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:01:06,851 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:01:06,853 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:01:06,855 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:01:06,864 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:01:06,869 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:01:06,872 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:01:06,874 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:01:06,875 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:01:06,875 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:01:06,877 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:01:06,879 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:01:06,881 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:01:06,882 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:01:06,883 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:01:06,885 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:01:06,889 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:01:06,893 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:01:06,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:01:06,899 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:01:06,899 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:01:06,901 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:01:06,901 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:01:06,902 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:01:06,902 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:01:06,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:01:06,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:01:06,904 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:01:06,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:01:06,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:01:06,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:01:06,907 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:01:06,907 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:01:06,908 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:01:06,908 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:01:06,908 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:01:06,909 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:01:06,910 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:01:06,910 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:06,924 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:01:06,924 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:01:06,926 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:01:06,926 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:01:06,926 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:01:06,926 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:01:06,927 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:01:06,927 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:01:06,927 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:01:06,927 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:01:06,927 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:01:06,928 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:01:06,928 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:01:06,928 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:01:06,928 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:01:06,928 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:01:06,929 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:01:06,929 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:01:06,929 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:01:06,929 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:01:06,929 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:01:06,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:01:06,930 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:01:06,930 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:01:06,930 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:01:06,930 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:01:06,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:01:06,931 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:01:06,931 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:07,245 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:01:07,262 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:01:07,265 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:01:07,267 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:01:07,267 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:01:07,268 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-2.c [2019-10-13 23:01:07,347 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d61f71d42/30a302c4cf7643c6a7923b1dfcc23844/FLAG12d2f745e [2019-10-13 23:01:07,957 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:01:07,958 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-2.c [2019-10-13 23:01:07,981 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d61f71d42/30a302c4cf7643c6a7923b1dfcc23844/FLAG12d2f745e [2019-10-13 23:01:08,272 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d61f71d42/30a302c4cf7643c6a7923b1dfcc23844 [2019-10-13 23:01:08,283 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:01:08,285 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:01:08,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:01:08,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:01:08,291 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:01:08,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:01:08" (1/1) ... [2019-10-13 23:01:08,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c45cfae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:08, skipping insertion in model container [2019-10-13 23:01:08,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:01:08" (1/1) ... [2019-10-13 23:01:08,305 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:01:08,388 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:01:09,008 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:01:09,019 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:01:09,201 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:01:09,231 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:01:09,232 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,232 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:01:09,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:01:09,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:01:09,233 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:01:09,243 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:09,244 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:09,272 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:09,272 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:09,316 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:09,340 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:09,360 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:09,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:01:09,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:01:09,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:01:09,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:01:09,384 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:09,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:01:09,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:01:09,460 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-13 23:01:09,460 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-13 23:01:09,460 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2019-10-13 23:01:09,461 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2019-10-13 23:01:09,462 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2019-10-13 23:01:09,462 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2019-10-13 23:01:09,463 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2019-10-13 23:01:09,463 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2019-10-13 23:01:09,463 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2019-10-13 23:01:09,464 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2019-10-13 23:01:09,464 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2019-10-13 23:01:09,464 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2019-10-13 23:01:09,464 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2019-10-13 23:01:09,464 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2019-10-13 23:01:09,466 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2019-10-13 23:01:09,467 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2019-10-13 23:01:09,467 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2019-10-13 23:01:09,467 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2019-10-13 23:01:09,467 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2019-10-13 23:01:09,468 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-13 23:01:09,468 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:01:09,468 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-13 23:01:09,468 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-13 23:01:09,468 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-13 23:01:09,469 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-13 23:01:09,469 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-13 23:01:09,469 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-10-13 23:01:09,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-10-13 23:01:09,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:01:09,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 23:01:09,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 23:01:09,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-13 23:01:09,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-13 23:01:09,470 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2019-10-13 23:01:09,470 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2019-10-13 23:01:09,471 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2019-10-13 23:01:09,471 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2019-10-13 23:01:09,471 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2019-10-13 23:01:09,471 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2019-10-13 23:01:09,471 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2019-10-13 23:01:09,471 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2019-10-13 23:01:09,471 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2019-10-13 23:01:09,472 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2019-10-13 23:01:09,472 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2019-10-13 23:01:09,472 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2019-10-13 23:01:09,472 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2019-10-13 23:01:09,472 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2019-10-13 23:01:09,472 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2019-10-13 23:01:09,472 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-13 23:01:09,473 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-13 23:01:09,473 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-13 23:01:09,473 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-10-13 23:01:09,473 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-10-13 23:01:09,473 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-13 23:01:09,473 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-13 23:01:09,474 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-13 23:01:09,474 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2019-10-13 23:01:09,475 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2019-10-13 23:01:09,475 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-13 23:01:09,475 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:01:09,475 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-13 23:01:09,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:01:09,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:01:10,081 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:10,179 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2019-10-13 23:01:10,179 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2019-10-13 23:01:10,190 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:10,243 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-10-13 23:01:10,244 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-10-13 23:01:10,273 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:10,297 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-13 23:01:10,298 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-13 23:01:10,405 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:10,482 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint L304: #res := 0; [2019-10-13 23:01:10,482 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-10-13 23:01:10,482 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-10-13 23:01:10,489 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:10,715 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2019-10-13 23:01:10,715 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2019-10-13 23:01:10,716 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:10,757 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-10-13 23:01:10,758 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-10-13 23:01:10,789 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:10,810 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-10-13 23:01:10,811 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-10-13 23:01:10,816 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:11,043 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2019-10-13 23:01:11,043 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2019-10-13 23:01:11,057 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:11,064 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-13 23:01:11,064 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-13 23:01:11,656 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:01:11,656 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 23:01:11,657 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,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:01:11,659 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:01:11,659 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:01:11,662 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:01:11,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:01:08" (1/3) ... [2019-10-13 23:01:11,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79101894 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,664 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,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79101894 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,664 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,666 INFO L109 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-2.c [2019-10-13 23:01:11,677 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:01:11,685 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 23:01:11,696 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 23:01:11,725 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:01:11,725 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:01:11,725 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:01:11,725 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:01:11,725 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:01:11,726 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:01:11,726 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:01:11,726 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:01:11,754 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states. [2019-10-13 23:01:11,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 23:01:11,762 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:11,763 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,765 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:11,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:11,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1471663135, now seen corresponding path program 1 times [2019-10-13 23:01:11,780 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:11,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718857883] [2019-10-13 23:01:11,781 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:11,781 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:11,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:11,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:12,071 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,072 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718857883] [2019-10-13 23:01:12,073 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:12,073 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:12,074 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555684555] [2019-10-13 23:01:12,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:12,079 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:12,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:12,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:12,096 INFO L87 Difference]: Start difference. First operand 408 states. Second operand 3 states. [2019-10-13 23:01:12,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:12,387 INFO L93 Difference]: Finished difference Result 702 states and 1087 transitions. [2019-10-13 23:01:12,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:12,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 23:01:12,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:12,420 INFO L225 Difference]: With dead ends: 702 [2019-10-13 23:01:12,421 INFO L226 Difference]: Without dead ends: 402 [2019-10-13 23:01:12,433 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,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-10-13 23:01:12,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2019-10-13 23:01:12,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-10-13 23:01:12,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 579 transitions. [2019-10-13 23:01:12,569 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 579 transitions. Word has length 18 [2019-10-13 23:01:12,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:12,569 INFO L462 AbstractCegarLoop]: Abstraction has 402 states and 579 transitions. [2019-10-13 23:01:12,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:12,570 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 579 transitions. [2019-10-13 23:01:12,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 23:01:12,571 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:12,572 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,572 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:12,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:12,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1826833932, now seen corresponding path program 1 times [2019-10-13 23:01:12,573 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:12,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137450857] [2019-10-13 23:01:12,573 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:12,573 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:12,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:12,748 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,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137450857] [2019-10-13 23:01:12,749 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:12,750 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:12,750 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114606210] [2019-10-13 23:01:12,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:12,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:12,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:12,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:12,753 INFO L87 Difference]: Start difference. First operand 402 states and 579 transitions. Second operand 3 states. [2019-10-13 23:01:12,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:12,973 INFO L93 Difference]: Finished difference Result 572 states and 806 transitions. [2019-10-13 23:01:12,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:12,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-13 23:01:12,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:12,980 INFO L225 Difference]: With dead ends: 572 [2019-10-13 23:01:12,981 INFO L226 Difference]: Without dead ends: 475 [2019-10-13 23:01:12,982 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:12,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-10-13 23:01:13,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 471. [2019-10-13 23:01:13,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-10-13 23:01:13,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 672 transitions. [2019-10-13 23:01:13,019 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 672 transitions. Word has length 21 [2019-10-13 23:01:13,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:13,019 INFO L462 AbstractCegarLoop]: Abstraction has 471 states and 672 transitions. [2019-10-13 23:01:13,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:13,020 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 672 transitions. [2019-10-13 23:01:13,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 23:01:13,022 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:13,022 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] [2019-10-13 23:01:13,022 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:13,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:13,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1575704033, now seen corresponding path program 1 times [2019-10-13 23:01:13,023 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:13,023 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44223392] [2019-10-13 23:01:13,023 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:13,023 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:13,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:13,210 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,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44223392] [2019-10-13 23:01:13,211 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:13,211 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:13,211 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498576933] [2019-10-13 23:01:13,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:13,212 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:13,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:13,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:13,213 INFO L87 Difference]: Start difference. First operand 471 states and 672 transitions. Second operand 3 states. [2019-10-13 23:01:13,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:13,255 INFO L93 Difference]: Finished difference Result 685 states and 950 transitions. [2019-10-13 23:01:13,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:13,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 23:01:13,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:13,261 INFO L225 Difference]: With dead ends: 685 [2019-10-13 23:01:13,261 INFO L226 Difference]: Without dead ends: 578 [2019-10-13 23:01:13,262 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:13,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-10-13 23:01:13,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 541. [2019-10-13 23:01:13,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-10-13 23:01:13,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 764 transitions. [2019-10-13 23:01:13,302 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 764 transitions. Word has length 26 [2019-10-13 23:01:13,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:13,302 INFO L462 AbstractCegarLoop]: Abstraction has 541 states and 764 transitions. [2019-10-13 23:01:13,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:13,302 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 764 transitions. [2019-10-13 23:01:13,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 23:01:13,305 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:13,305 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:13,306 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:13,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:13,306 INFO L82 PathProgramCache]: Analyzing trace with hash 673908008, now seen corresponding path program 1 times [2019-10-13 23:01:13,306 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:13,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933264416] [2019-10-13 23:01:13,307 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:13,307 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:13,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:13,379 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,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933264416] [2019-10-13 23:01:13,380 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:13,380 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:13,380 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099228163] [2019-10-13 23:01:13,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:13,382 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:13,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:13,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:13,383 INFO L87 Difference]: Start difference. First operand 541 states and 764 transitions. Second operand 3 states. [2019-10-13 23:01:13,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:13,635 INFO L93 Difference]: Finished difference Result 1024 states and 1490 transitions. [2019-10-13 23:01:13,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:13,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 23:01:13,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:13,649 INFO L225 Difference]: With dead ends: 1024 [2019-10-13 23:01:13,650 INFO L226 Difference]: Without dead ends: 818 [2019-10-13 23:01:13,653 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,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-10-13 23:01:13,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 668. [2019-10-13 23:01:13,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-10-13 23:01:13,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 990 transitions. [2019-10-13 23:01:13,724 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 990 transitions. Word has length 27 [2019-10-13 23:01:13,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:13,725 INFO L462 AbstractCegarLoop]: Abstraction has 668 states and 990 transitions. [2019-10-13 23:01:13,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:13,730 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 990 transitions. [2019-10-13 23:01:13,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 23:01:13,732 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:13,732 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] [2019-10-13 23:01:13,733 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:13,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:13,733 INFO L82 PathProgramCache]: Analyzing trace with hash -822079973, now seen corresponding path program 1 times [2019-10-13 23:01:13,733 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:13,733 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150491909] [2019-10-13 23:01:13,734 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:13,734 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:13,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:13,868 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,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150491909] [2019-10-13 23:01:13,870 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:13,870 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:13,870 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66607735] [2019-10-13 23:01:13,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:13,871 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:13,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:13,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:13,871 INFO L87 Difference]: Start difference. First operand 668 states and 990 transitions. Second operand 5 states. [2019-10-13 23:01:14,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:14,669 INFO L93 Difference]: Finished difference Result 1132 states and 1671 transitions. [2019-10-13 23:01:14,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 23:01:14,669 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-10-13 23:01:14,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:14,675 INFO L225 Difference]: With dead ends: 1132 [2019-10-13 23:01:14,675 INFO L226 Difference]: Without dead ends: 717 [2019-10-13 23:01:14,677 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:14,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-10-13 23:01:14,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 656. [2019-10-13 23:01:14,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2019-10-13 23:01:14,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 966 transitions. [2019-10-13 23:01:14,717 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 966 transitions. Word has length 28 [2019-10-13 23:01:14,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:14,717 INFO L462 AbstractCegarLoop]: Abstraction has 656 states and 966 transitions. [2019-10-13 23:01:14,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:14,717 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 966 transitions. [2019-10-13 23:01:14,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 23:01:14,719 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:14,720 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] [2019-10-13 23:01:14,720 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:14,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:14,720 INFO L82 PathProgramCache]: Analyzing trace with hash -808448961, now seen corresponding path program 1 times [2019-10-13 23:01:14,721 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:14,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278779082] [2019-10-13 23:01:14,721 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:14,721 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:14,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:14,775 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,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278779082] [2019-10-13 23:01:14,775 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:14,775 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:14,776 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286557771] [2019-10-13 23:01:14,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:14,776 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:14,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:14,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:14,777 INFO L87 Difference]: Start difference. First operand 656 states and 966 transitions. Second operand 3 states. [2019-10-13 23:01:14,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:14,861 INFO L93 Difference]: Finished difference Result 659 states and 968 transitions. [2019-10-13 23:01:14,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:14,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 23:01:14,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:14,866 INFO L225 Difference]: With dead ends: 659 [2019-10-13 23:01:14,867 INFO L226 Difference]: Without dead ends: 655 [2019-10-13 23:01:14,867 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:14,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-10-13 23:01:14,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2019-10-13 23:01:14,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-10-13 23:01:14,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 963 transitions. [2019-10-13 23:01:14,907 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 963 transitions. Word has length 29 [2019-10-13 23:01:14,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:14,908 INFO L462 AbstractCegarLoop]: Abstraction has 655 states and 963 transitions. [2019-10-13 23:01:14,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:14,908 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 963 transitions. [2019-10-13 23:01:14,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-13 23:01:14,910 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:14,910 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:14,911 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:14,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:14,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1336520426, now seen corresponding path program 1 times [2019-10-13 23:01:14,911 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:14,911 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498885935] [2019-10-13 23:01:14,912 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:14,912 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:14,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:14,959 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,959 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498885935] [2019-10-13 23:01:14,959 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:14,959 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:14,960 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941206021] [2019-10-13 23:01:14,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:14,960 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:14,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:14,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:14,961 INFO L87 Difference]: Start difference. First operand 655 states and 963 transitions. Second operand 3 states. [2019-10-13 23:01:15,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:15,007 INFO L93 Difference]: Finished difference Result 925 states and 1317 transitions. [2019-10-13 23:01:15,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:15,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-13 23:01:15,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:15,014 INFO L225 Difference]: With dead ends: 925 [2019-10-13 23:01:15,014 INFO L226 Difference]: Without dead ends: 737 [2019-10-13 23:01:15,015 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:15,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-10-13 23:01:15,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 637. [2019-10-13 23:01:15,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2019-10-13 23:01:15,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 902 transitions. [2019-10-13 23:01:15,062 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 902 transitions. Word has length 35 [2019-10-13 23:01:15,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:15,062 INFO L462 AbstractCegarLoop]: Abstraction has 637 states and 902 transitions. [2019-10-13 23:01:15,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:15,062 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 902 transitions. [2019-10-13 23:01:15,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-13 23:01:15,065 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:15,066 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] [2019-10-13 23:01:15,066 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:15,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:15,066 INFO L82 PathProgramCache]: Analyzing trace with hash -804463058, now seen corresponding path program 1 times [2019-10-13 23:01:15,067 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:15,067 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141924693] [2019-10-13 23:01:15,067 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:15,067 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:15,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:15,161 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,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141924693] [2019-10-13 23:01:15,162 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:15,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:15,163 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623358777] [2019-10-13 23:01:15,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:15,163 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:15,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:15,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:15,164 INFO L87 Difference]: Start difference. First operand 637 states and 902 transitions. Second operand 3 states. [2019-10-13 23:01:15,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:15,214 INFO L93 Difference]: Finished difference Result 703 states and 983 transitions. [2019-10-13 23:01:15,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:15,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-13 23:01:15,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:15,219 INFO L225 Difference]: With dead ends: 703 [2019-10-13 23:01:15,219 INFO L226 Difference]: Without dead ends: 685 [2019-10-13 23:01:15,220 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:15,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-10-13 23:01:15,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 670. [2019-10-13 23:01:15,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-10-13 23:01:15,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 940 transitions. [2019-10-13 23:01:15,256 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 940 transitions. Word has length 36 [2019-10-13 23:01:15,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:15,257 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 940 transitions. [2019-10-13 23:01:15,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:15,257 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 940 transitions. [2019-10-13 23:01:15,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-13 23:01:15,260 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:15,260 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:15,261 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:15,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:15,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1782796671, now seen corresponding path program 1 times [2019-10-13 23:01:15,261 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:15,261 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862848522] [2019-10-13 23:01:15,262 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:15,262 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:15,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:15,311 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,312 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862848522] [2019-10-13 23:01:15,312 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:15,312 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:01:15,312 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118755033] [2019-10-13 23:01:15,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:01:15,313 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:15,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:01:15,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:01:15,314 INFO L87 Difference]: Start difference. First operand 670 states and 940 transitions. Second operand 4 states. [2019-10-13 23:01:15,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:15,670 INFO L93 Difference]: Finished difference Result 771 states and 1056 transitions. [2019-10-13 23:01:15,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:01:15,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-10-13 23:01:15,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:15,675 INFO L225 Difference]: With dead ends: 771 [2019-10-13 23:01:15,675 INFO L226 Difference]: Without dead ends: 597 [2019-10-13 23:01:15,676 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:15,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-10-13 23:01:15,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 568. [2019-10-13 23:01:15,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-13 23:01:15,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 785 transitions. [2019-10-13 23:01:15,713 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 785 transitions. Word has length 42 [2019-10-13 23:01:15,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:15,714 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 785 transitions. [2019-10-13 23:01:15,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:01:15,714 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 785 transitions. [2019-10-13 23:01:15,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-13 23:01:15,717 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:15,717 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:15,718 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:15,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:15,718 INFO L82 PathProgramCache]: Analyzing trace with hash 432749520, now seen corresponding path program 1 times [2019-10-13 23:01:15,718 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:15,719 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807814398] [2019-10-13 23:01:15,719 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:15,719 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:15,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:15,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:15,766 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,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807814398] [2019-10-13 23:01:15,767 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:15,767 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:15,767 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719626737] [2019-10-13 23:01:15,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:15,768 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:15,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:15,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:15,769 INFO L87 Difference]: Start difference. First operand 568 states and 785 transitions. Second operand 3 states. [2019-10-13 23:01:15,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:15,814 INFO L93 Difference]: Finished difference Result 773 states and 1059 transitions. [2019-10-13 23:01:15,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:15,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-10-13 23:01:15,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:15,819 INFO L225 Difference]: With dead ends: 773 [2019-10-13 23:01:15,819 INFO L226 Difference]: Without dead ends: 599 [2019-10-13 23:01:15,820 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:15,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-13 23:01:15,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 568. [2019-10-13 23:01:15,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-13 23:01:15,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 783 transitions. [2019-10-13 23:01:15,857 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 783 transitions. Word has length 42 [2019-10-13 23:01:15,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:15,858 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 783 transitions. [2019-10-13 23:01:15,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:15,858 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 783 transitions. [2019-10-13 23:01:15,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-13 23:01:15,860 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:15,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] [2019-10-13 23:01:15,861 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:15,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:15,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1161412528, now seen corresponding path program 1 times [2019-10-13 23:01:15,862 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:15,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550908145] [2019-10-13 23:01:15,862 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:15,862 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:15,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:15,902 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,903 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550908145] [2019-10-13 23:01:15,903 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:15,903 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:15,904 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390998665] [2019-10-13 23:01:15,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:15,904 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:15,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:15,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:15,905 INFO L87 Difference]: Start difference. First operand 568 states and 783 transitions. Second operand 3 states. [2019-10-13 23:01:16,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:16,042 INFO L93 Difference]: Finished difference Result 726 states and 994 transitions. [2019-10-13 23:01:16,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:16,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-13 23:01:16,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:16,048 INFO L225 Difference]: With dead ends: 726 [2019-10-13 23:01:16,048 INFO L226 Difference]: Without dead ends: 716 [2019-10-13 23:01:16,049 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:16,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2019-10-13 23:01:16,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 635. [2019-10-13 23:01:16,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-13 23:01:16,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 864 transitions. [2019-10-13 23:01:16,087 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 864 transitions. Word has length 40 [2019-10-13 23:01:16,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:16,088 INFO L462 AbstractCegarLoop]: Abstraction has 635 states and 864 transitions. [2019-10-13 23:01:16,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:16,088 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 864 transitions. [2019-10-13 23:01:16,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-13 23:01:16,090 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:16,091 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:16,091 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:16,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:16,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1003994184, now seen corresponding path program 1 times [2019-10-13 23:01:16,092 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:16,092 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393694279] [2019-10-13 23:01:16,092 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:16,092 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:16,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:16,133 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,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393694279] [2019-10-13 23:01:16,133 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:16,133 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:16,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627497370] [2019-10-13 23:01:16,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:16,134 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:16,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:16,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:16,135 INFO L87 Difference]: Start difference. First operand 635 states and 864 transitions. Second operand 3 states. [2019-10-13 23:01:16,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:16,179 INFO L93 Difference]: Finished difference Result 744 states and 989 transitions. [2019-10-13 23:01:16,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:16,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-13 23:01:16,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:16,184 INFO L225 Difference]: With dead ends: 744 [2019-10-13 23:01:16,184 INFO L226 Difference]: Without dead ends: 658 [2019-10-13 23:01:16,185 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:16,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-10-13 23:01:16,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 632. [2019-10-13 23:01:16,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-10-13 23:01:16,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 856 transitions. [2019-10-13 23:01:16,223 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 856 transitions. Word has length 43 [2019-10-13 23:01:16,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:16,223 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 856 transitions. [2019-10-13 23:01:16,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:16,223 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 856 transitions. [2019-10-13 23:01:16,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-13 23:01:16,225 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:16,225 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,226 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:16,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:16,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1200179264, now seen corresponding path program 1 times [2019-10-13 23:01:16,226 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:16,226 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824924932] [2019-10-13 23:01:16,227 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:16,227 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:16,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:16,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:16,323 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,324 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824924932] [2019-10-13 23:01:16,324 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:16,324 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 23:01:16,325 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944587350] [2019-10-13 23:01:16,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 23:01:16,326 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:16,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 23:01:16,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:01:16,326 INFO L87 Difference]: Start difference. First operand 632 states and 856 transitions. Second operand 10 states. [2019-10-13 23:01:18,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:18,657 INFO L93 Difference]: Finished difference Result 808 states and 1130 transitions. [2019-10-13 23:01:18,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 23:01:18,657 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2019-10-13 23:01:18,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:18,663 INFO L225 Difference]: With dead ends: 808 [2019-10-13 23:01:18,664 INFO L226 Difference]: Without dead ends: 800 [2019-10-13 23:01:18,665 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-10-13 23:01:18,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-10-13 23:01:18,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 639. [2019-10-13 23:01:18,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-10-13 23:01:18,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 858 transitions. [2019-10-13 23:01:18,744 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 858 transitions. Word has length 41 [2019-10-13 23:01:18,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:18,744 INFO L462 AbstractCegarLoop]: Abstraction has 639 states and 858 transitions. [2019-10-13 23:01:18,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 23:01:18,744 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 858 transitions. [2019-10-13 23:01:18,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-13 23:01:18,746 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:18,747 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:18,747 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:18,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:18,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1361312649, now seen corresponding path program 1 times [2019-10-13 23:01:18,747 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:18,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3533814] [2019-10-13 23:01:18,748 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:18,748 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:18,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:18,868 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,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3533814] [2019-10-13 23:01:18,868 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:18,868 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:01:18,869 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786141385] [2019-10-13 23:01:18,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:01:18,870 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:18,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:01:18,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:18,870 INFO L87 Difference]: Start difference. First operand 639 states and 858 transitions. Second operand 7 states. [2019-10-13 23:01:19,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:19,878 INFO L93 Difference]: Finished difference Result 768 states and 1067 transitions. [2019-10-13 23:01:19,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 23:01:19,878 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-10-13 23:01:19,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:19,884 INFO L225 Difference]: With dead ends: 768 [2019-10-13 23:01:19,884 INFO L226 Difference]: Without dead ends: 713 [2019-10-13 23:01:19,885 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:01:19,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-10-13 23:01:19,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 639. [2019-10-13 23:01:19,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-10-13 23:01:19,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 856 transitions. [2019-10-13 23:01:19,931 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 856 transitions. Word has length 41 [2019-10-13 23:01:19,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:19,932 INFO L462 AbstractCegarLoop]: Abstraction has 639 states and 856 transitions. [2019-10-13 23:01:19,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:01:19,932 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 856 transitions. [2019-10-13 23:01:19,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-13 23:01:19,934 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:19,935 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:19,935 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:19,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:19,935 INFO L82 PathProgramCache]: Analyzing trace with hash 808827987, now seen corresponding path program 1 times [2019-10-13 23:01:19,935 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:19,936 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142231274] [2019-10-13 23:01:19,936 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:19,936 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:19,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:20,047 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,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142231274] [2019-10-13 23:01:20,048 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:20,048 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:01:20,048 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400242104] [2019-10-13 23:01:20,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:01:20,049 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:20,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:01:20,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:01:20,050 INFO L87 Difference]: Start difference. First operand 639 states and 856 transitions. Second operand 9 states. [2019-10-13 23:01:21,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:21,730 INFO L93 Difference]: Finished difference Result 762 states and 1049 transitions. [2019-10-13 23:01:21,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 23:01:21,730 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2019-10-13 23:01:21,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:21,735 INFO L225 Difference]: With dead ends: 762 [2019-10-13 23:01:21,736 INFO L226 Difference]: Without dead ends: 709 [2019-10-13 23:01:21,738 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2019-10-13 23:01:21,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2019-10-13 23:01:21,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 574. [2019-10-13 23:01:21,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-13 23:01:21,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 772 transitions. [2019-10-13 23:01:21,780 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 772 transitions. Word has length 42 [2019-10-13 23:01:21,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:21,782 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 772 transitions. [2019-10-13 23:01:21,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:01:21,782 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 772 transitions. [2019-10-13 23:01:21,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-13 23:01:21,784 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:21,784 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:21,784 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:21,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:21,785 INFO L82 PathProgramCache]: Analyzing trace with hash -971270421, now seen corresponding path program 1 times [2019-10-13 23:01:21,785 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:21,785 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781054937] [2019-10-13 23:01:21,785 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,786 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:21,835 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,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781054937] [2019-10-13 23:01:21,836 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:21,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:21,882 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050030813] [2019-10-13 23:01:21,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:21,883 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:21,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:21,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:21,884 INFO L87 Difference]: Start difference. First operand 574 states and 772 transitions. Second operand 3 states. [2019-10-13 23:01:21,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:21,996 INFO L93 Difference]: Finished difference Result 715 states and 955 transitions. [2019-10-13 23:01:21,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:21,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-10-13 23:01:21,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:22,000 INFO L225 Difference]: With dead ends: 715 [2019-10-13 23:01:22,001 INFO L226 Difference]: Without dead ends: 704 [2019-10-13 23:01:22,001 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,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-10-13 23:01:22,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 621. [2019-10-13 23:01:22,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-10-13 23:01:22,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 823 transitions. [2019-10-13 23:01:22,044 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 823 transitions. Word has length 42 [2019-10-13 23:01:22,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:22,045 INFO L462 AbstractCegarLoop]: Abstraction has 621 states and 823 transitions. [2019-10-13 23:01:22,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:22,045 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 823 transitions. [2019-10-13 23:01:22,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-13 23:01:22,047 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:22,047 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:22,047 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:22,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:22,048 INFO L82 PathProgramCache]: Analyzing trace with hash 399258757, now seen corresponding path program 1 times [2019-10-13 23:01:22,048 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:22,048 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624559544] [2019-10-13 23:01:22,048 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:22,048 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:22,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:22,140 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,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624559544] [2019-10-13 23:01:22,140 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:22,141 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 23:01:22,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482381006] [2019-10-13 23:01:22,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 23:01:22,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:22,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 23:01:22,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:01:22,142 INFO L87 Difference]: Start difference. First operand 621 states and 823 transitions. Second operand 8 states. [2019-10-13 23:01:22,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:22,316 INFO L93 Difference]: Finished difference Result 636 states and 840 transitions. [2019-10-13 23:01:22,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 23:01:22,316 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2019-10-13 23:01:22,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:22,320 INFO L225 Difference]: With dead ends: 636 [2019-10-13 23:01:22,321 INFO L226 Difference]: Without dead ends: 632 [2019-10-13 23:01:22,321 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:22,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-10-13 23:01:22,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 630. [2019-10-13 23:01:22,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-13 23:01:22,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 834 transitions. [2019-10-13 23:01:22,371 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 834 transitions. Word has length 43 [2019-10-13 23:01:22,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:22,371 INFO L462 AbstractCegarLoop]: Abstraction has 630 states and 834 transitions. [2019-10-13 23:01:22,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 23:01:22,371 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 834 transitions. [2019-10-13 23:01:22,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-13 23:01:22,373 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:22,374 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:22,374 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:22,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:22,374 INFO L82 PathProgramCache]: Analyzing trace with hash 398981927, now seen corresponding path program 1 times [2019-10-13 23:01:22,375 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:22,375 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689563881] [2019-10-13 23:01:22,375 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:22,375 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:22,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:22,425 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,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689563881] [2019-10-13 23:01:22,426 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:22,426 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:22,427 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522468946] [2019-10-13 23:01:22,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:22,427 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:22,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:22,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:22,428 INFO L87 Difference]: Start difference. First operand 630 states and 834 transitions. Second operand 5 states. [2019-10-13 23:01:23,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:23,020 INFO L93 Difference]: Finished difference Result 715 states and 953 transitions. [2019-10-13 23:01:23,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:01:23,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-10-13 23:01:23,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:23,025 INFO L225 Difference]: With dead ends: 715 [2019-10-13 23:01:23,026 INFO L226 Difference]: Without dead ends: 685 [2019-10-13 23:01:23,026 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:23,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-10-13 23:01:23,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 606. [2019-10-13 23:01:23,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-10-13 23:01:23,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 807 transitions. [2019-10-13 23:01:23,071 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 807 transitions. Word has length 43 [2019-10-13 23:01:23,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:23,071 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 807 transitions. [2019-10-13 23:01:23,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:23,072 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 807 transitions. [2019-10-13 23:01:23,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-13 23:01:23,074 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:23,074 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] [2019-10-13 23:01:23,074 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:23,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:23,075 INFO L82 PathProgramCache]: Analyzing trace with hash -456522929, now seen corresponding path program 1 times [2019-10-13 23:01:23,075 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:23,075 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270206380] [2019-10-13 23:01:23,075 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:23,075 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:23,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:23,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:23,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270206380] [2019-10-13 23:01:23,125 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:23,126 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:23,126 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102594065] [2019-10-13 23:01:23,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:23,126 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:23,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:23,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:23,127 INFO L87 Difference]: Start difference. First operand 606 states and 807 transitions. Second operand 3 states. [2019-10-13 23:01:23,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:23,210 INFO L93 Difference]: Finished difference Result 631 states and 835 transitions. [2019-10-13 23:01:23,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:23,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-13 23:01:23,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:23,214 INFO L225 Difference]: With dead ends: 631 [2019-10-13 23:01:23,214 INFO L226 Difference]: Without dead ends: 624 [2019-10-13 23:01:23,215 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:23,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-10-13 23:01:23,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 622. [2019-10-13 23:01:23,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-10-13 23:01:23,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 825 transitions. [2019-10-13 23:01:23,271 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 825 transitions. Word has length 45 [2019-10-13 23:01:23,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:23,271 INFO L462 AbstractCegarLoop]: Abstraction has 622 states and 825 transitions. [2019-10-13 23:01:23,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:23,271 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 825 transitions. [2019-10-13 23:01:23,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 23:01:23,274 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:23,274 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,274 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:23,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:23,275 INFO L82 PathProgramCache]: Analyzing trace with hash -185372726, now seen corresponding path program 1 times [2019-10-13 23:01:23,275 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:23,275 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441694005] [2019-10-13 23:01:23,275 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:23,276 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:23,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:23,358 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,358 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441694005] [2019-10-13 23:01:23,358 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:23,359 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:23,359 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354848917] [2019-10-13 23:01:23,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:23,359 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:23,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:23,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:23,360 INFO L87 Difference]: Start difference. First operand 622 states and 825 transitions. Second operand 3 states. [2019-10-13 23:01:23,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:23,433 INFO L93 Difference]: Finished difference Result 791 states and 1043 transitions. [2019-10-13 23:01:23,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:23,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-13 23:01:23,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:23,437 INFO L225 Difference]: With dead ends: 791 [2019-10-13 23:01:23,437 INFO L226 Difference]: Without dead ends: 598 [2019-10-13 23:01:23,438 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:23,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-13 23:01:23,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-13 23:01:23,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-13 23:01:23,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 792 transitions. [2019-10-13 23:01:23,487 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 792 transitions. Word has length 50 [2019-10-13 23:01:23,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:23,488 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 792 transitions. [2019-10-13 23:01:23,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:23,488 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 792 transitions. [2019-10-13 23:01:23,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-13 23:01:23,490 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:23,490 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] [2019-10-13 23:01:23,491 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:23,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:23,491 INFO L82 PathProgramCache]: Analyzing trace with hash -397376972, now seen corresponding path program 1 times [2019-10-13 23:01:23,491 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:23,492 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280946755] [2019-10-13 23:01:23,492 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:23,492 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:23,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:23,660 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,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280946755] [2019-10-13 23:01:23,660 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:23,661 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-13 23:01:23,661 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369773288] [2019-10-13 23:01:23,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 23:01:23,661 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:23,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 23:01:23,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-13 23:01:23,665 INFO L87 Difference]: Start difference. First operand 598 states and 792 transitions. Second operand 13 states. [2019-10-13 23:01:25,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:25,424 INFO L93 Difference]: Finished difference Result 628 states and 824 transitions. [2019-10-13 23:01:25,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 23:01:25,425 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2019-10-13 23:01:25,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:25,429 INFO L225 Difference]: With dead ends: 628 [2019-10-13 23:01:25,429 INFO L226 Difference]: Without dead ends: 622 [2019-10-13 23:01:25,430 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2019-10-13 23:01:25,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-10-13 23:01:25,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 598. [2019-10-13 23:01:25,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-13 23:01:25,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 791 transitions. [2019-10-13 23:01:25,472 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 791 transitions. Word has length 47 [2019-10-13 23:01:25,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:25,472 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 791 transitions. [2019-10-13 23:01:25,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 23:01:25,472 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 791 transitions. [2019-10-13 23:01:25,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-13 23:01:25,474 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:25,474 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] [2019-10-13 23:01:25,475 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:25,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:25,475 INFO L82 PathProgramCache]: Analyzing trace with hash 878367500, now seen corresponding path program 1 times [2019-10-13 23:01:25,475 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:25,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364341090] [2019-10-13 23:01:25,476 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:25,476 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:25,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:25,566 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,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364341090] [2019-10-13 23:01:25,567 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:25,567 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:01:25,568 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347764680] [2019-10-13 23:01:25,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:01:25,568 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:25,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:01:25,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:01:25,569 INFO L87 Difference]: Start difference. First operand 598 states and 791 transitions. Second operand 9 states. [2019-10-13 23:01:25,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:25,735 INFO L93 Difference]: Finished difference Result 622 states and 817 transitions. [2019-10-13 23:01:25,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 23:01:25,736 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2019-10-13 23:01:25,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:25,740 INFO L225 Difference]: With dead ends: 622 [2019-10-13 23:01:25,740 INFO L226 Difference]: Without dead ends: 593 [2019-10-13 23:01:25,741 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:25,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-10-13 23:01:25,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2019-10-13 23:01:25,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-10-13 23:01:25,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 774 transitions. [2019-10-13 23:01:25,786 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 774 transitions. Word has length 48 [2019-10-13 23:01:25,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:25,788 INFO L462 AbstractCegarLoop]: Abstraction has 593 states and 774 transitions. [2019-10-13 23:01:25,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:01:25,788 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 774 transitions. [2019-10-13 23:01:25,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 23:01:25,796 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:25,796 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:25,796 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:25,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:25,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1711324058, now seen corresponding path program 1 times [2019-10-13 23:01:25,797 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:25,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667006631] [2019-10-13 23:01:25,798 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:25,798 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:25,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:25,907 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,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667006631] [2019-10-13 23:01:25,908 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:25,908 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 23:01:25,908 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885281033] [2019-10-13 23:01:25,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 23:01:25,909 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:25,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 23:01:25,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:01:25,910 INFO L87 Difference]: Start difference. First operand 593 states and 774 transitions. Second operand 10 states. [2019-10-13 23:01:26,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:26,176 INFO L93 Difference]: Finished difference Result 609 states and 791 transitions. [2019-10-13 23:01:26,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 23:01:26,177 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-10-13 23:01:26,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:26,181 INFO L225 Difference]: With dead ends: 609 [2019-10-13 23:01:26,181 INFO L226 Difference]: Without dead ends: 591 [2019-10-13 23:01:26,182 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:26,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-10-13 23:01:26,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-10-13 23:01:26,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-10-13 23:01:26,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 770 transitions. [2019-10-13 23:01:26,242 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 770 transitions. Word has length 50 [2019-10-13 23:01:26,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:26,243 INFO L462 AbstractCegarLoop]: Abstraction has 591 states and 770 transitions. [2019-10-13 23:01:26,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 23:01:26,243 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 770 transitions. [2019-10-13 23:01:26,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 23:01:26,245 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:26,246 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:26,246 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:26,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:26,246 INFO L82 PathProgramCache]: Analyzing trace with hash 211323632, now seen corresponding path program 1 times [2019-10-13 23:01:26,246 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:26,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704840458] [2019-10-13 23:01:26,247 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:26,247 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:26,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:26,400 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,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704840458] [2019-10-13 23:01:26,401 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:26,401 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 23:01:26,402 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087026524] [2019-10-13 23:01:26,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 23:01:26,402 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:26,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 23:01:26,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:26,403 INFO L87 Difference]: Start difference. First operand 591 states and 770 transitions. Second operand 11 states. [2019-10-13 23:01:26,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:26,635 INFO L93 Difference]: Finished difference Result 607 states and 787 transitions. [2019-10-13 23:01:26,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:01:26,635 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2019-10-13 23:01:26,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:26,638 INFO L225 Difference]: With dead ends: 607 [2019-10-13 23:01:26,639 INFO L226 Difference]: Without dead ends: 589 [2019-10-13 23:01:26,641 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-13 23:01:26,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-13 23:01:26,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-10-13 23:01:26,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-13 23:01:26,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 766 transitions. [2019-10-13 23:01:26,684 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 766 transitions. Word has length 50 [2019-10-13 23:01:26,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:26,685 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 766 transitions. [2019-10-13 23:01:26,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 23:01:26,685 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 766 transitions. [2019-10-13 23:01:26,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-13 23:01:26,688 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:26,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, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:26,689 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:26,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:26,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1636630726, now seen corresponding path program 1 times [2019-10-13 23:01:26,689 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:26,690 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844720782] [2019-10-13 23:01:26,690 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:26,690 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:26,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:26,777 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,778 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844720782] [2019-10-13 23:01:26,778 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:26,778 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 23:01:26,778 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140572224] [2019-10-13 23:01:26,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 23:01:26,779 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:26,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 23:01:26,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:01:26,780 INFO L87 Difference]: Start difference. First operand 589 states and 766 transitions. Second operand 10 states. [2019-10-13 23:01:26,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:26,979 INFO L93 Difference]: Finished difference Result 602 states and 780 transitions. [2019-10-13 23:01:26,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 23:01:26,980 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2019-10-13 23:01:26,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:26,984 INFO L225 Difference]: With dead ends: 602 [2019-10-13 23:01:26,984 INFO L226 Difference]: Without dead ends: 584 [2019-10-13 23:01:26,985 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:26,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-13 23:01:27,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-10-13 23:01:27,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-13 23:01:27,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 759 transitions. [2019-10-13 23:01:27,048 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 759 transitions. Word has length 49 [2019-10-13 23:01:27,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:27,052 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 759 transitions. [2019-10-13 23:01:27,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 23:01:27,052 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 759 transitions. [2019-10-13 23:01:27,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 23:01:27,054 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:27,055 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:27,055 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:27,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:27,055 INFO L82 PathProgramCache]: Analyzing trace with hash -572398302, now seen corresponding path program 1 times [2019-10-13 23:01:27,056 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:27,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352132597] [2019-10-13 23:01:27,056 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:27,056 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:27,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:27,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:27,291 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,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352132597] [2019-10-13 23:01:27,291 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:27,292 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 23:01:27,292 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364417127] [2019-10-13 23:01:27,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 23:01:27,293 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:27,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 23:01:27,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:01:27,294 INFO L87 Difference]: Start difference. First operand 584 states and 759 transitions. Second operand 12 states. [2019-10-13 23:01:27,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:27,547 INFO L93 Difference]: Finished difference Result 609 states and 786 transitions. [2019-10-13 23:01:27,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 23:01:27,547 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-10-13 23:01:27,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:27,551 INFO L225 Difference]: With dead ends: 609 [2019-10-13 23:01:27,551 INFO L226 Difference]: Without dead ends: 586 [2019-10-13 23:01:27,551 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-13 23:01:27,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-13 23:01:27,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 582. [2019-10-13 23:01:27,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-13 23:01:27,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 755 transitions. [2019-10-13 23:01:27,594 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 755 transitions. Word has length 54 [2019-10-13 23:01:27,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:27,595 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 755 transitions. [2019-10-13 23:01:27,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 23:01:27,595 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 755 transitions. [2019-10-13 23:01:27,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-13 23:01:27,597 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:27,597 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] [2019-10-13 23:01:27,598 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:27,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:27,598 INFO L82 PathProgramCache]: Analyzing trace with hash 916624012, now seen corresponding path program 1 times [2019-10-13 23:01:27,598 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:27,599 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982174679] [2019-10-13 23:01:27,599 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:27,599 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:27,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:27,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:27,722 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982174679] [2019-10-13 23:01:27,723 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:27,723 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 23:01:27,723 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134514002] [2019-10-13 23:01:27,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 23:01:27,723 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:27,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 23:01:27,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:01:27,724 INFO L87 Difference]: Start difference. First operand 582 states and 755 transitions. Second operand 12 states. [2019-10-13 23:01:27,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:27,965 INFO L93 Difference]: Finished difference Result 607 states and 782 transitions. [2019-10-13 23:01:27,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 23:01:27,966 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-10-13 23:01:27,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:27,969 INFO L225 Difference]: With dead ends: 607 [2019-10-13 23:01:27,969 INFO L226 Difference]: Without dead ends: 584 [2019-10-13 23:01:27,971 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-13 23:01:27,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-13 23:01:28,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 580. [2019-10-13 23:01:28,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-10-13 23:01:28,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 751 transitions. [2019-10-13 23:01:28,009 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 751 transitions. Word has length 53 [2019-10-13 23:01:28,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:28,010 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 751 transitions. [2019-10-13 23:01:28,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 23:01:28,010 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 751 transitions. [2019-10-13 23:01:28,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-13 23:01:28,012 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:28,012 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] [2019-10-13 23:01:28,012 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:28,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:28,013 INFO L82 PathProgramCache]: Analyzing trace with hash 911278729, now seen corresponding path program 1 times [2019-10-13 23:01:28,013 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:28,013 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099051410] [2019-10-13 23:01:28,013 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:28,013 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:28,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:28,147 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,148 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099051410] [2019-10-13 23:01:28,148 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:28,148 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 23:01:28,148 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34007244] [2019-10-13 23:01:28,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 23:01:28,149 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:28,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 23:01:28,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:01:28,149 INFO L87 Difference]: Start difference. First operand 580 states and 751 transitions. Second operand 12 states. [2019-10-13 23:01:28,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:28,386 INFO L93 Difference]: Finished difference Result 603 states and 776 transitions. [2019-10-13 23:01:28,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 23:01:28,387 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2019-10-13 23:01:28,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:28,390 INFO L225 Difference]: With dead ends: 603 [2019-10-13 23:01:28,390 INFO L226 Difference]: Without dead ends: 579 [2019-10-13 23:01:28,391 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-13 23:01:28,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-10-13 23:01:28,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-10-13 23:01:28,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-10-13 23:01:28,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 740 transitions. [2019-10-13 23:01:28,430 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 740 transitions. Word has length 51 [2019-10-13 23:01:28,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:28,430 INFO L462 AbstractCegarLoop]: Abstraction has 579 states and 740 transitions. [2019-10-13 23:01:28,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 23:01:28,430 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 740 transitions. [2019-10-13 23:01:28,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 23:01:28,432 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:28,432 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:28,433 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:28,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:28,433 INFO L82 PathProgramCache]: Analyzing trace with hash -126879601, now seen corresponding path program 1 times [2019-10-13 23:01:28,433 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:28,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303026507] [2019-10-13 23:01:28,434 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:28,434 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:28,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:28,495 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,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303026507] [2019-10-13 23:01:28,495 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:28,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:28,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871980966] [2019-10-13 23:01:28,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:28,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:28,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:28,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:28,497 INFO L87 Difference]: Start difference. First operand 579 states and 740 transitions. Second operand 5 states. [2019-10-13 23:01:29,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:29,440 INFO L93 Difference]: Finished difference Result 962 states and 1289 transitions. [2019-10-13 23:01:29,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 23:01:29,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-10-13 23:01:29,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:29,445 INFO L225 Difference]: With dead ends: 962 [2019-10-13 23:01:29,445 INFO L226 Difference]: Without dead ends: 837 [2019-10-13 23:01:29,446 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:29,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2019-10-13 23:01:29,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 610. [2019-10-13 23:01:29,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-13 23:01:29,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 785 transitions. [2019-10-13 23:01:29,492 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 785 transitions. Word has length 54 [2019-10-13 23:01:29,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:29,492 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 785 transitions. [2019-10-13 23:01:29,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:29,493 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 785 transitions. [2019-10-13 23:01:29,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-13 23:01:29,495 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:29,495 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] [2019-10-13 23:01:29,495 INFO L410 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:29,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:29,495 INFO L82 PathProgramCache]: Analyzing trace with hash -264370587, now seen corresponding path program 1 times [2019-10-13 23:01:29,496 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:29,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402344881] [2019-10-13 23:01:29,496 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:29,496 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:29,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:29,582 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:29,583 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402344881] [2019-10-13 23:01:29,583 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:29,583 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:01:29,584 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209010676] [2019-10-13 23:01:29,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:01:29,586 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:29,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:01:29,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:01:29,586 INFO L87 Difference]: Start difference. First operand 610 states and 785 transitions. Second operand 9 states. [2019-10-13 23:01:29,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:29,767 INFO L93 Difference]: Finished difference Result 634 states and 811 transitions. [2019-10-13 23:01:29,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 23:01:29,768 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-10-13 23:01:29,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:29,771 INFO L225 Difference]: With dead ends: 634 [2019-10-13 23:01:29,771 INFO L226 Difference]: Without dead ends: 583 [2019-10-13 23:01:29,772 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:29,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-13 23:01:29,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-13 23:01:29,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-13 23:01:29,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 737 transitions. [2019-10-13 23:01:29,812 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 737 transitions. Word has length 51 [2019-10-13 23:01:29,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:29,813 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 737 transitions. [2019-10-13 23:01:29,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:01:29,813 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 737 transitions. [2019-10-13 23:01:29,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 23:01:29,815 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:29,815 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:29,815 INFO L410 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:29,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:29,815 INFO L82 PathProgramCache]: Analyzing trace with hash -678859389, now seen corresponding path program 1 times [2019-10-13 23:01:29,816 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:29,816 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258168853] [2019-10-13 23:01:29,816 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:29,816 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:29,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:29,918 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:29,918 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258168853] [2019-10-13 23:01:29,918 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:29,919 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 23:01:29,919 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473642701] [2019-10-13 23:01:29,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 23:01:29,920 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:29,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 23:01:29,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:29,924 INFO L87 Difference]: Start difference. First operand 583 states and 737 transitions. Second operand 11 states. [2019-10-13 23:01:30,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:30,058 INFO L93 Difference]: Finished difference Result 644 states and 816 transitions. [2019-10-13 23:01:30,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:01:30,058 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-10-13 23:01:30,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:30,062 INFO L225 Difference]: With dead ends: 644 [2019-10-13 23:01:30,062 INFO L226 Difference]: Without dead ends: 593 [2019-10-13 23:01:30,063 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-13 23:01:30,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-10-13 23:01:30,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 587. [2019-10-13 23:01:30,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-13 23:01:30,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 754 transitions. [2019-10-13 23:01:30,109 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 754 transitions. Word has length 54 [2019-10-13 23:01:30,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:30,109 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 754 transitions. [2019-10-13 23:01:30,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 23:01:30,109 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 754 transitions. [2019-10-13 23:01:30,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-13 23:01:30,111 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:30,112 INFO L380 BasicCegarLoop]: trace histogram [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:30,112 INFO L410 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:30,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:30,113 INFO L82 PathProgramCache]: Analyzing trace with hash -289383489, now seen corresponding path program 1 times [2019-10-13 23:01:30,113 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:30,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907390514] [2019-10-13 23:01:30,115 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:30,115 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:30,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:30,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 23:01:30,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907390514] [2019-10-13 23:01:30,176 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:30,176 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:30,176 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645651201] [2019-10-13 23:01:30,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:30,177 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:30,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:30,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:30,178 INFO L87 Difference]: Start difference. First operand 587 states and 754 transitions. Second operand 5 states. [2019-10-13 23:01:30,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:30,677 INFO L93 Difference]: Finished difference Result 877 states and 1124 transitions. [2019-10-13 23:01:30,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:01:30,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-10-13 23:01:30,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:30,681 INFO L225 Difference]: With dead ends: 877 [2019-10-13 23:01:30,681 INFO L226 Difference]: Without dead ends: 587 [2019-10-13 23:01:30,682 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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:30,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-10-13 23:01:30,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-10-13 23:01:30,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-13 23:01:30,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 742 transitions. [2019-10-13 23:01:30,726 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 742 transitions. Word has length 67 [2019-10-13 23:01:30,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:30,726 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 742 transitions. [2019-10-13 23:01:30,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:30,727 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 742 transitions. [2019-10-13 23:01:30,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-13 23:01:30,729 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:30,729 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 23:01:30,729 INFO L410 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:30,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:30,729 INFO L82 PathProgramCache]: Analyzing trace with hash 750568491, now seen corresponding path program 1 times [2019-10-13 23:01:30,730 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:30,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741625703] [2019-10-13 23:01:30,730 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:30,730 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:30,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:30,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 23:01:30,774 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741625703] [2019-10-13 23:01:30,774 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:30,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:30,774 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51219993] [2019-10-13 23:01:30,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:30,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:30,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:30,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:30,775 INFO L87 Difference]: Start difference. First operand 587 states and 742 transitions. Second operand 3 states. [2019-10-13 23:01:30,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:30,822 INFO L93 Difference]: Finished difference Result 717 states and 897 transitions. [2019-10-13 23:01:30,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:30,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-10-13 23:01:30,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:30,825 INFO L225 Difference]: With dead ends: 717 [2019-10-13 23:01:30,825 INFO L226 Difference]: Without dead ends: 565 [2019-10-13 23:01:30,827 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:30,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-10-13 23:01:30,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 563. [2019-10-13 23:01:30,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-10-13 23:01:30,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 705 transitions. [2019-10-13 23:01:30,880 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 705 transitions. Word has length 68 [2019-10-13 23:01:30,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:30,880 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 705 transitions. [2019-10-13 23:01:30,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:30,881 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 705 transitions. [2019-10-13 23:01:30,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 23:01:30,883 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:30,884 INFO L410 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:30,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:30,884 INFO L82 PathProgramCache]: Analyzing trace with hash 876079827, now seen corresponding path program 1 times [2019-10-13 23:01:30,884 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:30,885 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116360257] [2019-10-13 23:01:30,885 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:30,885 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:30,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:31,094 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:31,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116360257] [2019-10-13 23:01:31,095 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:31,095 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-13 23:01:31,095 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813008836] [2019-10-13 23:01:31,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-13 23:01:31,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:31,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-13 23:01:31,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-10-13 23:01:31,097 INFO L87 Difference]: Start difference. First operand 563 states and 705 transitions. Second operand 14 states. [2019-10-13 23:01:31,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:31,543 INFO L93 Difference]: Finished difference Result 605 states and 755 transitions. [2019-10-13 23:01:31,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 23:01:31,544 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2019-10-13 23:01:31,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:31,547 INFO L225 Difference]: With dead ends: 605 [2019-10-13 23:01:31,547 INFO L226 Difference]: Without dead ends: 582 [2019-10-13 23:01:31,548 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2019-10-13 23:01:31,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-13 23:01:31,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 567. [2019-10-13 23:01:31,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-10-13 23:01:31,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 711 transitions. [2019-10-13 23:01:31,599 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 711 transitions. Word has length 55 [2019-10-13 23:01:31,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:31,599 INFO L462 AbstractCegarLoop]: Abstraction has 567 states and 711 transitions. [2019-10-13 23:01:31,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-13 23:01:31,600 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 711 transitions. [2019-10-13 23:01:31,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 23:01:31,603 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:31,603 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:31,603 INFO L410 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:31,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:31,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1672905161, now seen corresponding path program 1 times [2019-10-13 23:01:31,604 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:31,604 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039306419] [2019-10-13 23:01:31,604 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:31,604 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:31,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:31,738 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:31,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039306419] [2019-10-13 23:01:31,738 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:31,738 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-13 23:01:31,739 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001428109] [2019-10-13 23:01:31,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 23:01:31,739 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:31,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 23:01:31,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-13 23:01:31,740 INFO L87 Difference]: Start difference. First operand 567 states and 711 transitions. Second operand 13 states. [2019-10-13 23:01:32,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:32,063 INFO L93 Difference]: Finished difference Result 583 states and 728 transitions. [2019-10-13 23:01:32,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 23:01:32,064 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-10-13 23:01:32,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:32,068 INFO L225 Difference]: With dead ends: 583 [2019-10-13 23:01:32,068 INFO L226 Difference]: Without dead ends: 562 [2019-10-13 23:01:32,069 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-13 23:01:32,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-13 23:01:32,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-13 23:01:32,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-13 23:01:32,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 704 transitions. [2019-10-13 23:01:32,136 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 704 transitions. Word has length 55 [2019-10-13 23:01:32,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:32,137 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 704 transitions. [2019-10-13 23:01:32,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 23:01:32,137 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 704 transitions. [2019-10-13 23:01:32,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 23:01:32,140 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:32,141 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:32,141 INFO L410 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:32,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:32,142 INFO L82 PathProgramCache]: Analyzing trace with hash -2129275013, now seen corresponding path program 1 times [2019-10-13 23:01:32,142 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:32,142 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032527668] [2019-10-13 23:01:32,142 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:32,143 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:32,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:32,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:32,251 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:32,251 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032527668] [2019-10-13 23:01:32,251 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:32,252 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:32,252 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862219348] [2019-10-13 23:01:32,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:32,252 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:32,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:32,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:32,253 INFO L87 Difference]: Start difference. First operand 562 states and 704 transitions. Second operand 5 states. [2019-10-13 23:01:32,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:32,723 INFO L93 Difference]: Finished difference Result 657 states and 811 transitions. [2019-10-13 23:01:32,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 23:01:32,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-10-13 23:01:32,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:32,727 INFO L225 Difference]: With dead ends: 657 [2019-10-13 23:01:32,727 INFO L226 Difference]: Without dead ends: 584 [2019-10-13 23:01:32,728 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:32,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-10-13 23:01:32,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 563. [2019-10-13 23:01:32,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-10-13 23:01:32,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 702 transitions. [2019-10-13 23:01:32,777 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 702 transitions. Word has length 59 [2019-10-13 23:01:32,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:32,778 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 702 transitions. [2019-10-13 23:01:32,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:32,778 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 702 transitions. [2019-10-13 23:01:32,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 23:01:32,780 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:32,780 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] [2019-10-13 23:01:32,780 INFO L410 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:32,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:32,780 INFO L82 PathProgramCache]: Analyzing trace with hash -2136791779, now seen corresponding path program 1 times [2019-10-13 23:01:32,781 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:32,781 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926287620] [2019-10-13 23:01:32,781 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:32,781 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:32,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:32,877 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:32,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926287620] [2019-10-13 23:01:32,878 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:32,878 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 23:01:32,878 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292526141] [2019-10-13 23:01:32,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 23:01:32,879 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:32,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 23:01:32,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:32,879 INFO L87 Difference]: Start difference. First operand 563 states and 702 transitions. Second operand 11 states. [2019-10-13 23:01:33,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:33,062 INFO L93 Difference]: Finished difference Result 599 states and 743 transitions. [2019-10-13 23:01:33,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:01:33,063 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-10-13 23:01:33,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:33,066 INFO L225 Difference]: With dead ends: 599 [2019-10-13 23:01:33,066 INFO L226 Difference]: Without dead ends: 576 [2019-10-13 23:01:33,067 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-13 23:01:33,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-10-13 23:01:33,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 563. [2019-10-13 23:01:33,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-10-13 23:01:33,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 702 transitions. [2019-10-13 23:01:33,120 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 702 transitions. Word has length 56 [2019-10-13 23:01:33,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:33,120 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 702 transitions. [2019-10-13 23:01:33,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 23:01:33,120 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 702 transitions. [2019-10-13 23:01:33,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 23:01:33,122 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:33,123 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] [2019-10-13 23:01:33,123 INFO L410 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:33,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:33,123 INFO L82 PathProgramCache]: Analyzing trace with hash -59246208, now seen corresponding path program 1 times [2019-10-13 23:01:33,123 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:33,124 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36997377] [2019-10-13 23:01:33,124 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:33,124 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:33,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:33,170 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:33,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36997377] [2019-10-13 23:01:33,171 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:33,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:33,171 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883994262] [2019-10-13 23:01:33,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:33,172 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:33,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:33,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:33,173 INFO L87 Difference]: Start difference. First operand 563 states and 702 transitions. Second operand 3 states. [2019-10-13 23:01:33,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:33,213 INFO L93 Difference]: Finished difference Result 714 states and 878 transitions. [2019-10-13 23:01:33,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:33,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-13 23:01:33,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:33,217 INFO L225 Difference]: With dead ends: 714 [2019-10-13 23:01:33,217 INFO L226 Difference]: Without dead ends: 520 [2019-10-13 23:01:33,218 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:33,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-10-13 23:01:33,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 502. [2019-10-13 23:01:33,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-10-13 23:01:33,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 602 transitions. [2019-10-13 23:01:33,271 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 602 transitions. Word has length 56 [2019-10-13 23:01:33,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:33,271 INFO L462 AbstractCegarLoop]: Abstraction has 502 states and 602 transitions. [2019-10-13 23:01:33,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:33,271 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 602 transitions. [2019-10-13 23:01:33,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 23:01:33,273 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:33,274 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] [2019-10-13 23:01:33,274 INFO L410 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:33,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:33,274 INFO L82 PathProgramCache]: Analyzing trace with hash -775523185, now seen corresponding path program 1 times [2019-10-13 23:01:33,275 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:33,275 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915432224] [2019-10-13 23:01:33,275 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:33,275 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:33,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:33,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:33,411 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915432224] [2019-10-13 23:01:33,411 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:33,411 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-13 23:01:33,411 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85708355] [2019-10-13 23:01:33,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 23:01:33,412 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:33,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 23:01:33,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-13 23:01:33,414 INFO L87 Difference]: Start difference. First operand 502 states and 602 transitions. Second operand 13 states. [2019-10-13 23:01:33,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:33,674 INFO L93 Difference]: Finished difference Result 518 states and 619 transitions. [2019-10-13 23:01:33,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 23:01:33,675 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-10-13 23:01:33,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:33,677 INFO L225 Difference]: With dead ends: 518 [2019-10-13 23:01:33,677 INFO L226 Difference]: Without dead ends: 497 [2019-10-13 23:01:33,679 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-13 23:01:33,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-10-13 23:01:33,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2019-10-13 23:01:33,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2019-10-13 23:01:33,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 595 transitions. [2019-10-13 23:01:33,715 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 595 transitions. Word has length 56 [2019-10-13 23:01:33,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:33,716 INFO L462 AbstractCegarLoop]: Abstraction has 497 states and 595 transitions. [2019-10-13 23:01:33,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 23:01:33,716 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 595 transitions. [2019-10-13 23:01:33,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 23:01:33,718 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:33,718 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] [2019-10-13 23:01:33,718 INFO L410 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:33,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:33,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1844599993, now seen corresponding path program 1 times [2019-10-13 23:01:33,719 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:33,719 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166057124] [2019-10-13 23:01:33,719 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:33,719 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:33,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:33,845 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:33,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166057124] [2019-10-13 23:01:33,846 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:33,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 23:01:33,846 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404751154] [2019-10-13 23:01:33,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 23:01:33,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:33,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 23:01:33,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:33,847 INFO L87 Difference]: Start difference. First operand 497 states and 595 transitions. Second operand 11 states. [2019-10-13 23:01:34,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:34,073 INFO L93 Difference]: Finished difference Result 521 states and 621 transitions. [2019-10-13 23:01:34,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:01:34,074 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-10-13 23:01:34,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:34,076 INFO L225 Difference]: With dead ends: 521 [2019-10-13 23:01:34,076 INFO L226 Difference]: Without dead ends: 494 [2019-10-13 23:01:34,077 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-13 23:01:34,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-10-13 23:01:34,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2019-10-13 23:01:34,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-10-13 23:01:34,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 590 transitions. [2019-10-13 23:01:34,113 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 590 transitions. Word has length 57 [2019-10-13 23:01:34,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:34,113 INFO L462 AbstractCegarLoop]: Abstraction has 494 states and 590 transitions. [2019-10-13 23:01:34,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 23:01:34,114 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 590 transitions. [2019-10-13 23:01:34,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 23:01:34,116 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:34,116 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:34,116 INFO L410 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:34,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:34,116 INFO L82 PathProgramCache]: Analyzing trace with hash -504628611, now seen corresponding path program 1 times [2019-10-13 23:01:34,117 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:34,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537753775] [2019-10-13 23:01:34,117 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:34,117 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:34,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:34,315 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:34,315 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537753775] [2019-10-13 23:01:34,315 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:34,315 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 23:01:34,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828316952] [2019-10-13 23:01:34,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 23:01:34,316 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:34,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 23:01:34,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:01:34,317 INFO L87 Difference]: Start difference. First operand 494 states and 590 transitions. Second operand 12 states. [2019-10-13 23:01:34,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:34,522 INFO L93 Difference]: Finished difference Result 517 states and 614 transitions. [2019-10-13 23:01:34,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 23:01:34,523 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-10-13 23:01:34,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:34,526 INFO L225 Difference]: With dead ends: 517 [2019-10-13 23:01:34,526 INFO L226 Difference]: Without dead ends: 494 [2019-10-13 23:01:34,526 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-13 23:01:34,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-10-13 23:01:34,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 492. [2019-10-13 23:01:34,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-10-13 23:01:34,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 586 transitions. [2019-10-13 23:01:34,566 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 586 transitions. Word has length 59 [2019-10-13 23:01:34,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:34,566 INFO L462 AbstractCegarLoop]: Abstraction has 492 states and 586 transitions. [2019-10-13 23:01:34,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 23:01:34,566 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 586 transitions. [2019-10-13 23:01:34,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 23:01:34,568 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:34,568 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:34,569 INFO L410 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:34,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:34,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1947857079, now seen corresponding path program 1 times [2019-10-13 23:01:34,569 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:34,569 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392737255] [2019-10-13 23:01:34,570 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:34,570 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:34,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:34,753 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:34,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392737255] [2019-10-13 23:01:34,754 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:34,754 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-13 23:01:34,754 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053575157] [2019-10-13 23:01:34,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-13 23:01:34,755 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:34,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-13 23:01:34,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-13 23:01:34,756 INFO L87 Difference]: Start difference. First operand 492 states and 586 transitions. Second operand 14 states. [2019-10-13 23:01:35,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:35,070 INFO L93 Difference]: Finished difference Result 517 states and 613 transitions. [2019-10-13 23:01:35,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 23:01:35,071 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2019-10-13 23:01:35,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:35,073 INFO L225 Difference]: With dead ends: 517 [2019-10-13 23:01:35,073 INFO L226 Difference]: Without dead ends: 491 [2019-10-13 23:01:35,074 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-13 23:01:35,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-10-13 23:01:35,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 489. [2019-10-13 23:01:35,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2019-10-13 23:01:35,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 581 transitions. [2019-10-13 23:01:35,127 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 581 transitions. Word has length 59 [2019-10-13 23:01:35,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:35,128 INFO L462 AbstractCegarLoop]: Abstraction has 489 states and 581 transitions. [2019-10-13 23:01:35,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-13 23:01:35,128 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 581 transitions. [2019-10-13 23:01:35,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 23:01:35,130 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:35,130 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:35,130 INFO L410 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:35,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:35,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1680440093, now seen corresponding path program 1 times [2019-10-13 23:01:35,131 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:35,132 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929323392] [2019-10-13 23:01:35,132 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:35,132 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:35,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:35,366 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:35,366 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929323392] [2019-10-13 23:01:35,367 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:35,367 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-13 23:01:35,367 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908303038] [2019-10-13 23:01:35,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-13 23:01:35,368 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:35,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-13 23:01:35,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-13 23:01:35,368 INFO L87 Difference]: Start difference. First operand 489 states and 581 transitions. Second operand 14 states. [2019-10-13 23:01:35,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:35,695 INFO L93 Difference]: Finished difference Result 514 states and 608 transitions. [2019-10-13 23:01:35,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 23:01:35,696 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-10-13 23:01:35,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:35,699 INFO L225 Difference]: With dead ends: 514 [2019-10-13 23:01:35,699 INFO L226 Difference]: Without dead ends: 486 [2019-10-13 23:01:35,700 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-13 23:01:35,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-10-13 23:01:35,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 484. [2019-10-13 23:01:35,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-10-13 23:01:35,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 574 transitions. [2019-10-13 23:01:35,760 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 574 transitions. Word has length 60 [2019-10-13 23:01:35,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:35,762 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 574 transitions. [2019-10-13 23:01:35,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-13 23:01:35,763 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 574 transitions. [2019-10-13 23:01:35,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 23:01:35,765 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:35,765 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:35,766 INFO L410 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:35,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:35,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1741479821, now seen corresponding path program 1 times [2019-10-13 23:01:35,767 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:35,767 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528815303] [2019-10-13 23:01:35,767 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:35,767 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:35,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:35,922 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:35,922 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528815303] [2019-10-13 23:01:35,922 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:35,922 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-13 23:01:35,923 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258580212] [2019-10-13 23:01:35,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-13 23:01:35,924 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:35,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-13 23:01:35,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-13 23:01:35,925 INFO L87 Difference]: Start difference. First operand 484 states and 574 transitions. Second operand 14 states. [2019-10-13 23:01:36,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:36,220 INFO L93 Difference]: Finished difference Result 509 states and 601 transitions. [2019-10-13 23:01:36,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 23:01:36,221 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-10-13 23:01:36,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:36,231 INFO L225 Difference]: With dead ends: 509 [2019-10-13 23:01:36,231 INFO L226 Difference]: Without dead ends: 483 [2019-10-13 23:01:36,232 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-13 23:01:36,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-10-13 23:01:36,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 481. [2019-10-13 23:01:36,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-10-13 23:01:36,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 569 transitions. [2019-10-13 23:01:36,290 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 569 transitions. Word has length 60 [2019-10-13 23:01:36,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:36,291 INFO L462 AbstractCegarLoop]: Abstraction has 481 states and 569 transitions. [2019-10-13 23:01:36,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-13 23:01:36,291 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 569 transitions. [2019-10-13 23:01:36,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 23:01:36,294 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:36,294 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] [2019-10-13 23:01:36,295 INFO L410 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:36,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:36,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1499433800, now seen corresponding path program 1 times [2019-10-13 23:01:36,296 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:36,296 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273681720] [2019-10-13 23:01:36,296 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:36,296 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:36,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:36,464 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:36,464 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273681720] [2019-10-13 23:01:36,464 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:36,465 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 23:01:36,465 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182901899] [2019-10-13 23:01:36,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 23:01:36,466 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:36,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 23:01:36,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:01:36,467 INFO L87 Difference]: Start difference. First operand 481 states and 569 transitions. Second operand 12 states. [2019-10-13 23:01:36,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:36,658 INFO L93 Difference]: Finished difference Result 502 states and 591 transitions. [2019-10-13 23:01:36,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 23:01:36,658 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2019-10-13 23:01:36,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:36,661 INFO L225 Difference]: With dead ends: 502 [2019-10-13 23:01:36,661 INFO L226 Difference]: Without dead ends: 479 [2019-10-13 23:01:36,662 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-13 23:01:36,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-10-13 23:01:36,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2019-10-13 23:01:36,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-10-13 23:01:36,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 565 transitions. [2019-10-13 23:01:36,699 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 565 transitions. Word has length 58 [2019-10-13 23:01:36,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:36,699 INFO L462 AbstractCegarLoop]: Abstraction has 479 states and 565 transitions. [2019-10-13 23:01:36,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 23:01:36,699 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 565 transitions. [2019-10-13 23:01:36,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 23:01:36,701 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:36,701 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:36,701 INFO L410 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:36,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:36,702 INFO L82 PathProgramCache]: Analyzing trace with hash -913481009, now seen corresponding path program 1 times [2019-10-13 23:01:36,702 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:36,702 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782029769] [2019-10-13 23:01:36,702 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:36,702 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:36,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:36,830 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:36,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782029769] [2019-10-13 23:01:36,831 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:36,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 23:01:36,832 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109451067] [2019-10-13 23:01:36,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 23:01:36,833 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:36,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 23:01:36,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:36,833 INFO L87 Difference]: Start difference. First operand 479 states and 565 transitions. Second operand 11 states. [2019-10-13 23:01:36,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:36,983 INFO L93 Difference]: Finished difference Result 503 states and 591 transitions. [2019-10-13 23:01:36,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:01:36,984 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-10-13 23:01:36,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:36,986 INFO L225 Difference]: With dead ends: 503 [2019-10-13 23:01:36,986 INFO L226 Difference]: Without dead ends: 476 [2019-10-13 23:01:36,987 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-13 23:01:36,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-10-13 23:01:37,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2019-10-13 23:01:37,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-10-13 23:01:37,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 560 transitions. [2019-10-13 23:01:37,022 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 560 transitions. Word has length 59 [2019-10-13 23:01:37,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:37,023 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 560 transitions. [2019-10-13 23:01:37,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 23:01:37,023 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 560 transitions. [2019-10-13 23:01:37,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 23:01:37,024 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:37,024 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:37,025 INFO L410 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:37,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:37,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1493575287, now seen corresponding path program 1 times [2019-10-13 23:01:37,025 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:37,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756201042] [2019-10-13 23:01:37,025 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:37,026 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:37,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:37,177 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:37,177 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756201042] [2019-10-13 23:01:37,177 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:37,178 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-13 23:01:37,178 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092583118] [2019-10-13 23:01:37,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-13 23:01:37,180 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:37,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-13 23:01:37,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-13 23:01:37,182 INFO L87 Difference]: Start difference. First operand 476 states and 560 transitions. Second operand 14 states. [2019-10-13 23:01:37,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:37,403 INFO L93 Difference]: Finished difference Result 499 states and 585 transitions. [2019-10-13 23:01:37,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 23:01:37,404 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-10-13 23:01:37,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:37,406 INFO L225 Difference]: With dead ends: 499 [2019-10-13 23:01:37,407 INFO L226 Difference]: Without dead ends: 474 [2019-10-13 23:01:37,407 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-13 23:01:37,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-10-13 23:01:37,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2019-10-13 23:01:37,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-10-13 23:01:37,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 556 transitions. [2019-10-13 23:01:37,454 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 556 transitions. Word has length 60 [2019-10-13 23:01:37,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:37,455 INFO L462 AbstractCegarLoop]: Abstraction has 474 states and 556 transitions. [2019-10-13 23:01:37,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-13 23:01:37,455 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 556 transitions. [2019-10-13 23:01:37,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 23:01:37,458 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:37,458 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:37,458 INFO L410 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:37,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:37,459 INFO L82 PathProgramCache]: Analyzing trace with hash 604665947, now seen corresponding path program 1 times [2019-10-13 23:01:37,459 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:37,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722664041] [2019-10-13 23:01:37,459 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:37,460 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:37,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:37,655 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:37,655 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722664041] [2019-10-13 23:01:37,658 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:37,658 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 23:01:37,658 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626795148] [2019-10-13 23:01:37,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 23:01:37,659 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:37,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 23:01:37,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:37,661 INFO L87 Difference]: Start difference. First operand 474 states and 556 transitions. Second operand 11 states. [2019-10-13 23:01:37,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:37,806 INFO L93 Difference]: Finished difference Result 498 states and 582 transitions. [2019-10-13 23:01:37,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:01:37,807 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2019-10-13 23:01:37,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:37,809 INFO L225 Difference]: With dead ends: 498 [2019-10-13 23:01:37,809 INFO L226 Difference]: Without dead ends: 472 [2019-10-13 23:01:37,811 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-13 23:01:37,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-10-13 23:01:37,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2019-10-13 23:01:37,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-10-13 23:01:37,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 552 transitions. [2019-10-13 23:01:37,846 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 552 transitions. Word has length 60 [2019-10-13 23:01:37,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:37,847 INFO L462 AbstractCegarLoop]: Abstraction has 472 states and 552 transitions. [2019-10-13 23:01:37,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 23:01:37,847 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 552 transitions. [2019-10-13 23:01:37,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-13 23:01:37,848 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:37,849 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] [2019-10-13 23:01:37,849 INFO L410 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:37,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:37,849 INFO L82 PathProgramCache]: Analyzing trace with hash -640615229, now seen corresponding path program 1 times [2019-10-13 23:01:37,849 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:37,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763679660] [2019-10-13 23:01:37,850 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:37,850 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:37,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:37,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:37,937 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763679660] [2019-10-13 23:01:37,937 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:37,937 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 23:01:37,938 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816247605] [2019-10-13 23:01:37,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 23:01:37,940 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:37,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 23:01:37,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:37,940 INFO L87 Difference]: Start difference. First operand 472 states and 552 transitions. Second operand 11 states. [2019-10-13 23:01:38,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:38,159 INFO L93 Difference]: Finished difference Result 482 states and 561 transitions. [2019-10-13 23:01:38,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:01:38,160 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2019-10-13 23:01:38,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:38,162 INFO L225 Difference]: With dead ends: 482 [2019-10-13 23:01:38,163 INFO L226 Difference]: Without dead ends: 476 [2019-10-13 23:01:38,165 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-13 23:01:38,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-10-13 23:01:38,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 470. [2019-10-13 23:01:38,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-10-13 23:01:38,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 547 transitions. [2019-10-13 23:01:38,209 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 547 transitions. Word has length 61 [2019-10-13 23:01:38,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:38,209 INFO L462 AbstractCegarLoop]: Abstraction has 470 states and 547 transitions. [2019-10-13 23:01:38,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 23:01:38,209 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 547 transitions. [2019-10-13 23:01:38,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-13 23:01:38,211 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:38,212 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 23:01:38,212 INFO L410 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:38,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:38,213 INFO L82 PathProgramCache]: Analyzing trace with hash 934869385, now seen corresponding path program 1 times [2019-10-13 23:01:38,213 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:38,213 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133128928] [2019-10-13 23:01:38,213 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:38,214 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:38,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:38,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:38,392 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 23:01:38,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133128928] [2019-10-13 23:01:38,393 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:38,393 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:01:38,393 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929766864] [2019-10-13 23:01:38,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:01:38,394 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:38,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:01:38,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:01:38,394 INFO L87 Difference]: Start difference. First operand 470 states and 547 transitions. Second operand 6 states.